Submission #124703
Source Code Expand
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <string>
#include <vector>
#include <deque>
#include <list>
#include <algorithm>
#include <numeric>
#include <functional>
#include <cmath>
#include <cstring>
#include <cctype>
#include <climits>
#include <sstream>
#include <set>
#include <map>
#include <queue>
#include <complex>
using namespace std;
#define REP(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(i,a,b) for(int i = a; i < (int)b; i++)
#define FOREQ(i,a,b) for(int i = a; i <= (int)b; i++)
#define FOREACH(it, c) for(__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALL(c) (c).begin(), (c).end()
#define SZ(c) (c).size()
template <class T> void pp(T v) { FOREACH(it, v) cout << *it << ' '; cout << endl ; }
template <class T> void pp(T v, int n) { REP(i,n) cout<<v[i]<< ' '; cout << endl; }
template <class T> inline void chmax(T &a, const T b) { a = max(a, b); }
template <class T> inline void chmin(T &a, const T b) { a = min(a, b); }
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef complex<double> P;
#define mp make_pair
typedef long long ll;
typedef long double ld;
typedef unsigned uint;
const int INF = 1<<28;
const double EPS = 1.0e-9;
static const int dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};
#undef MOD_CALC
#ifdef MOD_CALC
const ll MOD = 1000 * 1000 * 1000 + 7;
inline void chadd(ll &a, const ll b) { a = (a + b) % MOD;}
inline ll add(const ll a, const ll b){ return (a + b) % MOD;}
inline void chsub(ll &a, const ll b) { a = (a - b + MOD) % MOD;}
inline ll sub(const ll a, const ll b){ return (a - b + MOD) % MOD; }
inline void chmul(ll &a, const ll b) { a = (a * b) % MOD;}
inline ll mul(const ll a, const ll b){ return (a * b) % MOD;}
#endif
int main(void)
{
const int UNIT = 60/5;
vector<bool> rain(24*UNIT+1, false);
int N; scanf("%d", &N);
while(--N>=0) {
int t1, t2; scanf("%d-%d", &t1, &t2);
int idx1 = (t1/100*UNIT) + (t1%100)/5;
int idx2 = (t2/100*UNIT) + (t2%100+4)/5;
//printf("%d,%d,%d,%d\n", t1, t2,idx1, idx2);
for(int i = idx1; i < idx2; i++) rain[i] = true;
}
bool state = false;
for(int i = 0; i < 24*60/5+1; i++) {
if(state == false && rain[i] == true) {
printf("%04d-", i/UNIT*100 + i%UNIT*5);
state = true;
} else {
if(state == true && rain[i] == false) {
printf("%04d\n", i/UNIT*100 + i%UNIT*5);
state = false;
}
}
}
return 0;
}
Submission Info
Submission Time
2013-12-29 16:17:08+0900
Task
D - 感雨時刻の整理
User
kmatsunaga
Language
C++ (G++ 4.6.4)
Score
100
Code Size
2462 Byte
Status
AC
Exec Time
50 ms
Memory
936 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:56:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
./Main.cpp:58:39: 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
21 ms
928 KB
00_sample_02.txt
AC
22 ms
804 KB
00_sample_03.txt
AC
21 ms
932 KB
cho_cho_chokudai.txt
AC
50 ms
808 KB
chokudai_ga_cho.txt
AC
36 ms
808 KB
test_01.txt
AC
20 ms
800 KB
test_02.txt
AC
21 ms
800 KB
test_03.txt
AC
20 ms
804 KB
test_04.txt
AC
21 ms
800 KB
test_05.txt
AC
21 ms
796 KB
test_06.txt
AC
28 ms
792 KB
test_07.txt
AC
21 ms
936 KB
test_08.txt
AC
21 ms
740 KB
test_09.txt
AC
21 ms
680 KB
test_10.txt
AC
22 ms
804 KB
test_11.txt
AC
21 ms
800 KB
test_12.txt
AC
21 ms
928 KB
test_13.txt
AC
21 ms
932 KB
test_14.txt
AC
21 ms
676 KB
test_15.txt
AC
21 ms
808 KB
test_16.txt
AC
20 ms
804 KB
test_17.txt
AC
21 ms
932 KB
test_18.txt
AC
21 ms
808 KB
test_19.txt
AC
21 ms
816 KB
test_20.txt
AC
21 ms
808 KB
test_21.txt
AC
31 ms
808 KB
test_22.txt
AC
33 ms
804 KB
test_23.txt
AC
31 ms
804 KB
test_24.txt
AC
32 ms
680 KB
test_25.txt
AC
31 ms
676 KB
test_26.txt
AC
30 ms
800 KB
test_27.txt
AC
29 ms
808 KB
test_28.txt
AC
30 ms
804 KB
test_29.txt
AC
20 ms
804 KB
test_30.txt
AC
21 ms
704 KB
test_31.txt
AC
22 ms
936 KB
test_32.txt
AC
21 ms
808 KB
test_33.txt
AC
27 ms
808 KB
test_34.txt
AC
21 ms
936 KB
test_35.txt
AC
21 ms
800 KB
test_36.txt
AC
36 ms
808 KB
test_37.txt
AC
30 ms
812 KB
test_38.txt
AC
30 ms
808 KB
test_39.txt
AC
30 ms
804 KB
test_40.txt
AC
30 ms
812 KB
test_41.txt
AC
41 ms
740 KB
test_42.txt
AC
40 ms
792 KB
test_43.txt
AC
42 ms
796 KB