Submission #1161303


Source Code Expand

//#define MYDEBUG
#include <iostream>
#include <vector>
#include <chrono>
#include <random>
#include <algorithm>
#include <cstdio>

#ifdef MYDEBUG
#define debug(x) cout<<#x<<": "<<x<<endl
#else
#define debug(x)
#endif
#define LL long long
#define ULL unsigned long long
#define eps 1e-14
using std::max;
using std::min;
using std::swap;
using std::cout;
using std::cin;
using std::scanf;
using std::printf;
using std::ostream;
using std::vector;
using std::endl;
using std::string;

template<typename T>
ostream& operator<<(ostream& out, const vector<T>& v) {
	out << "[";
	size_t last = v.size() - 1;
	for (size_t i = 0; i < v.size(); ++i) {
		out << v[i];
		if (i != last)
			out << ",";
	}
	out << "]";
	return out;
}

int main() {
	int n;
	cin >> n;
	vector<int> times(n);
	int b, e;
	for (int i = 0; i < n; ++i) {
		scanf("%d-%d", &b, &e);
		//debug(b);debug(e);
		b = 5 * (b / 5);
		e = 5 * ((e + 5 - 1) / 5);
		int bmin = b % 100;
		int emin = e % 100;
		if (bmin == 60) {
			b += 40;
		}
		if (emin == 60) {
			e += 40;
		}
		int be = b * 10000 + e;
		times[i] = be;
	}
	sort(times.begin(), times.end());
	debug(endl);
	debug(times);
	vector<int> conc;
	for (int i = 0; i < n; ++i) {
		b = times[i] / 10000;
		e = times[i] % 10000;
		if (conc.size() != 0) {
			int laste = conc.at(conc.size() - 1) % 10000;
			if (e <= laste) {
				debug(times[i]);
				debug(e);
				debug(laste);
				continue;
			}
		}
		int le = e;
		for (int k = i + 1; k < n - 1; k++) {
			int nb = times[k] / 10000;
			int ne = times[k] % 10000;
			if (le >= nb) {
				le = max(le, ne);
			} else {
				break;
			}
		}
		conc.push_back(b * 10000 + le);
	}
	debug(endl);
	debug(conc);
	for (int i = 0; i < conc.size(); ++i) {
		if (i == 0 || conc[i - 1] != conc[i])
			printf("%04d-%04d\n", conc[i] / 10000, conc[i] % 10000);
	}
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User LitMc
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1907 Byte
Status AC
Exec Time 8 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:48:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d-%d", &b, &e);
                         ^

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 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
cho_cho_chokudai.txt AC 6 ms 384 KB
chokudai_ga_cho.txt AC 7 ms 384 KB
test_01.txt AC 1 ms 256 KB
test_02.txt AC 1 ms 256 KB
test_03.txt AC 1 ms 256 KB
test_04.txt AC 1 ms 256 KB
test_05.txt AC 1 ms 256 KB
test_06.txt AC 1 ms 256 KB
test_07.txt AC 1 ms 256 KB
test_08.txt AC 1 ms 256 KB
test_09.txt AC 1 ms 256 KB
test_10.txt AC 1 ms 256 KB
test_11.txt AC 1 ms 256 KB
test_12.txt AC 1 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 1 ms 256 KB
test_15.txt AC 1 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 1 ms 256 KB
test_18.txt AC 1 ms 256 KB
test_19.txt AC 1 ms 256 KB
test_20.txt AC 1 ms 256 KB
test_21.txt AC 8 ms 384 KB
test_22.txt AC 8 ms 384 KB
test_23.txt AC 8 ms 384 KB
test_24.txt AC 8 ms 384 KB
test_25.txt AC 8 ms 384 KB
test_26.txt AC 7 ms 384 KB
test_27.txt AC 7 ms 384 KB
test_28.txt AC 7 ms 384 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 2 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 5 ms 384 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 8 ms 384 KB
test_37.txt AC 7 ms 384 KB
test_38.txt AC 7 ms 384 KB
test_39.txt AC 8 ms 384 KB
test_40.txt AC 7 ms 384 KB
test_41.txt AC 6 ms 384 KB
test_42.txt AC 7 ms 384 KB
test_43.txt AC 6 ms 384 KB