Submission #1603603
Source Code Expand
// #include {{{ #include <array> #include <vector> #include <deque> #include <queue> #include <set> #include <unordered_set> #include <map> #include <unordered_map> #include <string> #include <algorithm> #include <numeric> #include <functional> #include <iterator> #include <tuple> #include <utility> #include <random> #include <limits> #include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <cstdint> #include <cassert> // }}} using namespace std; // macros {{{ template<typename T, size_t N> constexpr size_t NELEMS(T (&)[N]) { return N; } template<typename InputIt> void PRINT_RANGE(InputIt first, InputIt last) { for(; first != last; ++first) cout << *first << (first==last ? "" : " "); cout << "\n"; } template<typename T> void PRINT_MATRIX(T mat, size_t nr, size_t nc) { for(size_t r = 0; r < nr; ++r) { for(size_t c = 0; c < nc; ++c) { cout << mat[r][c] << (c==nc-1 ? "" : " "); } cout << "\n"; } } #define FOR(i, start, end) for(int i = (start); i < (end); ++i) #define REP(i, n) FOR(i, 0, n) // }}} // types {{{ using ll = long long; using ull = unsigned long long; // }}} ll N; string S; void solve() { ll total = 0; for(ll i = 0; i < N; ++i) { ll cnt = 0; if(S[i] == 'U') { cnt += N-i-1; cnt += 2*i; } else { cnt += i; cnt += 2 * (N-i-1); } total += cnt; } cout << total << "\n"; } int main() { cin >> S; N = S.size(); solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Evilator |
User | yumsiim |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1600 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 |