Submission #5894613
Source Code Expand
#include<iostream> #include<vector> using namespace std; int N,L; long ans; main() { cin>>N>>L; vector<pair<int,int> >a; vector<pair<int,bool> >A; A.push_back(make_pair(0,false)); for(int i=0;i<N;i++) { int x;char d;cin>>x>>d; A.push_back(make_pair(x,d=='L')); } A.push_back(make_pair(L+1,true)); for(int i=0;i<A.size();i++) { int j=i; while(i+1<A.size()&&A[i].second==A[i+1].second)i++; if(A[j].second) { for(int k=j;k<=i;k++)ans+=A[k].first-A[j].first-(k-j); a.push_back(make_pair(A[j].first,i-j+1)); } else { for(int k=j;k<=i;k++)ans+=A[i].first-A[k].first-(i-k); a.push_back(make_pair(A[i].first,i-j+1)); } } a[0].second--; a.back().second--; for(int i=0;i<a.size();i+=2) { ans+=1L*max(a[i].second,a[i+1].second)*(a[i+1].first-a[i].first-1); } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | C - ウサギ跳び |
User | kotatsugame |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 858 Byte |
Status | WA |
Exec Time | 51 ms |
Memory | 2548 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 | 38 ms | 1400 KB |
subtask1_04.txt | AC | 38 ms | 1400 KB |
subtask1_05.txt | AC | 43 ms | 1400 KB |
subtask1_06.txt | AC | 43 ms | 1400 KB |
subtask1_07.txt | AC | 48 ms | 1400 KB |
subtask1_08.txt | AC | 49 ms | 1400 KB |
subtask1_09.txt | AC | 50 ms | 1400 KB |
subtask1_10.txt | AC | 49 ms | 1400 KB |
subtask1_11.txt | AC | 51 ms | 2548 KB |
subtask1_12.txt | WA | 38 ms | 1400 KB |
subtask1_13.txt | AC | 44 ms | 1400 KB |
subtask1_14.txt | WA | 49 ms | 1400 KB |
subtask1_15.txt | WA | 49 ms | 1400 KB |
subtask1_16.txt | AC | 51 ms | 2548 KB |
subtask1_17.txt | AC | 20 ms | 1144 KB |
subtask1_18.txt | AC | 22 ms | 1144 KB |
subtask1_19.txt | WA | 6 ms | 512 KB |
subtask1_20.txt | AC | 35 ms | 1780 KB |
subtask1_21.txt | AC | 11 ms | 640 KB |
subtask1_22.txt | AC | 17 ms | 1016 KB |
subtask1_23.txt | AC | 32 ms | 1652 KB |
subtask1_24.txt | WA | 15 ms | 892 KB |
subtask1_25.txt | AC | 39 ms | 1652 KB |
subtask1_26.txt | WA | 45 ms | 1780 KB |
subtask1_27.txt | WA | 2 ms | 256 KB |
subtask1_28.txt | WA | 50 ms | 1908 KB |
subtask1_29.txt | AC | 35 ms | 1652 KB |
subtask1_30.txt | WA | 12 ms | 640 KB |
subtask1_31.txt | WA | 30 ms | 1272 KB |
subtask1_32.txt | WA | 47 ms | 1908 KB |