AtCoder Beginner Contest 001

Submission #3626721

Source codeソースコード

#include <iostream>
#include <string>
#include<vector>
#include <cstdio>

using namespace std;

int A[300];
int B[300];
int N;
int s, g;
string str;

int main()
{
	for (int i = 0; i < 300; i++) {
		A[i] = 0;
		B[i] = 0;
	}

	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> str;
		s = ((str[0] - '0') * 10 + (str[1] - '0')) * 60 + ((str[2] - '0') * 10 + (str[3] - '0'));
		g = ((str[5] - '0') * 10 + (str[6] - '0')) * 60 + ((str[7] - '0') * 10 + (str[8] - '0'));

		int ss = s % 10;
		int gg = g % 10;

		if (ss <= 4) {
			s -= ss;
		}
		else {
			s -= (ss - 5);
		}
		if (gg >= 1 && gg <= 5) {
			g += (5 - gg);
		}
		else if(gg >= 6 && gg <= 9){
			g += (10 - gg);
		}
		//cout << s / 5 << endl;
		//cout << g / 5 + 1 << endl;

		A[s / 5] += 1;
		B[s / 5] += 1;
		A[g / 5 + 1] -= 1;
	}

	for (int i = 0; i < 300; i++) {
		A[i + 1] += A[i];
	}
	vector<int> v, w;
	int x = 0;
 	for (int i = 0; i < 300;) {
		if (A[i] != 0 && x % 2 == 0) {
			v.push_back(i);
			x++;
			i++;
			continue;
		}else if (A[i] == 0 && x % 2 != 0) {
			w.push_back(i - 1);
			x++;
			i++;
			continue;
		}else if ((A[i] == B[i] && A[i] != 0 && x % 2 != 0)) {
			w.push_back(i - 1);
			v.push_back(i);
			i++;
			continue;
		} else {
			i++;
		}
	}

	int a, b;
	for (int i = 0; i < v.size(); i++) {
		a = v[i] / 12;
		b = (v[i] % 12) * 5;
		printf("%02d%02d", a, b);
		cout << "-";

		a = w[i] / 12;
		b = (w[i] % 12) * 5;
		printf("%02d%02d\n", a, b);
	}

	return 0;
}

Submission

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

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

./Main.cpp: In function ‘int main()’:
./Main.cpp:51:19: warning: iteration 299u invokes undefined behavior [-Waggressive-loop-optimizations]
A[i + 1] += A[i];
^
./Main.cpp:50:20: note: containing loop
for (int i = 0; i < 300; i++) {
^

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 14 ms 256 KB
chokudai_ga_cho.txt AC 14 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 1 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 1 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 14 ms 256 KB
test_22.txt AC 14 ms 256 KB
test_23.txt AC 14 ms 256 KB
test_24.txt AC 14 ms 256 KB
test_25.txt AC 14 ms 256 KB
test_26.txt AC 14 ms 256 KB
test_27.txt AC 14 ms 256 KB
test_28.txt AC 14 ms 256 KB
test_29.txt AC 1 ms 256 KB
test_30.txt AC 1 ms 256 KB
test_31.txt AC 3 ms 256 KB
test_32.txt AC 1 ms 256 KB
test_33.txt AC 10 ms 256 KB
test_34.txt AC 1 ms 256 KB
test_35.txt AC 1 ms 256 KB
test_36.txt AC 14 ms 256 KB
test_37.txt AC 14 ms 256 KB
test_38.txt AC 14 ms 256 KB
test_39.txt AC 14 ms 256 KB
test_40.txt AC 14 ms 256 KB
test_41.txt AC 14 ms 256 KB
test_42.txt AC 14 ms 256 KB
test_43.txt AC 14 ms 256 KB