Submission #673233


Source Code Expand

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

#define REP(i,n) for(ll i=0; i<(ll)(n); i++)
#define FOR(i,n,m) for (ll i=n; i<(ll)(m); i++)
#define pb push_back
#define INF 1000000007LL
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int,int> p;

int dy[4]={-1,1,0,0};
int dx[4]={0,0,1,-1};

vector<string> split(const string &str, char delim){
    vector<string> res;
    size_t current = 0, found;
    while((found = str.find_first_of(delim, current)) != string::npos){
        res.push_back(string(str, current, found - current));
        current = found + 1;
    }
    res.push_back(string(str, current, str.size() - current));
    return res;
}

int N;
int imos[3000];
int main(){
    ios::sync_with_stdio(false);
    cin >> N;
    
    REP(i,N){
        string s;
        cin >> s;
        vector<string> num=split(s,'-');
        int start=stoi(num[0]);
        start-=start%5;
        int end=stoi(num[1]);
        if(end%5!=0)end+=5-(end%5);
        if(end%100==60){
            end+=40;
        }
        imos[start]++; imos[end+1]--;
    }
    FOR(i,1,3000){
        imos[i]+=imos[i-1];
    }
    bool flag=false;
    int l=0;
    REP(i,3000){
        if(!flag && imos[i]>0){
            flag=true;
            l=i;
        }
        else if(flag && imos[i]==0){
            flag=false;
            int r=i-1;
            if(l%100>=60) l=l-(l%100)+59;
            if(r%100>=60) r=r-(r%100)+59;
            char lo[32],ro[32];
            sprintf(lo, "%04d",l);
            sprintf(ro,"%04d",r);
            cout << lo << "-" << ro << endl;
        }
    }
    
    return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User yush1ga
Language C++11 (GCC 4.8.1)
Score 100
Code Size 1680 Byte
Status AC
Exec Time 49 ms
Memory 968 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 48
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 29 ms 928 KB
00_sample_02.txt AC 27 ms 924 KB
00_sample_03.txt AC 27 ms 880 KB
cho_cho_chokudai.txt AC 47 ms 876 KB
chokudai_ga_cho.txt AC 48 ms 872 KB
test_01.txt AC 29 ms 928 KB
test_02.txt AC 25 ms 928 KB
test_03.txt AC 27 ms 928 KB
test_04.txt AC 26 ms 928 KB
test_05.txt AC 29 ms 928 KB
test_06.txt AC 28 ms 876 KB
test_07.txt AC 31 ms 968 KB
test_08.txt AC 27 ms 808 KB
test_09.txt AC 27 ms 872 KB
test_10.txt AC 27 ms 868 KB
test_11.txt AC 25 ms 924 KB
test_12.txt AC 27 ms 928 KB
test_13.txt AC 27 ms 924 KB
test_14.txt AC 27 ms 876 KB
test_15.txt AC 27 ms 876 KB
test_16.txt AC 27 ms 916 KB
test_17.txt AC 27 ms 880 KB
test_18.txt AC 26 ms 920 KB
test_19.txt AC 27 ms 928 KB
test_20.txt AC 27 ms 872 KB
test_21.txt AC 46 ms 928 KB
test_22.txt AC 47 ms 928 KB
test_23.txt AC 46 ms 868 KB
test_24.txt AC 47 ms 924 KB
test_25.txt AC 46 ms 924 KB
test_26.txt AC 46 ms 928 KB
test_27.txt AC 45 ms 924 KB
test_28.txt AC 45 ms 876 KB
test_29.txt AC 26 ms 928 KB
test_30.txt AC 26 ms 928 KB
test_31.txt AC 29 ms 928 KB
test_32.txt AC 26 ms 928 KB
test_33.txt AC 39 ms 932 KB
test_34.txt AC 26 ms 932 KB
test_35.txt AC 27 ms 876 KB
test_36.txt AC 47 ms 924 KB
test_37.txt AC 49 ms 868 KB
test_38.txt AC 47 ms 928 KB
test_39.txt AC 47 ms 880 KB
test_40.txt AC 47 ms 880 KB
test_41.txt AC 45 ms 800 KB
test_42.txt AC 47 ms 868 KB
test_43.txt AC 44 ms 924 KB