Submission #633344


Source Code Expand

#define _CRT_SECURE_NO_WARNINGS 1
#include <iostream>
#include <vector>
#include <map>
#include <cstring>
#include <string>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <sstream>
#include <functional>
#include <set>
using namespace std;

#define rep(i,n) for(int i=0;i<(int)n;i++)
#define repp(i,k,n) for(int i=k;i<(int)n;i++)
#define rei(n) for(int i=0;i<(int)n;i++)
#define rel(n) for(int l=0;l<(int)n;l++)
#define all(s) s.begin(),s.end()
#define INT_MAX 2147483647
#define debug(x) cout<<#x<<": "<<x<<endl;
#define PI 2*acos(0,0)
#define inin(x) int x; cin>>x;
#define ll long long

typedef pair<long long, long long> pii;
typedef pair<int, pii> pipii;

int main()
{
	int tim[2500] = {};
	inin(n);
	for (int i = 0; i < n; i++)
	{
		int a, b;
		char tmp;
		scanf("%d-%d", &a, &b);
		
		a -= a % 5;
		b += (b % 5 != 0 ? (5 - b % 5) : 0);
		if ((b / 10) % 10 == 6)b += 40;
		tim[a]++; tim[b+1]--;
	}
	for (int i = 1; i < 2500; i++)
	{
		tim[i] += tim[i - 1];
	}
	int now = 0;
	int x;
	for (int i = 0; i <= 2450; i++)
	{
		stringstream ans1,ans2;
		ans1 << "0000"; ans2 << "0000";
		tim[i] = tim[i] >= 1 ? 1 : 0;
		if (now != tim[i])
		{
			if (now == 0)
			{
				now = 1;
				x = i;
			}
			else if(now==1)
			{
				now = 0;

				ans1 << x;
				ans2 << i-1;
				cout << ans1.str().substr(ans1.str().size() - 4) << "-" << ans2.str().substr(ans2.str().size() - 4) << endl;
			}

		}
	}



}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User yukitohj
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1540 Byte
Status AC
Exec Time 40 ms
Memory 936 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:25: 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 29 ms 936 KB
00_sample_02.txt AC 28 ms 928 KB
00_sample_03.txt AC 30 ms 804 KB
cho_cho_chokudai.txt AC 39 ms 848 KB
chokudai_ga_cho.txt AC 40 ms 804 KB
test_01.txt AC 33 ms 804 KB
test_02.txt AC 33 ms 800 KB
test_03.txt AC 31 ms 804 KB
test_04.txt AC 32 ms 932 KB
test_05.txt AC 34 ms 804 KB
test_06.txt AC 29 ms 928 KB
test_07.txt AC 28 ms 800 KB
test_08.txt AC 29 ms 928 KB
test_09.txt AC 28 ms 804 KB
test_10.txt AC 28 ms 928 KB
test_11.txt AC 30 ms 928 KB
test_12.txt AC 28 ms 800 KB
test_13.txt AC 28 ms 804 KB
test_14.txt AC 28 ms 804 KB
test_15.txt AC 33 ms 804 KB
test_16.txt AC 27 ms 928 KB
test_17.txt AC 28 ms 804 KB
test_18.txt AC 29 ms 804 KB
test_19.txt AC 30 ms 804 KB
test_20.txt AC 30 ms 804 KB
test_21.txt AC 37 ms 804 KB
test_22.txt AC 38 ms 928 KB
test_23.txt AC 39 ms 800 KB
test_24.txt AC 38 ms 800 KB
test_25.txt AC 39 ms 920 KB
test_26.txt AC 39 ms 928 KB
test_27.txt AC 38 ms 804 KB
test_28.txt AC 39 ms 924 KB
test_29.txt AC 28 ms 804 KB
test_30.txt AC 31 ms 800 KB
test_31.txt AC 32 ms 804 KB
test_32.txt AC 30 ms 804 KB
test_33.txt AC 37 ms 808 KB
test_34.txt AC 28 ms 928 KB
test_35.txt AC 30 ms 800 KB
test_36.txt AC 39 ms 804 KB
test_37.txt AC 39 ms 804 KB
test_38.txt AC 38 ms 812 KB
test_39.txt AC 39 ms 800 KB
test_40.txt AC 39 ms 800 KB
test_41.txt AC 38 ms 804 KB
test_42.txt AC 39 ms 924 KB
test_43.txt AC 39 ms 800 KB