AtCoder Beginner Contest 001

Submission #1883326

Source codeソースコード

#include <iostream>
#include <string>
#include <sstream>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <queue>
#include <utility>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;

#define For(i, a, b) for(int i = (a); i < (b); i++)
#define Rep(i, n) For(i, 0, (n))
#define Rrep(i, n) for(int i = (n - 1); i >= 0; i--)
#define pb push_back

const int inf = 999999999;
const int mod = 1000000007;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

int a[1441];
vector<string> v;

int main(){
	int n; cin >> n;
	Rep(i, n){
		int x[2], y = 0;
		string s, t;
		stringstream ss; cin >> s;
		ss << s;
		while(getline(ss, t, '-')){
			x[y] = stoi(t);
			x[y] = x[y] % 100 + x[y] / 100 * 60;
			if(y){
				if(x[y] % 5 != 0){
					x[y] += 5 - (x[y] % 5);
				}
			}else{
				x[y] -= x[y] % 5;
			}
			y += 1;
		}
		a[x[0]] += 1; a[x[1]] -= 1;
	}
	bool flag = false; string x, y;
	For(i, 1, 1441) a[i] += a[i - 1];
	Rep(i, 1441){
		int k = i / 60 * 100 + i % 60;
		if(a[i] > 0){
			if(!flag){
				x = to_string(k);
				if(i < 10) x = "000" + x;
				else if(i < 60) x = "00" + x;
				else if(i < 600) x = "0" + x;
			}
			flag = true;
		}else{
			if(flag){
				y = to_string(k);
				if(i < 10) y = "000" + y;
				else if(i < 60) y = "00" + y;
				else if(i < 600) y = "0" + y;
				v.pb(x + "-" + y);
			}
			flag = false;
		}
	}
	if(flag) v.pb(x + "-" + y);
	Rep(i, v.size()){
		cout << v[i] << endl;
	}
	return 0;
}

Submission

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

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 48 ms 256 KB
chokudai_ga_cho.txt AC 47 ms 256 KB
test_01.txt AC 2 ms 256 KB
test_02.txt AC 2 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 1 ms 256 KB
test_08.txt AC 1 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 2 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 2 ms 256 KB
test_19.txt AC 2 ms 256 KB
test_20.txt AC 2 ms 256 KB
test_21.txt AC 48 ms 256 KB
test_22.txt AC 47 ms 256 KB
test_23.txt AC 48 ms 256 KB
test_24.txt AC 47 ms 256 KB
test_25.txt AC 48 ms 256 KB
test_26.txt AC 47 ms 256 KB
test_27.txt AC 47 ms 256 KB
test_28.txt AC 47 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 8 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 32 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 2 ms 256 KB
test_36.txt AC 48 ms 256 KB
test_37.txt AC 49 ms 256 KB
test_38.txt AC 48 ms 256 KB
test_39.txt AC 48 ms 256 KB
test_40.txt AC 50 ms 256 KB
test_41.txt AC 52 ms 256 KB
test_42.txt AC 48 ms 256 KB
test_43.txt AC 47 ms 256 KB