Submission #1310273
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#ifdef SG
#include <debug.h>
#else
template<typename T> struct outputer;
struct outputable {};
#define PRINT(...)
#define OUTPUT(...)
#define show(...)
#define debug(...)
#define deepen(...)
#define timer(...)
#define fbegin(...)
#define fend
#define pbegin(...)
#define pend
#endif
#define ARG4(_1,_2,_3,_4,...) _4
#define forn3(i,l,r) for (int i = int(l); i < int(r); ++i)
#define forn2(i,n) forn3 (i, 0, n)
#define forn(...) ARG4(__VA_ARGS__, forn3, forn2) (__VA_ARGS__)
#define ford3(i,l,r) for (int i = int(r) - 1; i >= int(l); --i)
#define ford2(i,n) ford3 (i, 0, n)
#define ford(...) ARG4(__VA_ARGS__, ford3, ford2) (__VA_ARGS__)
#define ve vector
#define pa pair
#define tu tuple
#define mp make_pair
#define mt make_tuple
#define pb emplace_back
#define fs first
#define sc second
#define all(a) (a).begin(), (a).end()
#define sz(a) ((int)(a).size())
typedef long double ld;
typedef int64_t ll;
typedef uint64_t ull;
typedef uint32_t ui;
typedef uint16_t us;
typedef uint8_t uc;
typedef pa<int, int> pii;
typedef pa<int, ll> pil;
typedef pa<ll, int> pli;
typedef pa<ll, ll> pll;
typedef ve<int> vi;
template<typename T> inline auto sqr (T x) -> decltype(x * x) {return x * x;}
template<typename T1, typename T2> inline bool umx (T1& a, T2 b) {if (a < b) {a = b; return 1;} return 0;}
template<typename T1, typename T2> inline bool umn (T1& a, T2 b) {if (b < a) {a = b; return 1;} return 0;}
struct Input {
string s;
bool read () {
return !!getline(cin, s);
}
void init (const Input &input) {
*this = input;
}
};
struct Data: Input {
ll ans;
void write () {
cout << ans << endl;
}
};
namespace Main {
struct Solution: Data {
void solve () {
ans = 0;
forn (i, sz(s)) {
ans += sz(s) - 1;
if (s[i] == 'U') {
ans += i;
} else {
ans += sz(s) - 1 - i;
}
}
}
void clear () {
*this = Solution();
}
};
}
Main::Solution sol;
int main () {
cout.setf(ios::showpoint | ios::fixed);
cout.precision(20);
#ifdef SG
freopen((problemname + ".in").c_str(), "r", stdin);
// freopen((problemname + ".out").c_str(), "w", stdout);
while (sol.read()) {
sol.solve();
sol.write();
sol.clear();
}
#else
sol.read();
sol.solve();
sol.write();
#endif
/*
int t;
cin >> t;
forn (i, t) {
sol.read();
sol.solve();
sol.write();
sol.clear();
}
*/
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Evilator |
User |
baz93 |
Language |
C++14 (GCC 5.4.1) |
Score |
400 |
Code Size |
2560 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 |
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 |