Submission #1195092


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
const int inf = 1e9;
int n, m, q, dist[100005], col[100005];
vector<int> adj[100005];
queue<int> x;

void naive (int A, int B, int C) {
	for(int i=1;i<=n;i++) dist[i] = inf;
	dist[A] = 0;
	x.push(A);
	while(!x.empty()) {
		int cur = x.front(); x.pop();
		if(dist[cur] > B) break;
		col[cur] = C;
		for(auto &nxt : adj[cur]) {
			if(dist[nxt] > dist[cur] + 1) {
				dist[nxt] = dist[cur] + 1;
				x.push(nxt);
			}
		}
	}
	while(!x.empty()) x.pop();
}

int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++) {
		int A, B;
		scanf("%d%d",&A,&B);
		adj[A].push_back(B);
		adj[B].push_back(A);
	}
	scanf("%d",&q);
	for(int i=1;i<=q;i++) {
		int A, B, C;
		scanf("%d%d%d",&A,&B,&C);
		naive(A, B, C);
	}
	for(int i=1;i<=n;i++) {
		printf("%d\n",col[i]);
	}
}

Submission Info

Submission Time
Task B - Splatter Painting
User khsoo01
Language C++14 (GCC 5.4.1)
Score 200
Code Size 846 Byte
Status TLE
Exec Time 2104 ms
Memory 8192 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^
./Main.cpp:31:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&A,&B);
                      ^
./Main.cpp:35:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&q);
                ^
./Main.cpp:38:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&A,&B,&C);
                           ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 0 / 500
Status
AC × 2
AC × 19
AC × 27
TLE × 8
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 2560 KB
00_example_02.txt AC 2 ms 2560 KB
10_01.txt AC 3 ms 2688 KB
10_02.txt AC 2 ms 2560 KB
10_03.txt AC 2 ms 2560 KB
10_04.txt AC 2 ms 2560 KB
10_05.txt AC 3 ms 2688 KB
10_06.txt AC 2 ms 2560 KB
10_07.txt AC 2 ms 2560 KB
10_08.txt AC 9 ms 2688 KB
10_09.txt AC 8 ms 2688 KB
10_10.txt AC 8 ms 2688 KB
10_11.txt AC 9 ms 2688 KB
10_12.txt AC 8 ms 2688 KB
10_13.txt AC 3 ms 2688 KB
10_14.txt AC 3 ms 2688 KB
10_15.txt AC 3 ms 2688 KB
10_16.txt AC 24 ms 2688 KB
10_17.txt AC 24 ms 2688 KB
20_01.txt TLE 2103 ms 8192 KB
20_02.txt TLE 2104 ms 6144 KB
20_03.txt TLE 2104 ms 6144 KB
20_04.txt AC 86 ms 3328 KB
20_05.txt AC 11 ms 2688 KB
20_06.txt AC 184 ms 3584 KB
20_07.txt AC 8 ms 2560 KB
20_08.txt AC 1351 ms 2688 KB
20_09.txt AC 6 ms 2688 KB
20_10.txt AC 132 ms 2560 KB
20_11.txt TLE 2057 ms 2688 KB
20_12.txt AC 382 ms 6528 KB
20_13.txt TLE 2104 ms 6272 KB
20_14.txt TLE 2104 ms 6144 KB
20_15.txt TLE 2104 ms 7288 KB
20_16.txt TLE 2104 ms 7288 KB