Submission #649108

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> veci;
typedef vector<string> vecs;
template<class T,class U> using Hash=unordered_map<T,U>;

#define REP(i, a, n) for(ll i = a; i < n; i++)
#define RREP(i, a, n) for(ll i = n-1; i >= a; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define MD 1000000007

template<class T> T read(){T a;cin >> a;return a;}
template<class T> void read(T& a){cin >> a;}
template<class T> void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}}
template<class T> void write(T a){cout << a << endl;}
template<class T> void writes(vector<T> a, char* c = " "){cout << a[0];for(int i = 1; i < a.size(); i++)cout << c << a[i];cout << endl;;}
void write(double a){cout << fixed << setprecision(12) << a << endl;}
template<class T> void warr(T a, int n, char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;}
ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}}
ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;}
void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}}
void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}}

int main(void)
{
    int n=read<int>();
    pair<int,int> p[40000];
    rep(i,n){
        veci v;
        string s=read<string>();
        split(s,"-",v);
        int v0=v[0]/10*10+(v[0]%10)/5*5;
        int v1=v[1]/10*10+((v[1]%5!=0)?((v[1]%10)/5+1)*5:v[1]%10);
        p[i].first=v0/100*60+v0%100;
        p[i].second=v1/100*60+v1%100;
    }
    sort(p,p+n);
    int i=0;
    vector<pair<int,int>> res;
    while(i<n){
        int st=p[i].first;
        int en=p[i].second;
        i++;
        while(i<n&&en>=p[i].first){
            en=max(en,p[i].second);
            i++;
        }
        pair<int,int> t={st,en};
        res.push_back(t);
    }
    rep(i,res.size()){
        printf("%04d-",res[i].first/60*100+res[i].first%60);
        printf("%04d\n",res[i].second/60*100+res[i].second%60);
    }
	return 0;
}

Submission Info

Judge Result