AtCoder Beginner Contest 001

Submission #1961575

Source codeソースコード

#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <sstream>
#include <functional>
#include <map>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <set>
#include <list>
#include <numeric>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
const double PI = 3.14159265358979323846;
const double EPS = 1e-12;
const ll INF = 1LL<<29;
const ll mod = 1e9+7;
#define rep(i,n) for(int (i)=0;(i)<(ll)(n);++(i))
#define repd(i,n,d) for(ll (i)=0;(i)<(ll)(n);(i)+=(d))
#define all(v) (v).begin(), (v).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset((m),(v),sizeof(m))
#define chmin(x,y) (x=min(x,y))
#define chmax(x,y) (x=max(x,y))
#define fst first
#define snd second
#define UNIQUE(x) (x).erase(unique(all(x)),(x).end())
template<class T> ostream &operator<<(ostream &os, const vector<T> &v){int n=v.size();rep(i,n)os<<v[i]<<(i==n-1?"":" ");return os;}

int t[24*3600+10];

int main(){
	int n;
	scanf("%d", &n);
	rep(i, n){
		int a, b, c, d;
		scanf("%2d%2d-%2d%2d", &a, &b, &c, &d);
		b = b/5*5;
		d = (d+4)/5*5;
		for(int i = a*60+b; i <= c*60+d; i++) t[i] = 1;
		//printf("%d %d %d %d\n", a, b, c, d);
	}
	bool r = false;
	rep(i, 24*3600+2){
		if(!r && t[i]){
			printf("%02d%02d-", i/60, i%60);
			r = true;
		} else if(r && !t[i]){
			printf("%02d%02d\n", (i-1)/60, (i-1)%60);
			r = false;
		}
	}
	return 0;
}

Submission

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

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

./Main.cpp: In function ‘int main()’:
./Main.cpp:45:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &n);
^
./Main.cpp:48:41: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%2d%2d-%2d%2d", &a, &b, &c, &d);
^

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 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 39 ms 256 KB
chokudai_ga_cho.txt AC 18 ms 256 KB
test_01.txt AC 2 ms 256 KB
test_02.txt AC 1 ms 256 KB
test_03.txt AC 2 ms 256 KB
test_04.txt AC 2 ms 256 KB
test_05.txt AC 2 ms 256 KB
test_06.txt AC 2 ms 256 KB
test_07.txt AC 2 ms 256 KB
test_08.txt AC 2 ms 256 KB
test_09.txt AC 2 ms 256 KB
test_10.txt AC 2 ms 256 KB
test_11.txt AC 2 ms 256 KB
test_12.txt AC 2 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 2 ms 256 KB
test_17.txt AC 2 ms 256 KB
test_18.txt AC 1 ms 256 KB
test_19.txt AC 2 ms 256 KB
test_20.txt AC 2 ms 256 KB
test_21.txt AC 10 ms 256 KB
test_22.txt AC 13 ms 256 KB
test_23.txt AC 10 ms 256 KB
test_24.txt AC 13 ms 256 KB
test_25.txt AC 11 ms 256 KB
test_26.txt AC 8 ms 256 KB
test_27.txt AC 8 ms 256 KB
test_28.txt AC 9 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 2 ms 256 KB
test_31.txt AC 2 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 6 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 16 ms 256 KB
test_37.txt AC 8 ms 256 KB
test_38.txt AC 8 ms 256 KB
test_39.txt AC 9 ms 256 KB
test_40.txt AC 9 ms 256 KB
test_41.txt AC 23 ms 256 KB
test_42.txt AC 23 ms 256 KB
test_43.txt AC 23 ms 256 KB