Submission #1813323
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define inf 1e9
#define linf 1e18
#define mod 1e9+7
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define each(itr,v) for(auto itr:v)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fi first
#define se second
#define ln << "\n"
#define show(x) cout << #x << " = " << x ln
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define dbg(x) cout<<#x"="<<x ln
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> PP;
struct edge {
int to,cost;
edge(int t, int c):to(t),cost(c) {}
};
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int ddx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[] = {1, 1, 0, -1, -1, -1, 0, 1};
//--------------------------------------------------
int main() {
int n;
int imo[1450] = {0};
cin >> n;
rep(i,n) {
int f, t;
scanf("%d-%d", &f, &t);
f = f/100*60 + f%100;
t = t/100*60 + t%100;
f -= f%5;
if (t%5!=0) t += 5 - t%5;
imo[f]++;
imo[t+1]--;
}
bool r = false;
cout << setfill('0');
rep(i,1445) {
imo[i+1] += imo[i];
if (!r && imo[i]>0) {
printf("%02d%02d-", i/60, i%60);
r = true;
}
if (r && imo[i]==0) {
printf("%02d%02d\n", (i-1)/60, (i-1)%60);
r = false;
}
}
}
Submission Info
Submission Time
2017-11-28 09:01:49+0900
Task
D - 感雨時刻の整理
User
creep04
Language
C++14 (GCC 5.4.1)
Score
100
Code Size
1362 Byte
Status
AC
Exec Time
6 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:42:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d-%d", &f, &t);
^
Judge Result
Set Name
all
Score / Max Score
100 / 100
Status
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
6 ms
256 KB
chokudai_ga_cho.txt
AC
6 ms
256 KB
test_01.txt
AC
1 ms
256 KB
test_02.txt
AC
1 ms
256 KB
test_03.txt
AC
1 ms
256 KB
test_04.txt
AC
2 ms
256 KB
test_05.txt
AC
1 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
2 ms
256 KB
test_15.txt
AC
2 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
6 ms
256 KB
test_22.txt
AC
6 ms
256 KB
test_23.txt
AC
6 ms
256 KB
test_24.txt
AC
6 ms
256 KB
test_25.txt
AC
6 ms
256 KB
test_26.txt
AC
6 ms
256 KB
test_27.txt
AC
6 ms
256 KB
test_28.txt
AC
6 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
4 ms
256 KB
test_34.txt
AC
1 ms
256 KB
test_35.txt
AC
1 ms
256 KB
test_36.txt
AC
6 ms
256 KB
test_37.txt
AC
6 ms
256 KB
test_38.txt
AC
6 ms
256 KB
test_39.txt
AC
6 ms
256 KB
test_40.txt
AC
6 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