Submission #663052
Source Code Expand
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<set>
#include<string>
#include<stack>
#include<cstdio>
#include<cmath>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef pair<int,P> P1;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define rep(i,x) for(int i=0;i<x;i++)
#define rep1(i,x) for(int i=1;i<=x;i++)
#define rrep(i,x) for(int i=x-1;i>=0;i--)
#define rrep1(i,x) for(int i=x;i>0;i--)
#define so(v) sort(v.begin(),v.end())
#define re(s) reverse(s.begin(),s.end())
#define lb(v,a) lower_bound(v.begin(),v.end(),a)
#define ub(v,a) upper_bound(v.begin(),v.end(),a)
#define mp1(a,b,c) P1(a,P(b,c))
const int INF=1000000000;
const int dir_4[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
const int dir_8[8][2]={{1,0},{1,1},{0,1},{-1,1},{-1,0},{-1,-1},{0,-1},{1,-1}};
int main(){
int n,b,c,s,t,f[1450]={0};
cin>>n;
for(int i=0;i<n;i++){
scanf("%d-%d",&b,&c);
s=b/100*60+b%100-(b%100)%5;
t=c/100*60+c%100+(5-c%5)%5;
for(int j=s;j<=t;j++) f[j]=1;
}
for(int i=0;i<1441;i+=5){
if(f[i]){
s=i/60*100+i%60;
for(int j=i;f[j];){
t=j/60*100+j%60;
j++; i++;
}
i--;
printf("%04d-%04d\n",s,t);
}
}
return 0;
}
Submission Info
Submission Time
2016-03-16 21:48:58+0900
Task
D - 感雨時刻の整理
User
lovemma
Language
C++ (G++ 4.6.4)
Score
100
Code Size
1360 Byte
Status
AC
Exec Time
83 ms
Memory
1052 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:43:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
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
28 ms
868 KB
00_sample_02.txt
AC
27 ms
952 KB
00_sample_03.txt
AC
27 ms
948 KB
cho_cho_chokudai.txt
AC
83 ms
956 KB
chokudai_ga_cho.txt
AC
53 ms
972 KB
test_01.txt
AC
27 ms
1052 KB
test_02.txt
AC
27 ms
952 KB
test_03.txt
AC
27 ms
952 KB
test_04.txt
AC
27 ms
956 KB
test_05.txt
AC
24 ms
956 KB
test_06.txt
AC
26 ms
1052 KB
test_07.txt
AC
26 ms
1052 KB
test_08.txt
AC
26 ms
1048 KB
test_09.txt
AC
27 ms
956 KB
test_10.txt
AC
27 ms
1044 KB
test_11.txt
AC
27 ms
1048 KB
test_12.txt
AC
29 ms
1044 KB
test_13.txt
AC
27 ms
916 KB
test_14.txt
AC
27 ms
932 KB
test_15.txt
AC
27 ms
1048 KB
test_16.txt
AC
26 ms
972 KB
test_17.txt
AC
27 ms
864 KB
test_18.txt
AC
27 ms
952 KB
test_19.txt
AC
27 ms
952 KB
test_20.txt
AC
27 ms
952 KB
test_21.txt
AC
38 ms
956 KB
test_22.txt
AC
44 ms
1036 KB
test_23.txt
AC
40 ms
876 KB
test_24.txt
AC
45 ms
928 KB
test_25.txt
AC
41 ms
956 KB
test_26.txt
AC
35 ms
1052 KB
test_27.txt
AC
35 ms
952 KB
test_28.txt
AC
36 ms
956 KB
test_29.txt
AC
26 ms
1052 KB
test_30.txt
AC
27 ms
1052 KB
test_31.txt
AC
28 ms
952 KB
test_32.txt
AC
27 ms
968 KB
test_33.txt
AC
32 ms
952 KB
test_34.txt
AC
26 ms
1048 KB
test_35.txt
AC
24 ms
952 KB
test_36.txt
AC
47 ms
1044 KB
test_37.txt
AC
36 ms
1048 KB
test_38.txt
AC
35 ms
952 KB
test_39.txt
AC
37 ms
948 KB
test_40.txt
AC
36 ms
952 KB
test_41.txt
AC
61 ms
956 KB
test_42.txt
AC
60 ms
1052 KB
test_43.txt
AC
60 ms
952 KB