Submission #4312828


Source Code Expand

#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("YES")
#define p_no() p("NO")

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

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

const ll mod = 1e9 + 7;
const ll inf = 1e18;

ll to_minute(ll t){
    ll hour = t / 100;
    ll minute = t % 100;
    return 60 * hour + minute;
}

// 600 => 1000
// 665 => 1105
string minute_to_time(ll m){
    ll h = m / 60;
    m %= 60;
    stringstream ss;
    ss << std::setfill('0') << std::setw(2) << h;
    ss << std::setfill('0') << std::setw(2) << m;
    return ss.str();
}

ll imos[300] = {};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N;
    cin >> N;

    string s;
    FOR(i, 0, N){
        cin >> s;

        ll start = stoi(s.substr(0, 4));
        ll end = stoi(s.substr(5));
        // p2(start, end);

        // 分にする
        start = to_minute(start);
        end = to_minute(end);

        // 丸める
        while(start%5!=0){
            start--;
        }
        while(end%5!=0){
            end++;
        }

        start /= 5;
        end /= 5;

        imos[start]++;
        imos[end]--;
    }

    // simulation
    FOR(i, 1, 300){
        imos[i] += imos[i-1];
    }

    // 確認
    // FOR(i, 0, 300){
    //     cout << imos[i] << " ";
    // }
    // cout << endl;
    
    bool now_zero = true;
    FOR(i, 0, 300){
        ll v = imos[i];

        if(now_zero){
            if(v==0){
                continue;
            }
            else{
                // 開始時刻
                cout << minute_to_time(i*5) << "-";
                now_zero = false;
            }
        }
        else{
            if(v==0){
                // 終了時刻
                cout << minute_to_time(i*5) << endl;
                now_zero = true;
            }
            else{
                //
            }
        }
    }
    
    return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User peroon
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2465 Byte
Status AC
Exec Time 12 ms
Memory 256 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 1 ms 256 KB
00_sample_02.txt AC 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
cho_cho_chokudai.txt AC 12 ms 256 KB
chokudai_ga_cho.txt AC 11 ms 256 KB
test_01.txt AC 2 ms 256 KB
test_02.txt AC 2 ms 256 KB
test_03.txt AC 2 ms 256 KB
test_04.txt AC 2 ms 256 KB
test_05.txt AC 2 ms 256 KB
test_06.txt AC 1 ms 256 KB
test_07.txt AC 1 ms 256 KB
test_08.txt AC 1 ms 256 KB
test_09.txt AC 2 ms 256 KB
test_10.txt AC 2 ms 256 KB
test_11.txt AC 2 ms 256 KB
test_12.txt AC 2 ms 256 KB
test_13.txt AC 2 ms 256 KB
test_14.txt AC 2 ms 256 KB
test_15.txt AC 2 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 2 ms 256 KB
test_18.txt AC 1 ms 256 KB
test_19.txt AC 2 ms 256 KB
test_20.txt AC 2 ms 256 KB
test_21.txt AC 11 ms 256 KB
test_22.txt AC 11 ms 256 KB
test_23.txt AC 11 ms 256 KB
test_24.txt AC 11 ms 256 KB
test_25.txt AC 11 ms 256 KB
test_26.txt AC 11 ms 256 KB
test_27.txt AC 12 ms 256 KB
test_28.txt AC 11 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 2 ms 256 KB
test_31.txt AC 3 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 9 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 2 ms 256 KB
test_36.txt AC 11 ms 256 KB
test_37.txt AC 11 ms 256 KB
test_38.txt AC 11 ms 256 KB
test_39.txt AC 11 ms 256 KB
test_40.txt AC 11 ms 256 KB
test_41.txt AC 12 ms 256 KB
test_42.txt AC 10 ms 256 KB
test_43.txt AC 10 ms 256 KB