Submission #108313


Source Code Expand

#include<algorithm>
#include<functional>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<vector>
#include<list>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<bitset>
#include<climits>

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define FOR(itr,data) for(__typeof((data).begin()) itr=(data).begin();itr!=(data).end();++itr)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

typedef unsigned long long UInt64;
typedef long long Int64;

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

using namespace std;

typedef pair<int ,int > P;

int n;
int S[30007],E[30007];

int a[487];

int main()
{
	cin>>n;
	rep(i,n) scanf("%d-%d",S+i,E+i);

	rep(i,n)
	{
		while(S[i]%5!=0) S[i]--;
		while(E[i]%5!=0) E[i]++;
		ostringstream os;
		os<<E[i];
		string tmp=os.str();
		if(tmp[tmp.size()-2]=='6') E[i]+=40;
	}

	rep(i,n)
	{
		for(int j=S[i]/5;j<E[i]/5;j++) a[j]++;
		//cout<<S[i]<<","<<E[i]<<endl;
	}

	bool f=false;
	for(int i=0;i<=481;i++)
	{
		if(!f && a[i]!=0)
		{
			printf("%04d-",i*5);
			f=true;
		}
		if(f && a[i]==0)
		{
			printf("%04d\n",(i)*5);
			f=false;
		}

	}

	//rep(i,480) cout<<a[i]<<endl;

	
		return 0;
}


Submission Info

Submission Time
Task D - 感雨時刻の整理
User odan
Language C++ (G++ 4.6.4)
Score 100
Code Size 1432 Byte
Status AC
Exec Time 74 ms
Memory 1016 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:47:33: 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 21 ms 804 KB
00_sample_02.txt AC 22 ms 932 KB
00_sample_03.txt AC 20 ms 804 KB
cho_cho_chokudai.txt AC 74 ms 932 KB
chokudai_ga_cho.txt AC 60 ms 1016 KB
test_01.txt AC 20 ms 808 KB
test_02.txt AC 22 ms 804 KB
test_03.txt AC 20 ms 924 KB
test_04.txt AC 20 ms 800 KB
test_05.txt AC 22 ms 932 KB
test_06.txt AC 21 ms 804 KB
test_07.txt AC 22 ms 804 KB
test_08.txt AC 23 ms 808 KB
test_09.txt AC 23 ms 928 KB
test_10.txt AC 23 ms 932 KB
test_11.txt AC 23 ms 808 KB
test_12.txt AC 22 ms 804 KB
test_13.txt AC 22 ms 804 KB
test_14.txt AC 23 ms 808 KB
test_15.txt AC 23 ms 932 KB
test_16.txt AC 22 ms 804 KB
test_17.txt AC 24 ms 804 KB
test_18.txt AC 22 ms 800 KB
test_19.txt AC 34 ms 924 KB
test_20.txt AC 21 ms 800 KB
test_21.txt AC 58 ms 924 KB
test_22.txt AC 60 ms 932 KB
test_23.txt AC 57 ms 940 KB
test_24.txt AC 59 ms 936 KB
test_25.txt AC 57 ms 928 KB
test_26.txt AC 58 ms 916 KB
test_27.txt AC 54 ms 928 KB
test_28.txt AC 58 ms 936 KB
test_29.txt AC 22 ms 800 KB
test_30.txt AC 23 ms 808 KB
test_31.txt AC 28 ms 804 KB
test_32.txt AC 23 ms 932 KB
test_33.txt AC 45 ms 932 KB
test_34.txt AC 20 ms 804 KB
test_35.txt AC 22 ms 804 KB
test_36.txt AC 60 ms 932 KB
test_37.txt AC 57 ms 932 KB
test_38.txt AC 56 ms 932 KB
test_39.txt AC 56 ms 928 KB
test_40.txt AC 54 ms 928 KB
test_41.txt AC 62 ms 928 KB
test_42.txt AC 62 ms 920 KB
test_43.txt AC 63 ms 932 KB