Submission #11427976


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll,ll> pll;
const ll mod=1e9+7;
//const ll mod=998244353;
const ll inf=1e18;

int main() {
  string s;
  cin >> s;
  ll n=s.size();
  ll ans=0;
  for(ll i=0;i<n;i++) {
    if(s[i]=='U') {
      ans+=n-i-1;
      ans+=i*2;
    }
    else {
      ans+=(n-i-1)*2;
      ans+=i;
    }
  }
  cout << ans << endl;
}

Submission Info

Submission Time
Task B - Evilator
User mahala_coder
Language C++14 (GCC 5.4.1)
Score 400
Code Size 464 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