Submission #1698271


Source Code Expand

#include "bits/stdc++.h"
#define rep(i,n) for(int i=0;i<n;i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long LL;
const int INF = 1 << 25;
const LL MOD = 1000000007LL;
using namespace std;
typedef pair<int, int> P;

int main() {
	string S;
	cin >> S;
	LL sum = 0;
	rep(i, S.size()) {
		if (S[i] == 'U') {
			sum += S.size() - i - 1;
			sum += i * 2;
		}
		else {
			sum += (S.size() - i - 1) * 2;
			sum += i;
		}
	}
	cout << sum << endl;
}

Submission Info

Submission Time
Task B - Evilator
User Div9851
Language C++14 (GCC 5.4.1)
Score 400
Code Size 472 Byte
Status AC
Exec Time 5 ms
Memory 512 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 12
Set Name Test Cases
Sample s1.txt, s2.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, s1.txt, s2.txt
Case Name Status Exec Time Memory
01.txt AC 5 ms 512 KB
02.txt AC 5 ms 512 KB
03.txt AC 5 ms 512 KB
04.txt AC 5 ms 512 KB
05.txt AC 5 ms 512 KB
06.txt AC 5 ms 512 KB
07.txt AC 5 ms 512 KB
08.txt AC 5 ms 512 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
s1.txt AC 1 ms 256 KB
s2.txt AC 1 ms 256 KB