Submission #1481318


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
int n;
int s[2410];
int last[2410],anss[2410],anse[2410];

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		int a,b;
		scanf("%d-%d",&a,&b);
		while(a%5!=0){
			a--;
		}
		if(a%100>=60){
			a=(a/100+1)*100;
		}
		while(b%5!=0){
			b++;
		}
		if(b%100>=60){
			b=(b/100+1)*100;
		}
		//cout<<a<<" "<<b<<endl;
		s[a]++;
		s[b+1]--;
	}
	last[0]=s[0];
	for(int i=1;i<2410;i++){
		last[i]=last[i-1]+s[i];
	}
	int now=0;
	bool flag=0;
	for(int i=0;i<2410;i++){
		if(last[i]>0 && !flag){
			anss[now]=i;
			flag=1;
		}
		if(last[i]==0 && flag){
			anse[now]=i-1;
			flag=0;
			now++;
		}
	}
	for(int i=0;i<now;i++){
		if(anss[i]<10){
			cout<<"000"<<anss[i];
		}else if(anss[i]<100){
			cout<<"00"<<anss[i];
		}else if(anss[i]<1000){
			cout<<"0"<<anss[i];
		}else cout<<anss[i];
		cout<<"-";
		if(anse[i]<10){
			cout<<"000"<<anse[i];
		}else if(anse[i]<100){
			cout<<"00"<<anse[i];
		}else if(anse[i]<1000){
			cout<<"0"<<anse[i];
		}else cout<<anse[i];
		cout<<endl;
	}
	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User aim_cpo
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1137 Byte
Status AC
Exec Time 7 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:13:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d-%d",&a,&b);
                       ^

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 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
cho_cho_chokudai.txt AC 7 ms 256 KB
chokudai_ga_cho.txt AC 6 ms 256 KB
test_01.txt AC 1 ms 256 KB
test_02.txt AC 1 ms 256 KB
test_03.txt AC 1 ms 256 KB
test_04.txt AC 1 ms 256 KB
test_05.txt AC 1 ms 256 KB
test_06.txt AC 1 ms 256 KB
test_07.txt AC 1 ms 256 KB
test_08.txt AC 1 ms 256 KB
test_09.txt AC 1 ms 256 KB
test_10.txt AC 1 ms 256 KB
test_11.txt AC 1 ms 256 KB
test_12.txt AC 1 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 1 ms 256 KB
test_15.txt AC 1 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 1 ms 256 KB
test_18.txt AC 1 ms 256 KB
test_19.txt AC 1 ms 256 KB
test_20.txt AC 1 ms 256 KB
test_21.txt AC 7 ms 256 KB
test_22.txt AC 7 ms 256 KB
test_23.txt AC 7 ms 256 KB
test_24.txt AC 7 ms 256 KB
test_25.txt AC 7 ms 256 KB
test_26.txt AC 7 ms 256 KB
test_27.txt AC 6 ms 256 KB
test_28.txt AC 7 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 2 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 5 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 7 ms 256 KB
test_37.txt AC 7 ms 256 KB
test_38.txt AC 7 ms 256 KB
test_39.txt AC 7 ms 256 KB
test_40.txt AC 7 ms 256 KB
test_41.txt AC 6 ms 256 KB
test_42.txt AC 6 ms 256 KB
test_43.txt AC 6 ms 256 KB