Contest Duration: - (local time) (120 minutes) Back to Home

Submission #679552

Source Code Expand

Copy
```#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;
}

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

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 Info

Submission Time 2016-03-29 08:02:28+0900 D - 感雨時刻の整理 snakazawa C++11 (GCC 4.8.1) 0 2992 Byte WA 35 ms 1060 KB

Compile Error

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

Judge Result

Set Name all
Score / Max Score 0 / 100
Status
 AC × 2 WA × 46
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 23 ms 676 KB
00_sample_02.txt WA 25 ms 772 KB
00_sample_03.txt AC 22 ms 800 KB
cho_cho_chokudai.txt WA 34 ms 932 KB
chokudai_ga_cho.txt WA 33 ms 928 KB
test_01.txt WA 25 ms 928 KB
test_02.txt WA 25 ms 932 KB
test_03.txt WA 23 ms 804 KB
test_04.txt WA 25 ms 680 KB
test_05.txt WA 26 ms 804 KB
test_06.txt WA 23 ms 680 KB
test_07.txt WA 25 ms 808 KB
test_08.txt WA 25 ms 676 KB
test_09.txt WA 25 ms 796 KB
test_10.txt WA 25 ms 924 KB
test_11.txt WA 25 ms 808 KB
test_12.txt WA 25 ms 804 KB
test_13.txt WA 25 ms 676 KB
test_14.txt WA 24 ms 808 KB
test_15.txt WA 25 ms 804 KB
test_16.txt WA 25 ms 680 KB
test_17.txt WA 25 ms 932 KB
test_18.txt WA 25 ms 800 KB
test_19.txt WA 25 ms 804 KB
test_20.txt WA 25 ms 932 KB
test_21.txt WA 34 ms 936 KB
test_22.txt WA 31 ms 928 KB
test_23.txt WA 34 ms 932 KB
test_24.txt WA 33 ms 928 KB
test_25.txt WA 32 ms 932 KB
test_26.txt WA 32 ms 1060 KB
test_27.txt WA 31 ms 1060 KB
test_28.txt WA 32 ms 932 KB
test_29.txt WA 23 ms 800 KB
test_30.txt WA 24 ms 680 KB
test_31.txt WA 26 ms 804 KB
test_32.txt WA 24 ms 796 KB
test_33.txt WA 29 ms 1056 KB
test_34.txt WA 23 ms 796 KB
test_35.txt WA 25 ms 804 KB
test_36.txt WA 33 ms 932 KB
test_37.txt WA 33 ms 1060 KB
test_38.txt WA 35 ms 1056 KB
test_39.txt WA 34 ms 932 KB
test_40.txt WA 33 ms 932 KB
test_41.txt WA 32 ms 1056 KB
test_42.txt WA 34 ms 976 KB
test_43.txt WA 33 ms 936 KB