AtCoder Beginner Contest 001

Submission #679553

Source codeソースコード

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

typedef ostringstream OSS; typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;  typedef pair<LL, LL> PLL;
typedef vector<int>    VI;   typedef vector<VI>   VVI;   typedef vector<VVI>   VVVI;
typedef vector<LL>     VLL;  typedef vector<VLL>  VVLL;  typedef vector<VVLL>  VVVLL;
typedef vector<double> VD;   typedef vector<VD>   VVD;   typedef vector<VVD>   VVVD;
typedef vector<string> VS;   typedef vector<VS>   VVS;   typedef vector<VVS>   VVVS;
typedef vector<bool>   VB;   typedef vector<VB>   VVB;   typedef vector<VVB>   VVVB;
typedef vector<PII>    VPII; typedef vector<VPII> VVPII; typedef vector<VVPII> VVVPII;
typedef vector<PLL>    VPLL; typedef vector<VPLL> VVPLL; typedef vector<VVPLL> VVVPLL;

#define fst first
#define snd second
// #define Y first
// #define X second
#define MP make_pair
#define PB push_back
#define EB emplace_back 
#define ALL(x)  (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define RANGEBOX(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
#define RANGE(x, l, r) ((l) <= (x) && (x) <= (r))
#define rep(i, N)  for (int i = 0; i < (int)(N); i++)
#define rrep(i, N) for (int i = N - 1; i >= 0; i--)
#define REP(i, init, N)  for (int i = (init); i < (int)(N); i++)
#define RREP(i, N, last) for (int i = (init - 1); i >= last; i--)
#define MAXUD(orig, target) orig = max(orig, target)
#define MINUD(orig, target) orig = min(orig, target)
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

template < typename T > inline T fromString(const string &s) { T res; ISS iss(s); iss >> res; return res; };
template < typename T > inline string toString(const T &a)   { OSS oss; oss << a; return oss.str(); };

const int    INF  = 0x3f3f3f3f;
const LL     INFL = 0x3f3f3f3f3f3f3f3fLL;
const double DINF = 0x3f3f3f3f;
const int    DX[] = {1,  0, -1, 0};
const int    DY[] = {0, -1,  0, 1};
const double EPS  = 1e-12;
// const double PI   = acos(-1.0);
// lambda: [](T1 x)->T2{return y;}
// simple lambda: [](T x){return x;}

int encode(int x) {
    int h = x / 100;
    int m = x % 100;
    int m2 = h * 60 + m;
    return m2;
}

string decode(int x) {
    int m2 = x * 5;
    int h = m2 / 60;
    int m = m2 % 60;
    string res;
    if (h < 10) res += "0";
    res += toString(h);
    if (m < 10) res += "0";
    res += toString(m);
    return res;
}

int main(void) {
    int N;
    cin >> N;
    VI ss(N), es(N);
    rep(i, N) {
        int s, e;
        scanf("%d-%d", &s, &e);
        ss[i] = encode(s) / 5;
        es[i] = (encode(e) + 4) / 5;
    }

    int M = 2400 / 5 + 2;
    VI ts(M);

    rep(i, N) {
        ts[ss[i]] += 1;
        ts[es[i]] -= 1;
    }

    partial_sum(ALL(ts), ts.begin());

    bool flg = false;
    rep(i, M) {
        if (flg && !ts[i]) {
            cout << "-" << (decode(i)) << endl;
            flg = false;
        } else if (!flg && ts[i]) {
            cout << decode(i);
            flg = true;
        }
    }
    

	return 0;
}

Submission

Task問題 D - 感雨時刻の整理
User nameユーザ名 JohnTomato
Created time投稿日時
Language言語 C++11 (GCC 4.8.1)
Status状態 AC
Score得点 100
Source lengthソースコード長 3112 Byte
File nameファイル名
Exec time実行時間 36 ms
Memory usageメモリ使用量 1060 KB

Compiler messageコンパイルメッセージ

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

Test case

Set

Set name Score得点 / Max score Cases
all 100 / 100 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

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
00_sample_01.txt AC 26 ms 736 KB
00_sample_02.txt AC 24 ms 924 KB
00_sample_03.txt AC 25 ms 924 KB
cho_cho_chokudai.txt AC 36 ms 988 KB
chokudai_ga_cho.txt AC 33 ms 1052 KB
test_01.txt AC 27 ms 924 KB
test_02.txt AC 27 ms 800 KB
test_03.txt AC 27 ms 808 KB
test_04.txt AC 27 ms 800 KB
test_05.txt AC 28 ms 736 KB
test_06.txt AC 24 ms 796 KB
test_07.txt AC 24 ms 800 KB
test_08.txt AC 24 ms 928 KB
test_09.txt AC 27 ms 928 KB
test_10.txt AC 27 ms 804 KB
test_11.txt AC 27 ms 736 KB
test_12.txt AC 24 ms 800 KB
test_13.txt AC 24 ms 800 KB
test_14.txt AC 24 ms 800 KB
test_15.txt AC 25 ms 804 KB
test_16.txt AC 25 ms 804 KB
test_17.txt AC 25 ms 804 KB
test_18.txt AC 25 ms 804 KB
test_19.txt AC 26 ms 804 KB
test_20.txt AC 25 ms 924 KB
test_21.txt AC 32 ms 932 KB
test_22.txt AC 33 ms 1056 KB
test_23.txt AC 34 ms 1056 KB
test_24.txt AC 33 ms 1052 KB
test_25.txt AC 34 ms 1060 KB
test_26.txt AC 34 ms 932 KB
test_27.txt AC 34 ms 1060 KB
test_28.txt AC 34 ms 932 KB
test_29.txt AC 23 ms 924 KB
test_30.txt AC 25 ms 808 KB
test_31.txt AC 25 ms 932 KB
test_32.txt AC 25 ms 924 KB
test_33.txt AC 32 ms 932 KB
test_34.txt AC 23 ms 680 KB
test_35.txt AC 25 ms 932 KB
test_36.txt AC 35 ms 932 KB
test_37.txt AC 35 ms 940 KB
test_38.txt AC 34 ms 932 KB
test_39.txt AC 34 ms 932 KB
test_40.txt AC 34 ms 932 KB
test_41.txt AC 35 ms 928 KB
test_42.txt AC 36 ms 936 KB
test_43.txt AC 34 ms 976 KB