Submission #1109932
Source Code Expand
#include <algorithm> #include <array> #include <bitset> #include <cmath> #include <complex> #include <deque> #include <forward_list> #include <functional> #include <initializer_list> #include <iomanip> #include <iostream> #include <iterator> #include <limits> #include <list> #include <map> #include <memory> #include <numeric> #include <queue> #include <ratio> #include <set> #include <sstream> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <valarray> #include <vector> using namespace std; int main() { vector<pair<int, int>> times; int n; cin >> n; cin.ignore(); for(int i(0); i < n; ++i) { string s; getline(cin, s, cin.widen('-')); int sh(stoi(s.substr(0, 2))); int sm(stoi(s.substr(2, 2))); string e; getline(cin, e, cin.widen('\n')); int eh(stoi(e.substr(0, 2))); int em(stoi(e.substr(2, 2))); times.emplace_back(sh * 60 + sm, eh * 60 + em); } for_each(begin(times), end(times), [](pair<int, int>& time) { while(time.first % 5 != 0) --time.first; while(time.second % 5 != 0) ++time.second; }); sort(begin(times), end(times)); auto itr(begin(times)); while(true) { auto jtr(adjacent_find(itr, end(times), [](const pair<int, int>& time1, const pair<int, int>& time2) { return time1.second >= time2.first; })); if(jtr != end(times)) { /* auto time(make_pair(min(jtr->first, next(jtr)->first), max(jtr->second, next(jtr)->second))); itr = times.insert(times.erase(times.erase(jtr)), std::move(time)); */ auto ktr(next(jtr)); ktr->first = jtr->first; ktr->second = max(jtr->second, ktr->second); itr = times.erase(jtr); } else { break; } } for_each(begin(times), end(times), [](const pair<int, int>& time) { cout << setw(2) << setfill('0') << right << time.first / 60 << setw(2) << setfill('0') << right << time.first % 60 << "-" << setw(2) << setfill('0') << right << time.second / 60 << setw(2) << setfill('0') << right << time.second % 60 << endl; }); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - 感雨時刻の整理 |
User | sakuma_dayo |
Language | C++11 (GCC 4.8.1) |
Score | 100 |
Code Size | 2503 Byte |
Status | AC |
Exec Time | 430 ms |
Memory | 1316 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 | 19 ms | 796 KB |
00_sample_02.txt | AC | 17 ms | 804 KB |
00_sample_03.txt | AC | 17 ms | 800 KB |
cho_cho_chokudai.txt | AC | 428 ms | 1308 KB |
chokudai_ga_cho.txt | AC | 430 ms | 1144 KB |
test_01.txt | AC | 19 ms | 924 KB |
test_02.txt | AC | 18 ms | 928 KB |
test_03.txt | AC | 23 ms | 800 KB |
test_04.txt | AC | 20 ms | 848 KB |
test_05.txt | AC | 18 ms | 804 KB |
test_06.txt | AC | 19 ms | 804 KB |
test_07.txt | AC | 19 ms | 804 KB |
test_08.txt | AC | 19 ms | 804 KB |
test_09.txt | AC | 20 ms | 800 KB |
test_10.txt | AC | 21 ms | 804 KB |
test_11.txt | AC | 19 ms | 920 KB |
test_12.txt | AC | 18 ms | 800 KB |
test_13.txt | AC | 20 ms | 804 KB |
test_14.txt | AC | 18 ms | 936 KB |
test_15.txt | AC | 20 ms | 800 KB |
test_16.txt | AC | 19 ms | 924 KB |
test_17.txt | AC | 20 ms | 800 KB |
test_18.txt | AC | 20 ms | 928 KB |
test_19.txt | AC | 20 ms | 800 KB |
test_20.txt | AC | 21 ms | 928 KB |
test_21.txt | AC | 429 ms | 1316 KB |
test_22.txt | AC | 427 ms | 1192 KB |
test_23.txt | AC | 428 ms | 1136 KB |
test_24.txt | AC | 426 ms | 1312 KB |
test_25.txt | AC | 427 ms | 1144 KB |
test_26.txt | AC | 426 ms | 1304 KB |
test_27.txt | AC | 422 ms | 1316 KB |
test_28.txt | AC | 424 ms | 1316 KB |
test_29.txt | AC | 20 ms | 800 KB |
test_30.txt | AC | 19 ms | 800 KB |
test_31.txt | AC | 33 ms | 1056 KB |
test_32.txt | AC | 18 ms | 804 KB |
test_33.txt | AC | 202 ms | 1180 KB |
test_34.txt | AC | 19 ms | 932 KB |
test_35.txt | AC | 20 ms | 804 KB |
test_36.txt | AC | 427 ms | 1144 KB |
test_37.txt | AC | 428 ms | 1140 KB |
test_38.txt | AC | 426 ms | 1144 KB |
test_39.txt | AC | 427 ms | 1304 KB |
test_40.txt | AC | 427 ms | 1308 KB |
test_41.txt | AC | 426 ms | 1180 KB |
test_42.txt | AC | 428 ms | 1192 KB |
test_43.txt | AC | 426 ms | 1140 KB |