Submission #1604360


Source Code Expand

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

#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }


int n;
int a,b;

int t[2500];

string conv(int num) {
    stringstream ss;
    ss << num;
    string res = ss.str();
    while (res.size() < 4) res = "0" + res;
    return res;
}

int gonyu(int num, bool shita) {
    while (num % 5 != 0) {
        if (shita) --num;
        else ++num;
    }
    if (num % 100 == 60) num += 40;
    return num;
}

int main()
{
    while (cin >> n) {
        memset(t, 0, sizeof(t));
        for (int i = 0; i < n; ++i) {
            scanf("%d-%d", &a, &b);
            a = gonyu(a, true);
            b = gonyu(b, false);
            t[a]++;
            t[b+1]--;
        }
        for (int i = 0; i < 2499; ++i) t[i+1] += t[i];
        bool isin = false;
        if (t[0] > 0) cout << conv(0) << "-", isin = true;
        for (int i = 1; i < 2499; ++i) {
            if (t[i] > 0 && !isin) {
                cout << conv(i) << "-";
                isin = true;
            }
            else if (t[i] == 0 && isin) {
                cout << conv(i-1) << endl;
                isin = false;
            }
        }
    }
}














Submission Info

Submission Time
Task D - 感雨時刻の整理
User drken
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2522 Byte
Status AC
Exec Time 7 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:65:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d-%d", &a, &b);
                                   ^

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 7 ms 256 KB
chokudai_ga_cho.txt AC 6 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 1 ms 256 KB
test_10.txt AC 1 ms 256 KB
test_11.txt AC 1 ms 256 KB
test_12.txt AC 1 ms 256 KB
test_13.txt AC 1 ms 256 KB
test_14.txt AC 1 ms 256 KB
test_15.txt AC 1 ms 256 KB
test_16.txt AC 1 ms 256 KB
test_17.txt AC 1 ms 256 KB
test_18.txt AC 1 ms 256 KB
test_19.txt AC 1 ms 256 KB
test_20.txt AC 1 ms 256 KB
test_21.txt AC 7 ms 256 KB
test_22.txt AC 6 ms 256 KB
test_23.txt AC 7 ms 256 KB
test_24.txt AC 7 ms 256 KB
test_25.txt AC 7 ms 256 KB
test_26.txt AC 6 ms 256 KB
test_27.txt AC 6 ms 256 KB
test_28.txt AC 7 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 2 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 5 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 7 ms 256 KB
test_37.txt AC 7 ms 256 KB
test_38.txt AC 6 ms 256 KB
test_39.txt AC 7 ms 256 KB
test_40.txt AC 7 ms 256 KB
test_41.txt AC 6 ms 256 KB
test_42.txt AC 6 ms 256 KB
test_43.txt AC 6 ms 256 KB