Submission #1001506


Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

typedef pair<int, int> pii;

int n;
int se[24 * 12 + 1];

int main(int argc, char **argv) {
	cin >> n;
	CLEAR(se);
	REP(i, n) {
		int s, e;
		char _;
		cin >> s >> _ >> e;
		s = s / 100 * 12 + s % 100 / 5;
		e = e / 100 * 12 + (e % 100 + 4) / 5;
		++se[s]; --se[e];
	}
	int v = 0;
	REP(i, 24 * 12 + 1) {
		bool a = (v == 0 && v + se[i] > 0);
		bool b = (v > 0 && v + se[i] <= 0);
		if (a || b) {
			cout << setw(4) << setfill('0') << (i / 12 * 100 + i % 12 * 5);
			if (a) cout << "-";
			else cout << endl;
		}
		v += se[i];
	}
	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User yupotown
Language C++ (G++ 4.6.4)
Score 100
Code Size 1439 Byte
Status AC
Exec Time 38 ms
Memory 932 KB

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 20 ms 928 KB
00_sample_02.txt AC 19 ms 924 KB
00_sample_03.txt AC 19 ms 800 KB
cho_cho_chokudai.txt AC 37 ms 800 KB
chokudai_ga_cho.txt AC 37 ms 804 KB
test_01.txt AC 19 ms 804 KB
test_02.txt AC 20 ms 800 KB
test_03.txt AC 20 ms 800 KB
test_04.txt AC 19 ms 800 KB
test_05.txt AC 20 ms 804 KB
test_06.txt AC 18 ms 800 KB
test_07.txt AC 20 ms 932 KB
test_08.txt AC 19 ms 804 KB
test_09.txt AC 20 ms 932 KB
test_10.txt AC 20 ms 804 KB
test_11.txt AC 20 ms 796 KB
test_12.txt AC 19 ms 928 KB
test_13.txt AC 20 ms 800 KB
test_14.txt AC 19 ms 928 KB
test_15.txt AC 20 ms 804 KB
test_16.txt AC 18 ms 800 KB
test_17.txt AC 20 ms 800 KB
test_18.txt AC 19 ms 804 KB
test_19.txt AC 20 ms 804 KB
test_20.txt AC 20 ms 800 KB
test_21.txt AC 38 ms 844 KB
test_22.txt AC 37 ms 804 KB
test_23.txt AC 38 ms 804 KB
test_24.txt AC 37 ms 844 KB
test_25.txt AC 38 ms 740 KB
test_26.txt AC 38 ms 848 KB
test_27.txt AC 35 ms 800 KB
test_28.txt AC 36 ms 800 KB
test_29.txt AC 18 ms 800 KB
test_30.txt AC 19 ms 804 KB
test_31.txt AC 20 ms 804 KB
test_32.txt AC 17 ms 800 KB
test_33.txt AC 30 ms 804 KB
test_34.txt AC 19 ms 928 KB
test_35.txt AC 18 ms 800 KB
test_36.txt AC 37 ms 928 KB
test_37.txt AC 38 ms 800 KB
test_38.txt AC 36 ms 740 KB
test_39.txt AC 37 ms 924 KB
test_40.txt AC 37 ms 804 KB
test_41.txt AC 38 ms 848 KB
test_42.txt AC 36 ms 844 KB
test_43.txt AC 37 ms 804 KB