Submission #3979307


Source Code Expand

#include <iostream>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
#define rep(i,s,n)for(ll i=s;i<n;i++)
#define repe(i,s,n)for(ll i=s;i<=n;i++)
#define rep_r(i,s,n)for(ll i=n-1;i>=s;i--)
#define repe_r(i,s,n)for(ll i=s;i<=n;i++)
static const ll MOD = 1e9 + 7;
static const double PI = 3.141592653589793;
static const ll MAX_L = (ll)1 << 62;

ll term[2401] = {};

int main() {
	ll n; cin >> n;
	string T;
	rep(i, 0, n) {
		cin >> T;
		rep(i, 0, T.size())T[i] -= '0';
		if (5 <= T[3] && T[3] <= 9)T[3] = 5;
		else if (0 <= T[3] && T[3] <= 4)T[3] = 0;
		ll t = T[0] * 1000 + T[1] * 100 + T[2] * 10 + T[3];
		term[t]++;

		if (1 <= T[8] && T[8] <= 5)T[8] = 5;
		else if (6 <= T[8] && T[8] <= 9) {
			T[8] = 0;
			if (T[7] != 5)T[7]++;
			else {
				T[7] = 0;
				T[6]++;
			}
		}
		ll s = T[5] * 1000 + T[6] * 100 + T[7] * 10 + T[8];
		term[s + 1]--;
	}

	repe(i, 1, 2401) {
		term[i] += term[i - 1];
	}

	repe(i, 1, 2400) {
		if (term[i - 1] == 0 && term[i] > 0) {
			cout << i << "-";
		}
		else if (term[i] > 0 && term[i + 1] == 0) {
			cout << i << endl;
		}
	}

	return 0;
}

Submission Info

Submission Time
Task D - 感雨時刻の整理
User butanokakuni_c1
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1183 Byte
Status WA
Exec Time 14 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:42:25: warning: iteration 2400u invokes undefined behavior [-Waggressive-loop-optimizations]
   term[i] += term[i - 1];
                         ^
./Main.cpp:8:32: note: containing loop
 #define repe(i,s,n)for(ll i=s;i<=n;i++)
                                ^
./Main.cpp:41:2: note: in expansion of macro ‘repe’
  repe(i, 1, 2401) {
  ^

Judge Result

Set Name all
Score / Max Score 0 / 100
Status
AC × 2
WA × 46
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 1 ms 256 KB
00_sample_02.txt WA 1 ms 256 KB
00_sample_03.txt AC 1 ms 256 KB
cho_cho_chokudai.txt WA 14 ms 256 KB
chokudai_ga_cho.txt WA 14 ms 256 KB
test_01.txt WA 2 ms 256 KB
test_02.txt WA 2 ms 256 KB
test_03.txt WA 2 ms 256 KB
test_04.txt WA 2 ms 256 KB
test_05.txt WA 1 ms 256 KB
test_06.txt WA 1 ms 256 KB
test_07.txt WA 1 ms 256 KB
test_08.txt WA 1 ms 256 KB
test_09.txt WA 2 ms 256 KB
test_10.txt WA 2 ms 256 KB
test_11.txt WA 2 ms 256 KB
test_12.txt WA 1 ms 256 KB
test_13.txt WA 1 ms 256 KB
test_14.txt WA 1 ms 256 KB
test_15.txt WA 2 ms 256 KB
test_16.txt WA 1 ms 256 KB
test_17.txt WA 2 ms 256 KB
test_18.txt WA 1 ms 256 KB
test_19.txt WA 2 ms 256 KB
test_20.txt WA 2 ms 256 KB
test_21.txt WA 14 ms 256 KB
test_22.txt WA 14 ms 256 KB
test_23.txt WA 14 ms 256 KB
test_24.txt WA 14 ms 256 KB
test_25.txt WA 14 ms 256 KB
test_26.txt WA 14 ms 256 KB
test_27.txt WA 14 ms 256 KB
test_28.txt WA 14 ms 256 KB
test_29.txt WA 1 ms 256 KB
test_30.txt WA 1 ms 256 KB
test_31.txt WA 3 ms 256 KB
test_32.txt WA 1 ms 256 KB
test_33.txt WA 10 ms 256 KB
test_34.txt WA 1 ms 256 KB
test_35.txt WA 1 ms 256 KB
test_36.txt WA 14 ms 256 KB
test_37.txt WA 14 ms 256 KB
test_38.txt WA 14 ms 256 KB
test_39.txt WA 14 ms 256 KB
test_40.txt WA 14 ms 256 KB
test_41.txt WA 14 ms 256 KB
test_42.txt WA 14 ms 256 KB
test_43.txt WA 14 ms 256 KB