Submission #110084

---

Source Code Expand

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <cassert>
#include <iomanip>

using namespace std;




struct st{
	int be;
	int en;
	
	st(int a, int b): be(a), en(b){}
	bool operator< (const st &s) const{
		return (this->be < s.be);
	}
};

bool solve(){
	int n;
	cin>> n;
	
	vector<st> vst;
	for(int i=0;i<n;i++){
		string str;
		cin>> str;
		int a, b;
		a = (str[0]-'0')*1000 + (str[1]-'0')*100 + (str[2]-'0')*10 + (str[3]-'0')*1;
		b = (str[5]-'0')*1000 + (str[6]-'0')*100 + (str[7]-'0')*10 + (str[8]-'0')*1;
		int a2 = a%10;
		a = a - a2 + ((0<=a2 && a2<=4) ? 0 : 5);
		int b2 = b%10;
		b = b - b2 + ((b2==0) ? 0 : ((1<=b2 && b2<=5) ? 5 :10));
		if((b%100)==60) b += 40;
//		cout<< a<< " "<< b<< endl;
		st s(a, b);
		vst.push_back(s);
	}
	
	sort(vst.begin(), vst.end());
	for(int i=0;i<vst.size();i++){
		cout<< setw(4) << setfill('0')<< vst[i].be<< "-";
		int end = vst[i].en;
		int num = i;
		for(int j=i;j<vst.size();j++){
			if(vst[j].be <= end){
				end = max(end,vst[j].en);
				num = j;
			}
		}
		i = num;
		cout<< setw(4) << setfill('0')<< end<< endl;
	}
	
	return true;
}

int main(){
	cout.setf(ios::fixed);
	cout.precision(10);
	solve();

	return 0;
}

 

Submission Info

Judge Result