Submission #190622


Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>

using namespace std;

int main()
{
	pair<int,int> time[30001];
	pair<int,int> ans[30001];
	int N,i,j,ptr;
	int start[30001],finish[30001];

	scanf("%d",&N);

	for(i=0;i<N;i++)
	{
		scanf("%d-%d",&start[i],&finish[i]);
	}

	for(i=0;i<N;i++)
	{
		start[i]-=start[i]%5;
		finish[i]+=(finish[i]%5==0)?0:5-finish[i]%5;
		if(finish[i]%100==60) finish[i]+=40;
	}

	for(i=0;i<N;i++)
	{
		time[i].first=start[i];
		time[i].second=finish[i];
	}

	time[N].first=2500;

	sort(time,time+N);

	ptr=0;

	for(i=0;i<N;)
	{
		if(time[i+1].first<=time[i].second)
		{
			int max=time[i].second;
			j=i+1;
			while(time[j].first<=max)
			{
				if(max<time[j].second)
					max=time[j].second;
				j++;
			}
			ans[ptr].first=time[i].first;
			ans[ptr].second=max;
			ptr++;
			i=j;
		}
		else
		{
			ans[ptr].first=time[i].first;
			ans[ptr].second=time[i].second;
			i++;
			ptr++;
		}
	}

	for(i=0;i<ptr;i++)
	{
		printf("%04d-%04d\n",ans[i].first,ans[i].second);
	}

	return 0;
}
			

	

Submission Info

Submission Time
Task D - 感雨時刻の整理
User mosuzaki
Language C++ (G++ 4.6.4)
Score 100
Code Size 1101 Byte
Status AC
Exec Time 63 ms
Memory 1764 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:14:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:18:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]

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 26 ms 1440 KB
00_sample_02.txt AC 29 ms 1388 KB
00_sample_03.txt AC 26 ms 1440 KB
cho_cho_chokudai.txt AC 37 ms 1560 KB
chokudai_ga_cho.txt AC 48 ms 1592 KB
test_01.txt AC 33 ms 1396 KB
test_02.txt AC 26 ms 1332 KB
test_03.txt AC 29 ms 1328 KB
test_04.txt AC 36 ms 1396 KB
test_05.txt AC 40 ms 1388 KB
test_06.txt AC 26 ms 1392 KB
test_07.txt AC 33 ms 1384 KB
test_08.txt AC 34 ms 1384 KB
test_09.txt AC 31 ms 1388 KB
test_10.txt AC 43 ms 1388 KB
test_11.txt AC 33 ms 1384 KB
test_12.txt AC 36 ms 1392 KB
test_13.txt AC 45 ms 1440 KB
test_14.txt AC 44 ms 1428 KB
test_15.txt AC 56 ms 1332 KB
test_16.txt AC 24 ms 1392 KB
test_17.txt AC 26 ms 1388 KB
test_18.txt AC 25 ms 1328 KB
test_19.txt AC 25 ms 1384 KB
test_20.txt AC 27 ms 1372 KB
test_21.txt AC 53 ms 1516 KB
test_22.txt AC 45 ms 1576 KB
test_23.txt AC 38 ms 1648 KB
test_24.txt AC 63 ms 1524 KB
test_25.txt AC 41 ms 1624 KB
test_26.txt AC 53 ms 1508 KB
test_27.txt AC 36 ms 1628 KB
test_28.txt AC 42 ms 1576 KB
test_29.txt AC 44 ms 1388 KB
test_30.txt AC 30 ms 1436 KB
test_31.txt AC 46 ms 1548 KB
test_32.txt AC 26 ms 1368 KB
test_33.txt AC 44 ms 1524 KB
test_34.txt AC 24 ms 1316 KB
test_35.txt AC 32 ms 1356 KB
test_36.txt AC 45 ms 1584 KB
test_37.txt AC 40 ms 1576 KB
test_38.txt AC 36 ms 1576 KB
test_39.txt AC 41 ms 1764 KB
test_40.txt AC 40 ms 1580 KB
test_41.txt AC 36 ms 1576 KB
test_42.txt AC 39 ms 1580 KB
test_43.txt AC 39 ms 1628 KB