Submission #3687408

---

Source Code Expand

//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <climits>
#include <set>
#include <deque>
#include <stack>
#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>
#include <queue>
#include <random>
#include <complex>
#include <regex>

using namespace std;

#define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOW_MAP(v){std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}}

int getTime(string s) {
    int hour = stoi(s.substr(0, 2));
    int minute = stoi(s.substr(2));
    int ret = hour * 60 + minute;
    return ret;
}

string getS(int time) {
    int hour = time / 60;
    int minute = time - 60 * hour;
    ostringstream sout;
    sout << setw(2) << setfill('0') << hour;
    string s = sout.str();
    ostringstream sout2;
    sout2 << setw(2) << setfill('0') << minute;
    string t = sout2.str();
    return s + t;
}

int main() {

    int N;
    cin >> N;

    vector<string> SE(N);
    for (int i = 0; i < N; i++) cin >> SE[i];

    vector<pair<int, int>> T(N);
    for (int i = 0; i < N; i++) {
        string s = SE[i].substr(0, 4);
        string t = SE[i].substr(5);
        T[i] = make_pair(getTime((s)), getTime((t)));
        if (T[i].first % 5 != 0) T[i].first -= T[i].first % 5;
        if (T[i].second % 5 != 0) T[i].second += (5 - T[i].second % 5);
    }


    sort(T.begin(), T.end());
    vector<pair<int, int>> ans;

    for (int i = 0; i < N; i++) {
        auto p = T[i];
        while (i + 1 < N && p.second >= T[i + 1].first) p.second = max(T[i + 1].second, p.second), i++;
        ans.push_back(p);
    }

    // SHOW_MAP(ans);

    for (int i = 0; i < ans.size(); i++) {
//        getS(ans[i].first) + "-" + getS(ans[i].second);
//        //cout << ans << endl;
        auto s = getS(ans[i].first);
        auto t = getS(ans[i].second);
        cout << s << "-" << t << endl;
    }

    return 0;
}

Submission Info

Judge Result