Submission #3749605
Source Code Expand
#include <cstdio> #include <vector> #include <algorithm> #include <iostream> #include <cstring> using namespace std ; typedef long long ll ; # define rep (i , n ) for ( int i =0; i < n ; i++) # define _sort(arg) sort(begin(arg), end(arg)) /* bool check_valid(bool up, int i, int layer) { if (up) { } } */ int main() { cin.tie(NULL); ios::sync_with_stdio(false); string S; cin >> S; int layer = S.size(); int total = 0; for (int i = 0; i < layer; i++) { for (int j = 0; j < layer; j++) { if ( i == j ) { continue; } if (i < j) { if (S[i] == 'U') { total++; } else if (S[i] == 'D') { /* //bool up = false; int k = 0; for (k = 0; k < i; k++) { if (S[k] == 'U') { break; } } if (k < i) { total += 2; } */ total += 2; } } else if (i > j) { if (S[i] == 'D') { total++; } else if (S[i] == 'U') { /* int k = 0; for (k = i+1; k < layer; k++) { if (S[k] == 'D') { break; } } if (k < layer) { total += 2; } */ total += 2; } } } } cout << total << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Evilator |
User | yly |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1336 Byte |
Status | TLE |
Exec Time | 2103 ms |
Memory | 512 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | TLE | 2103 ms | 512 KB |
02.txt | TLE | 2103 ms | 512 KB |
03.txt | TLE | 2103 ms | 512 KB |
04.txt | TLE | 2103 ms | 512 KB |
05.txt | TLE | 2103 ms | 512 KB |
06.txt | TLE | 2103 ms | 512 KB |
07.txt | TLE | 2103 ms | 512 KB |
08.txt | TLE | 2103 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 |