Submission #1714028
Source Code Expand
#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <sstream> #include <climits> #include <cmath> #include <string> #include <vector> #include <algorithm> #include <queue> #include <map> #include <functional> #include <set> #include <numeric> #include <stack> #include <utility> #include <time.h> #include <iterator> #include <bitset> #include <random> //#include "util.h" using namespace std; typedef unsigned uint; typedef long long lint; typedef unsigned long long ulint; //呪文 template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; } template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr; } cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; } template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; } cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; } template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; } //template <typename T> void print(T* v, int N) { if (N == 0) cout << "{ }"; cout << "{" << v[0]; for (int i = 1; i < N; i++) cout << ", " << v[i]; cout << "}"; } #define PI 3.14159265358979323846 #define EPS 1e-8 #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) #define all(x) (x).begin(), (x).end() typedef pair<int, int> pii; bool table[1440 + 1]; int problemD() { int N; cin >> N; string S; int s, t; for (int i = 0; i < N; i++) { cin >> S; s = stoi(S.substr(0, 4)); t = stoi(S.substr(5, 4)); s = s / 100 * 60 + s % 100 / 5 * 5; t = t / 100 * 60 + t % 100 / 5 * 5 + (t % 5 ? 5 : 0); for (int u = s; u <= t; u++) table[u] = true; } vector<pii> ans; for (int i = 0; i <= 1440; i++) { if (table[i]) { int j = i; while (j < 1440 && table[j + 1]) j++; ans.push_back(pii(i, j)); i = j; } } for (int i = 0; i < ans.size(); i++) { int bh, bm, eh, em; bh = ans[i].first / 60; bm = ans[i].first % 60; eh = ans[i].second / 60; em = ans[i].second % 60; printf("%02d%02d-%02d%02d\n", bh, bm, eh, em); } return 0; } int main() { //clock_t start, end; //start = clock(); problemD(); //end = clock(); //printf("%d msec.\n", end - start); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 感雨時刻の整理 |
User | komori3 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2811 Byte |
Status | AC |
Exec Time | 50 ms |
Memory | 256 KB |
Judge Result
Set Name | all | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
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 | 50 ms | 256 KB |
chokudai_ga_cho.txt | AC | 30 ms | 256 KB |
test_01.txt | AC | 1 ms | 256 KB |
test_02.txt | AC | 1 ms | 256 KB |
test_03.txt | AC | 2 ms | 256 KB |
test_04.txt | AC | 1 ms | 256 KB |
test_05.txt | AC | 2 ms | 256 KB |
test_06.txt | AC | 2 ms | 256 KB |
test_07.txt | AC | 2 ms | 256 KB |
test_08.txt | AC | 1 ms | 256 KB |
test_09.txt | AC | 2 ms | 256 KB |
test_10.txt | AC | 2 ms | 256 KB |
test_11.txt | AC | 2 ms | 256 KB |
test_12.txt | AC | 2 ms | 256 KB |
test_13.txt | AC | 1 ms | 256 KB |
test_14.txt | AC | 2 ms | 256 KB |
test_15.txt | AC | 2 ms | 256 KB |
test_16.txt | AC | 1 ms | 256 KB |
test_17.txt | AC | 2 ms | 256 KB |
test_18.txt | AC | 1 ms | 256 KB |
test_19.txt | AC | 2 ms | 256 KB |
test_20.txt | AC | 2 ms | 256 KB |
test_21.txt | AC | 23 ms | 256 KB |
test_22.txt | AC | 26 ms | 256 KB |
test_23.txt | AC | 23 ms | 256 KB |
test_24.txt | AC | 25 ms | 256 KB |
test_25.txt | AC | 24 ms | 256 KB |
test_26.txt | AC | 21 ms | 256 KB |
test_27.txt | AC | 21 ms | 256 KB |
test_28.txt | AC | 22 ms | 256 KB |
test_29.txt | AC | 1 ms | 256 KB |
test_30.txt | AC | 1 ms | 256 KB |
test_31.txt | AC | 4 ms | 256 KB |
test_32.txt | AC | 1 ms | 256 KB |
test_33.txt | AC | 14 ms | 256 KB |
test_34.txt | AC | 1 ms | 256 KB |
test_35.txt | AC | 2 ms | 256 KB |
test_36.txt | AC | 28 ms | 256 KB |
test_37.txt | AC | 21 ms | 256 KB |
test_38.txt | AC | 21 ms | 256 KB |
test_39.txt | AC | 22 ms | 256 KB |
test_40.txt | AC | 21 ms | 256 KB |
test_41.txt | AC | 38 ms | 256 KB |
test_42.txt | AC | 35 ms | 256 KB |
test_43.txt | AC | 35 ms | 256 KB |