Submission #1771882
Source Code Expand
#include <iostream> #include <cstdio> #include <climits> #include <algorithm> #include <queue> #include <cstring> #include <cmath> #include <vector> #include <list> #include <stack> #include <bitset> #include <string> #include <stack> #include <set> #include <map> #include <string> #include <deque> #include <ctime> #define s(n) scanf("%d",&n) #define sl(n) scanf("%lld",&n) #define ss(n) scanf("%s",n) #define s2(a,b) scanf("%d%d",&a,&b) #define SET(p) memset(p,-1,sizeof(p)) #define CLR(p) memset(p,0,sizeof(p)) #define vi vector<int> #define ii pair<int,int> #define pb push_back #define mp make_pair #define F first #define S second #define LL long long #define ULL unsigned long long #define R freopen("in","r",stdin) #define W freopen("out","w",stdout) using namespace std; int main() { string str; cin>>str; long long ans = 0; int n = str.size(); for(int i=0;i<n;i++) { if(str[i]=='U'){ ans += 1LL*(n-1-i)*1; ans += 1LL*i*2; } else { ans += 1LL*(n-1-i)*2; ans += 1LL*i*1; } } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Evilator |
User | aman1893 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1089 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 512 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 400 / 400 | ||||
Status |
|
|
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 |