Submission #1198717


Source Code Expand

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

vector<int>E[100000];
int v[100000], d[100000], c[100000];
int c1[100000], c2[100000];
int d1[100000];
int main() {
	int n, m; scanf("%d%d", &n, &m);
	rep(i, m) {
		int a, b; scanf("%d%d", &a, &b); a--; b--;
		E[a].push_back(b); E[b].push_back(a);
	}
	int q; scanf("%d", &q);
	rep(i, q) {
		scanf("%d%d%d", &v[i], &d[i], &c[i]); v[i]--;
	}
	for (int i = q - 1; i >= 0; i--) {
		queue<int>que;
		memset(d1, -1, sizeof(d1));
		d1[v[i]] = d[i];
		if (c1[v[i]] == 0)c1[v[i]] = c[i];
		if (c2[v[i]] >= d1[v[i]])continue;
		c2[v[i]] = d1[v[i]];
		if (d1[v[i]])que.push(v[i]);
		while (!que.empty()) {
			int p = que.front(); que.pop();
			for (int u : E[p]) {
				if (d1[u] != -1)continue;
				d1[u] = d1[p] - 1;
				if (c1[u] == 0)c1[u] = c[i];
				if (c2[u] >= d1[u])continue;
				c2[u] = d1[u];
				if (d1[u])que.push(u);
			}
		}
	}
	rep(i, n)printf("%d\n", c1[i]);
}

Submission Info

Submission Time
Task B - Splatter Painting
User autumn_eel
Language C++14 (GCC 5.4.1)
Score 700
Code Size 989 Byte
Status AC
Exec Time 1868 ms
Memory 9336 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int n, m; scanf("%d%d", &n, &m);
                                 ^
./Main.cpp:12:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int a, b; scanf("%d%d", &a, &b); a--; b--;
                                  ^
./Main.cpp:15:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int q; scanf("%d", &q);
                        ^
./Main.cpp:17:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &v[i], &d[i], &c[i]); v[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 3328 KB
00_example_02.txt AC 2 ms 3328 KB
10_01.txt AC 3 ms 3328 KB
10_02.txt AC 2 ms 3328 KB
10_03.txt AC 3 ms 3328 KB
10_04.txt AC 2 ms 3328 KB
10_05.txt AC 3 ms 3328 KB
10_06.txt AC 4 ms 3328 KB
10_07.txt AC 3 ms 3328 KB
10_08.txt AC 39 ms 3456 KB
10_09.txt AC 41 ms 3456 KB
10_10.txt AC 39 ms 3456 KB
10_11.txt AC 37 ms 3456 KB
10_12.txt AC 39 ms 3456 KB
10_13.txt AC 10 ms 3328 KB
10_14.txt AC 5 ms 3328 KB
10_15.txt AC 4 ms 3328 KB
10_16.txt AC 39 ms 3456 KB
10_17.txt AC 35 ms 3456 KB
20_01.txt AC 1859 ms 8064 KB
20_02.txt AC 1868 ms 8064 KB
20_03.txt AC 1860 ms 8064 KB
20_04.txt AC 21 ms 4096 KB
20_05.txt AC 101 ms 3328 KB
20_06.txt AC 95 ms 4352 KB
20_07.txt AC 117 ms 3328 KB
20_08.txt AC 1236 ms 4096 KB
20_09.txt AC 95 ms 3456 KB
20_10.txt AC 1356 ms 3968 KB
20_11.txt AC 1675 ms 4224 KB
20_12.txt AC 221 ms 7296 KB
20_13.txt AC 1373 ms 8064 KB
20_14.txt AC 1740 ms 8064 KB
20_15.txt AC 1826 ms 9080 KB
20_16.txt AC 1828 ms 9336 KB