Submission #1247100


Source Code Expand

#include <vector>
#include <iostream>
#include <algorithm>
#pragma warning(disable : 4996)
using namespace std;
int W, H, Q, t[100009], d[100009], x[100009], dp[100009]; vector<int> r[100009]; bool vis[100009];
int main() {
	scanf("%d %d %d", &W, &H, &Q);
	for (int i = 0; i < Q; i++) scanf("%d %d %d", &t[i], &d[i], &x[i]), t[i]--, x[i]--;
	int ret = 0;
	for (int i = 0; i < 2; i++) {
		fill(r, r + 100000, vector<int>());
		fill(dp, dp + 100000, 0);
		for (int j = 0; j < Q; j++) {
			if (d[j] == i) r[t[j]].push_back(x[j]);
		}
		int z = i == 0 ? W : H;
		for (int j = 0; j < 100000; j++) {
			for (int k : r[j]) vis[k] = true, dp[k] = 999999999;
			for (int k : r[j]) {
				if (k >= 1 && !vis[k - 1]) {
					for (int l = k; l < z && vis[l]; l++) dp[l] = min(dp[l], dp[k - 1] + (l - k + 1));
				}
				if (k < z - 1 && !vis[k + 1]) {
					for (int l = k; l >= 0 && vis[l]; l--) dp[l] = min(dp[l], dp[k + 1] + (k - l + 1));
				}
			}
			for (int k : r[j]) vis[k] = false;
		}
		ret += *min_element(dp, dp + z);
	}
	printf("%d\n", ret >= 999999999 ? -1 : ret);
	return 0;
}

Submission Info

Submission Time
Task C - ビーム
User square1001
Language C++14 (GCC 5.4.1)
Score 100
Code Size 1108 Byte
Status AC
Exec Time 36 ms
Memory 6528 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:8:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &W, &H, &Q);
                               ^
./Main.cpp:9:84: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 0; i < Q; i++) scanf("%d %d %d", &t[i], &d[i], &x[i]), t[i]--, x[i]--;
                                                                                    ^

Judge Result

Set Name Sample Subtask1 Subtask2
Score / Max Score 0 / 0 30 / 30 70 / 70
Status
AC × 3
AC × 33
AC × 63
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
Subtask1 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt
Subtask2 sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask2_01.txt, subtask2_02.txt, subtask2_03.txt, subtask2_04.txt, subtask2_05.txt, subtask2_06.txt, subtask2_07.txt, subtask2_08.txt, subtask2_09.txt, subtask2_10.txt, subtask2_11.txt, subtask2_12.txt, subtask2_13.txt, subtask2_14.txt, subtask2_15.txt, subtask2_16.txt, subtask2_17.txt, subtask2_18.txt, subtask2_19.txt, subtask2_20.txt, subtask2_21.txt, subtask2_22.txt, subtask2_23.txt, subtask2_24.txt, subtask2_25.txt, subtask2_26.txt, subtask2_27.txt, subtask2_28.txt, subtask2_29.txt, subtask2_30.txt
Case Name Status Exec Time Memory
sample_01.txt AC 3 ms 2944 KB
sample_02.txt AC 3 ms 2944 KB
sample_03.txt AC 3 ms 2944 KB
subtask1_01.txt AC 3 ms 2944 KB
subtask1_02.txt AC 3 ms 2944 KB
subtask1_03.txt AC 3 ms 2944 KB
subtask1_04.txt AC 3 ms 2944 KB
subtask1_05.txt AC 3 ms 2944 KB
subtask1_06.txt AC 3 ms 2944 KB
subtask1_07.txt AC 3 ms 2944 KB
subtask1_08.txt AC 3 ms 2944 KB
subtask1_09.txt AC 3 ms 2944 KB
subtask1_10.txt AC 3 ms 2944 KB
subtask1_11.txt AC 3 ms 2944 KB
subtask1_12.txt AC 3 ms 2944 KB
subtask1_13.txt AC 3 ms 2944 KB
subtask1_14.txt AC 3 ms 2944 KB
subtask1_15.txt AC 3 ms 2944 KB
subtask1_16.txt AC 3 ms 2944 KB
subtask1_17.txt AC 3 ms 2944 KB
subtask1_18.txt AC 3 ms 2944 KB
subtask1_19.txt AC 3 ms 2944 KB
subtask1_20.txt AC 3 ms 2944 KB
subtask1_21.txt AC 3 ms 2944 KB
subtask1_22.txt AC 3 ms 2944 KB
subtask1_23.txt AC 3 ms 2944 KB
subtask1_24.txt AC 3 ms 2944 KB
subtask1_25.txt AC 3 ms 2944 KB
subtask1_26.txt AC 3 ms 2944 KB
subtask1_27.txt AC 3 ms 2944 KB
subtask1_28.txt AC 3 ms 2944 KB
subtask1_29.txt AC 3 ms 2944 KB
subtask1_30.txt AC 3 ms 2944 KB
subtask2_01.txt AC 34 ms 6144 KB
subtask2_02.txt AC 34 ms 6144 KB
subtask2_03.txt AC 32 ms 6528 KB
subtask2_04.txt AC 25 ms 4608 KB
subtask2_05.txt AC 25 ms 4608 KB
subtask2_06.txt AC 36 ms 6272 KB
subtask2_07.txt AC 34 ms 6144 KB
subtask2_08.txt AC 26 ms 4480 KB
subtask2_09.txt AC 25 ms 4480 KB
subtask2_10.txt AC 25 ms 4480 KB
subtask2_11.txt AC 25 ms 4736 KB
subtask2_12.txt AC 26 ms 4480 KB
subtask2_13.txt AC 34 ms 6144 KB
subtask2_14.txt AC 34 ms 6144 KB
subtask2_15.txt AC 4 ms 3072 KB
subtask2_16.txt AC 3 ms 2944 KB
subtask2_17.txt AC 26 ms 4480 KB
subtask2_18.txt AC 34 ms 6400 KB
subtask2_19.txt AC 35 ms 6272 KB
subtask2_20.txt AC 26 ms 4480 KB
subtask2_21.txt AC 29 ms 4992 KB
subtask2_22.txt AC 29 ms 4992 KB
subtask2_23.txt AC 29 ms 5760 KB
subtask2_24.txt AC 27 ms 4736 KB
subtask2_25.txt AC 26 ms 4480 KB
subtask2_26.txt AC 26 ms 4480 KB
subtask2_27.txt AC 25 ms 4352 KB
subtask2_28.txt AC 23 ms 4608 KB
subtask2_29.txt AC 24 ms 4480 KB
subtask2_30.txt AC 28 ms 4736 KB