Submission #2520472
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define REP(i,a,b) for(int i=a;i<b;i++) #define rep(i,n) REP(i,0,n) typedef long long ll; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<ll> vl; ll N, L; vector<pair<ll,int>> r; ll ans = 0; int main() { //cin.tie(0); //ios::sync_with_stdio(false); cin >> N >> L; r.resize(N); rep(i,N) { ll x, d; char c; cin >> x >> c; if (c == 'R') d = 1; else d = 0; r[i] = pair<ll,int>(x,d); } rep(i,N) { if (r[i].second == 1) { int j = i; while (j < N && r[j].second == 1) j++; ll e = 0; ll c1 = 0; for (int k = j-1; k >= i; k--) { if (k == N-1) e += L - r[k].first; else e += r[k+1].first - r[k].first - 1; c1 += e; } int jj = j; while (jj < N && r[jj].second == 0) jj++; e = 0; ll c2 = 0; for (int k = j; k < jj; k++) { e += r[k].first - r[k-1].first - 1; c2 += e; } //cout << c1 << " " << c2 << endl; ans += max(c1, c2); i = jj-1; } else { int j = i; while (j < N && r[j].second == 0) j++; ll e = 0; ll c1 = 0; for (int k = i; k < j; k++) { if (k==0) e += r[k].first - 1; else e += r[k].first - r[k-1].first - 1; c1 += e; } ans += c1; i = j-1; } } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - ウサギ跳び |
User | bluenote |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1732 Byte |
Status | WA |
Exec Time | 49 ms |
Memory | 1792 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask1_01.txt | AC | 1 ms | 256 KB |
subtask1_02.txt | AC | 1 ms | 256 KB |
subtask1_03.txt | AC | 37 ms | 1792 KB |
subtask1_04.txt | AC | 37 ms | 1792 KB |
subtask1_05.txt | AC | 42 ms | 1792 KB |
subtask1_06.txt | AC | 43 ms | 1792 KB |
subtask1_07.txt | AC | 45 ms | 1792 KB |
subtask1_08.txt | AC | 49 ms | 1792 KB |
subtask1_09.txt | AC | 49 ms | 1792 KB |
subtask1_10.txt | AC | 49 ms | 1792 KB |
subtask1_11.txt | AC | 48 ms | 1792 KB |
subtask1_12.txt | AC | 37 ms | 1792 KB |
subtask1_13.txt | AC | 43 ms | 1792 KB |
subtask1_14.txt | AC | 49 ms | 1792 KB |
subtask1_15.txt | AC | 49 ms | 1792 KB |
subtask1_16.txt | AC | 49 ms | 1792 KB |
subtask1_17.txt | WA | 20 ms | 1024 KB |
subtask1_18.txt | WA | 21 ms | 1152 KB |
subtask1_19.txt | WA | 6 ms | 512 KB |
subtask1_20.txt | WA | 34 ms | 1664 KB |
subtask1_21.txt | WA | 11 ms | 640 KB |
subtask1_22.txt | WA | 17 ms | 896 KB |
subtask1_23.txt | WA | 30 ms | 1536 KB |
subtask1_24.txt | WA | 14 ms | 768 KB |
subtask1_25.txt | WA | 38 ms | 1536 KB |
subtask1_26.txt | WA | 45 ms | 1664 KB |
subtask1_27.txt | WA | 2 ms | 256 KB |
subtask1_28.txt | WA | 48 ms | 1792 KB |
subtask1_29.txt | WA | 34 ms | 1408 KB |
subtask1_30.txt | WA | 11 ms | 640 KB |
subtask1_31.txt | WA | 29 ms | 1152 KB |
subtask1_32.txt | WA | 46 ms | 1792 KB |