Submission #1197833


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)



#define rrep(i,a,b) for(int i=a;i>=b;i--)
int N, M, A[101010], B[101010];
int Q, V[101010], D[101010], C[101010];
int ans[101010];
//-----------------------------------------------------------------------------------
vector<int> E[101010];
void dfs(int cu, int d, int c, int pa = -1) {
	ans[cu] = c;
	if (d == 0) return;

	for (int to : E[cu]) if (to != pa) {
		dfs(to, d - 1, c, cu);
	}
}
void partial() {
	rep(i, 0, M) {
		E[A[i]].push_back(B[i]);
		E[B[i]].push_back(A[i]);
	}
	rep(i, 0, Q) dfs(V[i], D[i], C[i]);
}
//-----------------------------------------------------------------------------------
pair<int,int> dp[101010][11];
void sol() {
	rep(i, 0, Q) {
		dp[V[i]][D[i]] = { i + 1, C[i] };
	}

	rrep(d, 10, 1) {
		rep(v, 1, N + 1) dp[v][d - 1] = max(dp[v][d - 1], dp[v][d]);
		rep(i, 0, M) {
			int a = A[i], b = B[i];
			dp[a][d - 1] = max(dp[a][d - 1], dp[b][d]);
			dp[b][d - 1] = max(dp[b][d - 1], dp[a][d]);
		}
	}

	rep(i, 1, N + 1) ans[i] = dp[i][0].second;
}
//-----------------------------------------------------------------------------------
int main() {
	cin >> N >> M;
	rep(i, 0, M) scanf("%d%d", &A[i], &B[i]);
	cin >> Q;
	rep(i, 0, Q) scanf("%d%d%d", &V[i], &D[i], &C[i]);

	//partial();
	sol();
	
	rep(i, 1, N + 1) printf("%d\n", ans[i]);
}

Submission Info

Submission Time
Task B - Splatter Painting
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1410 Byte
Status AC
Exec Time 73 ms
Memory 14080 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:49:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  rep(i, 0, M) scanf("%d%d", &A[i], &B[i]);
                                          ^
./Main.cpp:51:51: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  rep(i, 0, Q) scanf("%d%d%d", &V[i], &D[i], &C[i]);
                                                   ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 500 / 500
Status
AC × 2
AC × 19
AC × 35
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
Subtask1 00_example_01.txt, 00_example_02.txt, 10_01.txt, 10_02.txt, 10_03.txt, 10_04.txt, 10_05.txt, 10_06.txt, 10_07.txt, 10_08.txt, 10_09.txt, 10_10.txt, 10_11.txt, 10_12.txt, 10_13.txt, 10_14.txt, 10_15.txt, 10_16.txt, 10_17.txt
All 00_example_01.txt, 00_example_02.txt, 10_01.txt, 10_02.txt, 10_03.txt, 10_04.txt, 10_05.txt, 10_06.txt, 10_07.txt, 10_08.txt, 10_09.txt, 10_10.txt, 10_11.txt, 10_12.txt, 10_13.txt, 10_14.txt, 10_15.txt, 10_16.txt, 10_17.txt, 20_01.txt, 20_02.txt, 20_03.txt, 20_04.txt, 20_05.txt, 20_06.txt, 20_07.txt, 20_08.txt, 20_09.txt, 20_10.txt, 20_11.txt, 20_12.txt, 20_13.txt, 20_14.txt, 20_15.txt, 20_16.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 2 ms 4352 KB
00_example_02.txt AC 2 ms 4352 KB
10_01.txt AC 2 ms 4352 KB
10_02.txt AC 2 ms 4352 KB
10_03.txt AC 2 ms 4352 KB
10_04.txt AC 2 ms 4352 KB
10_05.txt AC 2 ms 4352 KB
10_06.txt AC 2 ms 4352 KB
10_07.txt AC 2 ms 4480 KB
10_08.txt AC 3 ms 4608 KB
10_09.txt AC 3 ms 4608 KB
10_10.txt AC 3 ms 4480 KB
10_11.txt AC 3 ms 4480 KB
10_12.txt AC 3 ms 4608 KB
10_13.txt AC 3 ms 4480 KB
10_14.txt AC 3 ms 4480 KB
10_15.txt AC 3 ms 4480 KB
10_16.txt AC 3 ms 4480 KB
10_17.txt AC 3 ms 4480 KB
20_01.txt AC 73 ms 14080 KB
20_02.txt AC 73 ms 14080 KB
20_03.txt AC 73 ms 14080 KB
20_04.txt AC 15 ms 5248 KB
20_05.txt AC 3 ms 4352 KB
20_06.txt AC 17 ms 12672 KB
20_07.txt AC 4 ms 4352 KB
20_08.txt AC 18 ms 4736 KB
20_09.txt AC 3 ms 4480 KB
20_10.txt AC 17 ms 4608 KB
20_11.txt AC 22 ms 4736 KB
20_12.txt AC 45 ms 13568 KB
20_13.txt AC 63 ms 13824 KB
20_14.txt AC 66 ms 13952 KB
20_15.txt AC 65 ms 13824 KB
20_16.txt AC 66 ms 14080 KB