Submission #1311250


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%lld",&x)
#define slld(x) scanf("%lld",&x)
#define ss(x) scanf("%s",x)
#define mod 1000000007
#define bitcount __builtin_popcountll
#define ll long long
#define pb push_back
#define pi pair<ll,ll>
#define pii pair<pi,ll>
#define mp make_pair
string s;
int main()
{
	ll i,j,k;
	cin>>s;
	ll x=s.size();
	ll ans=0;
	for(i=0;i<s.size();i++)
	{
		if(s[i]=='U')
		{
			ans+=x-i-1;
			ans+=2*i;
		}
		else
		{
			ans+=2*(x-i-1);
			ans+=i;
		}
	}
	printf("%lld\n",ans );
	return 0;
}

Submission Info

Submission Time
Task A - A+...+B Problem
User bharatkhanna1995
Language C++14 (GCC 5.4.1)
Score 0
Code Size 576 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