Submission #225616


Source Code Expand

#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <string>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cstdio>
#include <queue>
#include <sstream>
#include <cstring>
using namespace std;

const int INF = 1<<29;
typedef pair<int,int> P;
typedef long long ll;

const int MAX = 30001;

string print(int value){
   stringstream ss;
   string res;
   string zeros = "";
   ss << value;
   ss >> res;
   for(int i=0; i<4-res.size(); i++) zeros += '0';
   return zeros + res;
}

int main(){

   P p[MAX];
   int N;
   while(cin >> N){
      for(int i=0; i<N; i++){
	 scanf("%d-%d",&p[i].first,&p[i].second);
	 if(p[i].first % 10 > 5) p[i].first -= ((p[i].first % 10) - 5);
	 else if(p[i].first % 10 > 0 && p[i].first % 10 != 5) p[i].first -= p[i].first % 10;
	 if(p[i].second % 10 > 4) p[i].second += 10 - p[i].second % 10;
	 else if(p[i].second % 10 > 0) p[i].second += 5 - p[i].second % 10;

	 if(p[i].second % 100 == 60){
	    p[i].second -= p[i].second % 100;
	    p[i].second += 100;
	 }

	 
      }

      sort(p,p+N);

      int s = p[0].first;
      int e = p[0].second;

      for(int i=1; i<N; i++){
	 int a = p[i].first, b = p[i].second;
	 if(a >= s && a <= e){
	    s = min(s,a);
	    e = max(e,b);
	 } else {
	    cout << print(s) << "-" << print(e) << endl;
	    s = a;
	    e = b;
	 }
      }

      cout << print(s) << "-" << print(e) << endl;
      
   }
   return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User tonkotsu
Language C++ (GCC 4.4.7)
Score 0
Code Size 1522 Byte
Status WA
Exec Time 42 ms
Memory 1288 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result

Judge Result

Set Name all
Score / Max Score 0 / 100
Status
AC × 35
WA × 13
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, cho_cho_chokudai.txt, chokudai_ga_cho.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, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 26 ms 1176 KB
00_sample_02.txt AC 27 ms 1180 KB
00_sample_03.txt AC 28 ms 1140 KB
cho_cho_chokudai.txt AC 36 ms 1196 KB
chokudai_ga_cho.txt AC 37 ms 1256 KB
test_01.txt WA 28 ms 1116 KB
test_02.txt WA 25 ms 1196 KB
test_03.txt WA 29 ms 1136 KB
test_04.txt WA 27 ms 1116 KB
test_05.txt WA 25 ms 1124 KB
test_06.txt AC 28 ms 1064 KB
test_07.txt AC 26 ms 1252 KB
test_08.txt AC 26 ms 1264 KB
test_09.txt AC 27 ms 1188 KB
test_10.txt AC 27 ms 1196 KB
test_11.txt AC 26 ms 1252 KB
test_12.txt AC 30 ms 1132 KB
test_13.txt AC 27 ms 1196 KB
test_14.txt AC 26 ms 1252 KB
test_15.txt AC 27 ms 1196 KB
test_16.txt AC 26 ms 1252 KB
test_17.txt AC 30 ms 1180 KB
test_18.txt AC 28 ms 1112 KB
test_19.txt AC 30 ms 1208 KB
test_20.txt AC 27 ms 1188 KB
test_21.txt AC 42 ms 1128 KB
test_22.txt AC 40 ms 1196 KB
test_23.txt AC 40 ms 1120 KB
test_24.txt AC 42 ms 1256 KB
test_25.txt AC 38 ms 1252 KB
test_26.txt AC 40 ms 1264 KB
test_27.txt AC 35 ms 1260 KB
test_28.txt WA 38 ms 1192 KB
test_29.txt AC 28 ms 1268 KB
test_30.txt WA 26 ms 1192 KB
test_31.txt WA 31 ms 1120 KB
test_32.txt WA 26 ms 1248 KB
test_33.txt WA 34 ms 1120 KB
test_34.txt AC 26 ms 1196 KB
test_35.txt WA 26 ms 1188 KB
test_36.txt AC 41 ms 1260 KB
test_37.txt WA 41 ms 1264 KB
test_38.txt AC 38 ms 1204 KB
test_39.txt AC 40 ms 1288 KB
test_40.txt WA 39 ms 1252 KB
test_41.txt AC 35 ms 1120 KB
test_42.txt AC 37 ms 1120 KB
test_43.txt AC 34 ms 1244 KB