Submission #2752098
Source Code Expand
#include <stdio.h> #include <iostream> #include <string> #include <vector> #include <queue> int startAdjust(int _nTotalMin) { div_t divResult = div(_nTotalMin, 5); return divResult.quot * 5; } int endAdjust(int _nTotalMin) { div_t divResult = div(_nTotalMin, 5); if (divResult.rem > 0) { div_t tm = div(_nTotalMin, 100); int nHHMM = -1; div_t d_mm = div(tm.rem, 5); if (d_mm.quot + 1 == 12) { nHHMM = (tm.quot + 1) * 100; } else { nHHMM = (divResult.quot + 1) * 5; } return nHHMM; } else { return _nTotalMin; } } class Timeset{ public: int nStartTime; int nEndTime; Timeset() : nStartTime(0), nEndTime(0) { } Timeset(int _nStartTime, int _nEndTime) : nStartTime(_nStartTime), nEndTime(_nEndTime) { } bool operator<(const Timeset& _other) const { return nStartTime > _other.nStartTime; } }; //int ABC_001_D() int main() { int N = 0; std::vector<std::string> entryVector; std::vector<Timeset> tmVector; std::priority_queue<Timeset> tmPQueue; std::vector<Timeset> tmPVector; std::cin >> N; for (int i = 0; i < N; i++) { std::string entry; std::cin >> entry; size_t pos = entry.find('-'); std::string startTm = entry.substr(0, pos); std::string endTm = entry.substr(pos+1); Timeset ts; ts.nStartTime = startAdjust(stoi(startTm)); ts.nEndTime = endAdjust(stoi(endTm)); tmVector.push_back(ts); tmPQueue.push(ts); } while (!tmPQueue.empty()) { tmPVector.push_back(tmPQueue.top()); tmPQueue.pop(); } std::vector<Timeset> resultTmsetVector; std::vector<Timeset>::iterator it = tmPVector.begin(); if (it != tmPVector.end()) { Timeset currentTs = *it; for (; it != tmPVector.end(); it++) { if (currentTs.nEndTime >= it->nStartTime) { if (currentTs.nEndTime < it->nEndTime) { currentTs.nEndTime = it->nEndTime; } } else { resultTmsetVector.push_back(currentTs); currentTs = *it; } } resultTmsetVector.push_back(currentTs); } //std::cout << "" << std::endl; //std::cout << "Result:" << std::endl; for (std::vector<Timeset>::iterator it = resultTmsetVector.begin(); it != resultTmsetVector.end(); it++) { char buffer[16]; sprintf(buffer, "%04d-%04d", it->nStartTime, it->nEndTime); std::cout << buffer << std::endl; } return 0; };
Submission Info
Submission Time | |
---|---|
Task | D - 感雨時刻の整理 |
User | Yohei |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 2454 Byte |
Status | AC |
Exec Time | 33 ms |
Memory | 1148 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 | 30 ms | 1148 KB |
chokudai_ga_cho.txt | AC | 33 ms | 1148 KB |
test_01.txt | AC | 2 ms | 256 KB |
test_02.txt | AC | 2 ms | 256 KB |
test_03.txt | AC | 2 ms | 256 KB |
test_04.txt | AC | 2 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 | 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 | 31 ms | 1148 KB |
test_22.txt | AC | 31 ms | 1148 KB |
test_23.txt | AC | 31 ms | 1148 KB |
test_24.txt | AC | 31 ms | 1148 KB |
test_25.txt | AC | 31 ms | 1148 KB |
test_26.txt | AC | 31 ms | 1148 KB |
test_27.txt | AC | 30 ms | 1148 KB |
test_28.txt | AC | 31 ms | 1148 KB |
test_29.txt | AC | 1 ms | 256 KB |
test_30.txt | AC | 1 ms | 256 KB |
test_31.txt | AC | 6 ms | 384 KB |
test_32.txt | AC | 1 ms | 256 KB |
test_33.txt | AC | 21 ms | 1020 KB |
test_34.txt | AC | 1 ms | 256 KB |
test_35.txt | AC | 1 ms | 256 KB |
test_36.txt | AC | 31 ms | 1148 KB |
test_37.txt | AC | 31 ms | 1148 KB |
test_38.txt | AC | 31 ms | 1148 KB |
test_39.txt | AC | 31 ms | 1148 KB |
test_40.txt | AC | 30 ms | 1148 KB |
test_41.txt | AC | 30 ms | 1148 KB |
test_42.txt | AC | 31 ms | 1148 KB |
test_43.txt | AC | 30 ms | 1148 KB |