Submission #438368


Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <queue>
#include <math.h>
#include <climits>
#include <cstdio>
#include <stdlib.h>
#include <time.h>
#include <fstream>
#include <sstream>

#define INF 1 << 31
#define FIN(S) cout << S << endl
#define FOR(COUNT,NUM) for(int COUNT = 0; COUNT < (int)(NUM); COUNT++)
#define FORS(IC, FC, EC) for(int IC = FC; IC < (int)(EC); IC++)
#define TEST cout << "test" << endl
#define SP " "

using namespace std;
struct time {
	int start, end;
// 演算子オーバーロードで比較関数を定義
	bool operator<(const time& another) const {
		if (start != another.start)
			return start < another.start;
		return end < another.end;
	}
};

struct time t[30000];

void pfunc(int s, int e){
	if(s < 10)cout << "0";
	if(s < 100)cout << "0";
	if(s < 1000)cout << "0";
	cout << s;
	cout << "-";
	if(e < 10)cout << "0";
	if(e < 100)cout << "0";
	if(e < 1000)cout << "0";
	cout << e;
	cout << endl;
}

int main(){
	int n;
	cin >> n;
	FOR(i, n){
		int in1, in2;
		scanf("%d-%d", &in1, &in2);
		in1 = in1 - in1%5;

		if(in2%5 != 0)
			in2 += 5 - in2%5;
		if(in2%100 == 60)
			in2 += 40;
		t[i].start = in1;
		t[i].end = in2;
///		cin >> t[i].start >> t[i].end;
	}

	sort(t, t + n);

	int s = t[0].start, e = t[0].end;
	FORS(i, 1, n){
		if(e < t[i].end){
			if(e < t[i].start){
				pfunc(s, e);
				s = t[i].start;
				e = t[i].end;
			}
			e = t[i].end;
		}
	}
	pfunc(s, e);

	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User Freedom645
Language C++ (G++ 4.6.4)
Score 100
Code Size 1520 Byte
Status AC
Exec Time 51 ms
Memory 1272 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:51:29: 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 33 ms 1016 KB
00_sample_02.txt AC 33 ms 952 KB
00_sample_03.txt AC 32 ms 1004 KB
cho_cho_chokudai.txt AC 42 ms 1260 KB
chokudai_ga_cho.txt AC 51 ms 1204 KB
test_01.txt AC 33 ms 1016 KB
test_02.txt AC 33 ms 936 KB
test_03.txt AC 33 ms 1008 KB
test_04.txt AC 32 ms 1008 KB
test_05.txt AC 33 ms 1016 KB
test_06.txt AC 32 ms 1008 KB
test_07.txt AC 32 ms 1008 KB
test_08.txt AC 32 ms 1008 KB
test_09.txt AC 34 ms 1080 KB
test_10.txt AC 32 ms 1012 KB
test_11.txt AC 33 ms 1020 KB
test_12.txt AC 32 ms 940 KB
test_13.txt AC 33 ms 1004 KB
test_14.txt AC 33 ms 1076 KB
test_15.txt AC 31 ms 1080 KB
test_16.txt AC 31 ms 1008 KB
test_17.txt AC 34 ms 956 KB
test_18.txt AC 34 ms 956 KB
test_19.txt AC 33 ms 952 KB
test_20.txt AC 33 ms 956 KB
test_21.txt AC 46 ms 1268 KB
test_22.txt AC 47 ms 1268 KB
test_23.txt AC 47 ms 1208 KB
test_24.txt AC 48 ms 1268 KB
test_25.txt AC 47 ms 1268 KB
test_26.txt AC 48 ms 1268 KB
test_27.txt AC 43 ms 1268 KB
test_28.txt AC 46 ms 1272 KB
test_29.txt AC 33 ms 1012 KB
test_30.txt AC 34 ms 1012 KB
test_31.txt AC 35 ms 1012 KB
test_32.txt AC 32 ms 1016 KB
test_33.txt AC 42 ms 1140 KB
test_34.txt AC 34 ms 1000 KB
test_35.txt AC 33 ms 1016 KB
test_36.txt AC 47 ms 1268 KB
test_37.txt AC 45 ms 1264 KB
test_38.txt AC 46 ms 1264 KB
test_39.txt AC 46 ms 1200 KB
test_40.txt AC 45 ms 1268 KB
test_41.txt AC 45 ms 1264 KB
test_42.txt AC 46 ms 1208 KB
test_43.txt AC 47 ms 1212 KB