Submission #1111506

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
//#define int long long

pair<int, int> data[30000] = {};
signed main() {
	int N; cin >> N;
	for (int i = 0; i<N; i++) {
		string tmp;
		cin >> tmp;
		int a[4];
		int b[4];
		b[2] = ((int)tmp[0] - '0') * 10 + ((int)tmp[1] - '0');
		b[1] = ((int)tmp[2] - '0');
		b[0] = ((int)tmp[3] - '0');
		a[2] = ((int)tmp[5] - '0') * 10 + ((int)tmp[6] - '0');
		a[1] = ((int)tmp[7] - '0');
		a[0] = ((int)tmp[8] - '0');
		int ta = 0;
		for (int j = 0; j<3; j++) {
			if (j == 0) {
				if (a[j] % 5 != 0) {
          if(a[j]<=5) a[j]=5;
          else a[j]=10;
					if (a[j]>9) {
						a[j] = 0;
						ta++;
					}
				}
				if (b[j] % 5 != 0) {
          if(b[j]<=5) b[j]=0;
          else b[j]=5;
				}
			}
			else if (j == 1) {
				if (ta == 1) {
					a[j]++;
					if (a[j]>5) {
						a[j] = 0;
						ta++;
					}
				}
			}
			else if (j == 2) {
				if (ta == 2) {
					a[j]++;
				}
			}
		}
		data[i].first = b[2] * 100 + b[1] * 10 + b[0] * 1;
		data[i].second = a[2] * 100 + a[1] * 10 + a[0] * 1;
	}

  sort(data,data+N);

  int t1=0,t2=0;
  for(int i=0;i<N;i++){
    if(i==0){
      t1=data[i].first;
      t2=data[i].second;
    }
    else{
      if(data[i].first<=t2){
        t1=min(t1,data[i].first);
        t2=max(t2,data[i].second);
      }
      else{
         printf("%04d-%04d\n",t1,t2);
         t1=data[i].first;
         t2=data[i].second;
       }
    }
    if(i==(N-1)) printf("%04d-%04d\n",t1,t2);

  }
	return 0;
}

Submission Info

Judge Result