Submission #4030864

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <list>
#include <stack>
#include <set>
#include <algorithm>
#include <math.h>
#include <iomanip>

using namespace std;

#define dump(x) cout << (x) << endl;
typedef long long Int;

Int mod = 1e9+7;
Int MOD = 998244353;

int main() {
    Int n;
    cin >> n;
    vector<pair<Int, Int>> p;
    for (Int i = 0; i < n; i++)  {
        Int a, b;
        char c;
        cin >> a >> c >> b;
        Int s = a / 100 * 100 + (a % 100 / 5 * 5);
        Int e = b / 100 * 100 + (b % 100 + 4) / 5 * 5;
        if (e % 100 == 60) e += 40;
        p.emplace_back(s, e);
    }
    sort(p.begin(), p.end());
    auto itr = p.begin();
    itr++;
    while (itr != p.end()) {
        if (prev(itr)->second >= itr->first) {
            prev(itr)->second = max(prev(itr)->second, itr->second);
            itr = p.erase(itr);
        }
        else {
            itr++;
        }
    }
    for (auto itr = p.begin(); itr != p.end(); itr++) {
        cout << setw(4) << setfill('0') << itr->first << '-'
             << setw(4) << setfill('0') << itr->second << '\n';
    }
    return 0;
}  

Submission Info

Judge Result