Submission #308868

---

Source Code Expand

#include <iostream>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#include <stdlib.h>
#include <math.h>
#include <stdio.h>

using namespace std;

int max(int a,int b){
	if(a>=b)return a;
	else return b;
}


void swap(int *a,int *b){
	int tmp = *a;
	*a = *b;
	*b = tmp;
}

int main(){

	int n;
	int *s,*d;

	cin>>n;
	s = new int[n];
	d = new int[n];

	char tmp;

	for(int i=0;i<n;i++){
		cin>>s[i]>>tmp>>d[i];
	}

	//丸めマン
	for(int i=0;i<n;i++){
		if(s[i]%10>=5){
			s[i] = s[i] - s[i]%10 +5;
		}
		else{
			s[i] = s[i] -s[i]%10;
		}

		if(d[i]%10>5){
			d[i] = d[i] - d[i]%10+10;
		}
		else if(d[i]%10!=0){
			d[i] = d[i] -d[i]%10+5;
		}
	//	cout<<s[i]<<"-"<<d[i]<<endl;
		if(s[i]%100==60){
			s[i] = s[i] +40;
		}
		if(d[i]%100==60){
			d[i] = d[i]+40;
		}
	}


	//sort
	for(int i=0;i<n;i++){
		for(int j=n-1;j>i;j--){
			if(s[j]<=s[j-1]){
				swap(&s[j],&s[j-1]);
				swap(&d[j],&d[j-1]);
			}
		}
	}

	//action
	
	int start,end;
	int state=0;
	start=s[0],end=d[0];
	for(int i=1;i<n;i++){
		//終点が次の時系列に届いてなければ出力

		if(end<s[i]){
			printf("%04d-%04d\n",start,end);
			start=s[i];
			end  =d[i];
		}
		//終点を延長できるようなら延長する
		else if(end<=d[i]){
			end = d[i];
		}
	}

	printf("%04d-%04d\n",start,end);

	return 0;
}

Submission Info

Judge Result