Submission #109347


Source Code Expand

#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
#include <cmath>
#include <complex>
#include <map>
using namespace std;

#define rep(i,n) for(int i=0;i<int(n);++i)

static const double PI=6*asin(0.5);
typedef complex<double> P;
typedef long long ll;

int n;
int a,b;
vector<P> s;
char t;
int tmp;

bool asc(const P a,const P b){
	return a.real() == b.real() ? imag(a)<imag(b):real(a)<real(b);
}

int main(){
	cin>>n;
	rep(i,n){
		cin>>a>>t>>b;
		while(a%5!=0) a--;
		while(b%5!=0) b++;
		if(b%100==60) b+=40;
		P c(a,b);
		s.push_back(c);
	}
	sort(s.begin(),s.end(),asc);
	rep(i,n){
		//cout<<real(s[i])<<" "<<imag(s[i])<<endl;
	}
	//cout<<endl;
	rep(i,n-1){
		if(real(s[i])==real(s[i+1])&&imag(s[i])==imag(s[i+1])){
			s.erase(s.begin()+i);
			i--;
			n--;
		}
	}
	//n-=c;
	rep(i,n){
		//cout<<real(s[i])<<" "<<imag(s[i])<<endl;
	}
	int t=s[0].imag();
	tmp=real(s[0]);
			int c=3;
			while(tmp/10!=0){
				c--;
				tmp/=10;
			}
			rep(j,c) cout<<"0";
	cout<<s[0].real()<<"-";
	if(n==1){
		tmp=imag(s[0]);
			int c=3;
			while(tmp/10!=0){
				c--;
				tmp/=10;
			}
			rep(j,c) cout<<"0";
		
		cout<<s[0].imag()<<endl;
	}
	for(int i=1;i<n;i++){
		//cout<<"    "<<s[i].real()<<" "<<t<<endl;
		if(i==n-1){
			if(s[i].real()<t){
			//t=s[i].imag();
				tmp=t;
				int c=3;
				while(tmp/10!=0){
					c--;
					tmp/=10;
				}
				rep(j,c) cout<<"0";
				cout<<t<<endl;
			}
			else if(s[i].real()==t){
			//t=s[i].imag();
				tmp=imag(s[i]);
				int c=3;
				while(tmp/10!=0){
					c--;
					tmp/=10;
				}
				rep(j,c) cout<<"0";
				cout<<imag(s[i])<<endl;
			}
			else{
				tmp=t;
			int c=3;
			while(tmp/10!=0){
				c--;
				tmp/=10;
			}
			rep(j,c) cout<<"0";
			cout<<t<<endl;
			tmp=real(s[i]);
			c=3;
			while(tmp/10!=0){
				c--;
				tmp/=10;
			}
			rep(j,c) cout<<"0";
			cout<<s[i].real()<<"-";
			tmp=imag(s[i]);
			c=3;
			while(tmp/10!=0){
				c--;
				tmp/=10;
			}
			rep(j,c) cout<<"0";
				cout<<s[i].imag()<<endl;
			//cout<<t<<endl;
			break;
			}
		}
		if(s[i].real()<=t){
			int tm = imag(s[i]);
			t=max(t,tm);
			//cout<<"t  "<<t<<endl;
		}
		else{
			//cout<<"hoge";
			tmp=t;
			int c=3;
			while(tmp/10!=0){
				c--;
				tmp/=10;
			}
			rep(j,c) cout<<"0";
			cout<<t<<endl;
			tmp = real(s[i]);
			c=3;
			while(tmp/10!=0){
				c--;
				tmp/=10;
			}
			rep(j,c) cout<<"0";
			cout<<s[i].real()<<"-";
			t=s[i].imag();
		}
	}
	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User j_gui0121
Language C++ (G++ 4.6.4)
Score 100
Code Size 2626 Byte
Status AC
Exec Time 953 ms
Memory 1556 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 48
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 22 ms 792 KB
00_sample_02.txt AC 20 ms 920 KB
00_sample_03.txt AC 24 ms 788 KB
cho_cho_chokudai.txt AC 892 ms 1448 KB
chokudai_ga_cho.txt AC 293 ms 1320 KB
test_01.txt AC 22 ms 916 KB
test_02.txt AC 25 ms 808 KB
test_03.txt AC 23 ms 808 KB
test_04.txt AC 22 ms 924 KB
test_05.txt AC 23 ms 920 KB
test_06.txt AC 22 ms 928 KB
test_07.txt AC 21 ms 876 KB
test_08.txt AC 23 ms 800 KB
test_09.txt AC 20 ms 916 KB
test_10.txt AC 20 ms 920 KB
test_11.txt AC 21 ms 920 KB
test_12.txt AC 23 ms 852 KB
test_13.txt AC 24 ms 812 KB
test_14.txt AC 27 ms 812 KB
test_15.txt AC 25 ms 920 KB
test_16.txt AC 24 ms 916 KB
test_17.txt AC 26 ms 920 KB
test_18.txt AC 23 ms 804 KB
test_19.txt AC 24 ms 920 KB
test_20.txt AC 26 ms 920 KB
test_21.txt AC 633 ms 1444 KB
test_22.txt AC 365 ms 1452 KB
test_23.txt AC 546 ms 1444 KB
test_24.txt AC 367 ms 1320 KB
test_25.txt AC 430 ms 1444 KB
test_26.txt AC 953 ms 1316 KB
test_27.txt AC 931 ms 1556 KB
test_28.txt AC 874 ms 1320 KB
test_29.txt AC 22 ms 812 KB
test_30.txt AC 19 ms 792 KB
test_31.txt AC 42 ms 940 KB
test_32.txt AC 20 ms 808 KB
test_33.txt AC 399 ms 1316 KB
test_34.txt AC 20 ms 916 KB
test_35.txt AC 22 ms 920 KB
test_36.txt AC 444 ms 1320 KB
test_37.txt AC 893 ms 1448 KB
test_38.txt AC 885 ms 1448 KB
test_39.txt AC 888 ms 1400 KB
test_40.txt AC 859 ms 1320 KB
test_41.txt AC 925 ms 1448 KB
test_42.txt AC 901 ms 1440 KB
test_43.txt AC 899 ms 1444 KB