Submission #191017
Source Code Expand
#include<iostream> #include<cstdio> #include<vector> #include<algorithm> #define rep(i,n) for(int i = 0; i < n; ++i) #define rec(i,m,n) for(int i = m; i < n; ++i) using namespace std; int main(){ int N; cin >> N; vector<int> S(N); vector<int> E(N); rep(i,N){ scanf("%d-%d",&S[i],&E[i]); if(S[i]%10 < 5) S[i] -= S[i]%10; else if(S[i]%10 > 5) S[i] -= (S[i]%10 - 5); if(E[i]%10 < 5 && E[i]%10 != 0) E[i] += (5 - E[i]%10); else if(E[i]%10 > 5) E[i] += (10 - E[i]%10); if(E[i]%100 == 60) E[i] += 40; } rep(i,N){ rep(j,N){ if(S[i] < S[j]){ int s,e; s = S[i]; S[i] = S[j]; S[j] = s; e = E[i]; E[i] = E[j]; E[j] = e; } } } rep(i,N) cout << S[i] << "-" << E[i] << endl; if(N == 1){ cout << S[0] << "-" << E[0] << endl; } else{ int SS = S[0]; int EE = E[0]; rec(i,1,S.size()){ if((SS <= S[i] && S[i] <= EE) && EE < E[i]) EE = E[i]; if(EE < S[i + 1]){ cout << SS << "-" << EE << endl; if(i+1 < S.size()){ SS = S[i + 1]; EE = E[i + 1]; } } } } }
Submission Info
Submission Time | |
---|---|
Task | A - 積雪深差 |
User | MurATa25 |
Language | C++ (G++ 4.6.4) |
Score | 0 |
Code Size | 1287 Byte |
Status | WA |
Exec Time | 256 ms |
Memory | 936 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:22:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
Judge Result
Set Name | all | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
all | 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_01.txt | WA | 20 ms | 796 KB |
00_sample_02.txt | RE | 255 ms | 676 KB |
00_sample_03.txt | WA | 21 ms | 932 KB |
test_01.txt | RE | 250 ms | 676 KB |
test_02.txt | WA | 37 ms | 800 KB |
test_03.txt | RE | 256 ms | 800 KB |
test_04.txt | WA | 37 ms | 748 KB |
test_05.txt | WA | 34 ms | 804 KB |
test_06.txt | WA | 25 ms | 932 KB |
test_07.txt | WA | 25 ms | 804 KB |
test_08.txt | WA | 31 ms | 932 KB |
test_09.txt | WA | 29 ms | 936 KB |
test_10.txt | WA | 23 ms | 732 KB |
test_11.txt | WA | 29 ms | 796 KB |
test_12.txt | WA | 27 ms | 804 KB |
test_13.txt | WA | 29 ms | 808 KB |
test_14.txt | WA | 32 ms | 800 KB |
test_15.txt | WA | 32 ms | 928 KB |
test_16.txt | WA | 35 ms | 928 KB |
test_17.txt | WA | 22 ms | 928 KB |