Submission #829067

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>

using namespace std;
using ull = unsigned long long;
using ll = long long;
using lli = long long int;
using ld = long double;
using pa = pair<int,int>;
using ppa = pair<pa,int>;
#define SORT(v, n) sort(v, v+n);
#define ALL(v) v.begin(),v.end()
#define VSORT(v) sort(ALL(v))
#define GRESORT(v) sort(ALL(v),greater<ll>())
#define REVERSE(v) reverse(ALL(v))
#define overlap(v) v.erase(unique(ALL(v)),v.end())
#define debug(x) cout << #x << ": " << x << endl
#define FOR(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,n) FOR(i,0,n)
#define RFOR(i,a,b) for(int i = (b-1); i >= a; i--)
#define rrep(i,n) RFOR(i,0,n)
#define INF 999999999
#define mins(a,b) a = min(a,b)
#define maxs(a,b) a = max(a,b)

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

//8近傍
//int dy[]={0,0,1,-1,1,1,-1,-1};
//int dx[]={1,-1,0,0,1,-1,1,-1};

ll MOD = 1000000007;

void solve() {
    int n; cin >> n;
    vector<int> s(n),e(n);
    vector<int> d(2402);
    char c;
    rep(i,n){
        cin >> s[i] >> c >> e[i];
        if(s[i] % 10 >= 5) s[i] -= (s[i] % 10) - 5;
        else s[i] -= s[i] % 10;
        if(e[i] % 10 > 5) e[i] += 10 - (e[i] % 10);
        else if(e[i] % 10 != 0) e[i] += 5 - (e[i] % 10);
        if(s[i]%100 == 60){
            s[i] -= 60;
            s[i] += 100;
        }
        if(e[i]%100 == 60){
            e[i] -= 60;
            e[i] += 100;
        }
        FOR(j,s[i],e[i]+1){
            d[j] = 1;
        }
    }
    bool flag = true;
    rep(i,2402){
        if(d[i] == 1 && flag){
            cout << setw(4) << setfill('0') << i << '-';
            flag = false;
        }
        if(d[i] == 0 && !flag){
            cout << setw(4) << setfill('0') << i - 1 << endl;
            flag = true;
        }
        if(i%100 == 59) i+= 40;
    }
}

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

    solve();

    return 0;
}

Submission Info

Judge Result