Submission #2102884

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1000000007;
const LL LINF=1LL<<62;

int main(){
    int N;
    cin >> N;
    int imos[1500],ch[1500];
    memset(imos,0,sizeof(imos));
    memset(ch,0,sizeof(ch));
    for(int i=0;i<N;i++){
        int t=0,x;
        string s,a,b,c,d;
        cin >> s;
        a=s.substr(0,2);
        b=s.substr(2,2);
        c=s.substr(5,2);
        d=s.substr(7,2);
        x=stoi(a);t+=x*60;
        x=stoi(b);t+=x-x%5;
        imos[t]++;t=0;
        x=stoi(c);t+=x*60;
        x=stoi(d);
        if(x%5==0) t+=x;
        else t+=(5-x%5)+x;
        imos[t]--;t=0;
    }
    int sum=0;
    for(int i=0;i<=1440;i++){
        sum+=imos[i];
        ch[i]+=sum;
    }
    bool rain=false;
    for(int i=0;i<=1440;i++){
        if(ch[i]>0&&rain==false){
            int min,sec;
            rain=true;
            min=i/60;
            sec=i-min*60;
            if(min/10==0) cout << 0;
            cout << min;
            if(sec/10==0) cout << 0;
            cout << sec <<"-";
        }
        if(ch[i]<=0&&rain==true){
            int min,sec;
            rain=false;
            min=i/60;
            sec=i-min*60;
            if(min/10==0) cout << 0;
            cout << min;
            if(sec/10==0) cout << 0;
            cout << sec << "\n";
        }
    }
    return 0;
}

Submission Info

Judge Result