Submission #1797518


Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define INF 1<<30
#define LINF 1LL<<60

int main(void) {
    cin.tie(0); ios::sync_with_stdio(false);
    string S; cin >> S;
    ll N = S.length();
    ll res = 0;
    for(int i = 0; i < N;i++){
        if(S[i] == 'U'){
            res += N - (i+1) + 2*i;
        }else{
            res += 2*(N - (i+1)) + i;
        }
    }
    cout << res << endl;
    return 0;
}

Submission Info

Submission Time
Task A - A+...+B Problem
User clavis1107
Language C++14 (GCC 5.4.1)
Score 0
Code Size 512 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
AC × 2
WA × 2
AC × 4
WA × 8
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt, s4.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, s1.txt, s2.txt, s3.txt, s4.txt
Case Name Status Exec Time Memory
01.txt WA 1 ms 256 KB
02.txt WA 1 ms 256 KB
03.txt WA 1 ms 256 KB
04.txt WA 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt WA 1 ms 256 KB
08.txt WA 1 ms 256 KB
s1.txt WA 1 ms 256 KB
s2.txt AC 1 ms 256 KB
s3.txt AC 1 ms 256 KB
s4.txt WA 1 ms 256 KB