Submission #2213909


Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1<<30)
#define INFLL (1ll<<60)
typedef pair<int, int> P;
typedef pair<ll, P> E;
#define MOD (1000000007ll)
#define l_ength size
#define PI 3.14159265358979

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	b += MOD;
	a += b;
	a %= MOD;
}

int main(void){
	ll n,i,ans;
	string s;
	cin >> s;
	n = s.l_ength();
	ans += n * (n-1);
	for(i=0ll; i<n; ++i){
		if(s[i] == 'D'){
			ans += (n-i-1);
		}else{
			ans += i;
		}
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Submission Time
Task B - Evilator
User ransewhale
Language C++14 (GCC 5.4.1)
Score 400
Code Size 600 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 4 ms 512 KB
06.txt AC 4 ms 512 KB
07.txt AC 4 ms 512 KB
08.txt AC 4 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