Submission #1882560


Source Code Expand

#include <bits/stdc++.h>
#define x first
#define y second
#define y1 secondy1
#define rank tipa_rank
#define pb push_back
#define mp make_pair
#define pow10 tipa_pow10
#define ll long long
#define INF 1000000000
#define EPS 1e-9
#define EPS2 1e-8
#define PI acos(-1.0)
using namespace std;
int n , m  , q;
vector<vector<int> > g(100000);
int colour[100000];
int maxDist[100000];
vector<int> V;
int dist[100000];
int d[100000] , v[100000] , c[100000];
void bfs(int u , int c , int d)
{
	queue<int> q;
	q.push(u);
	dist[u] = 0;

	if(!colour[u])
		colour[u] = c;
	while(!q.empty())
	{
		int u = q.front();
		q.pop();
		if(dist[u] == d)
			continue;
		for(int i = 0; i < g[u].size(); i++)
		{
			int v = g[u][i];
			if(dist[v] == -1)
			{
				dist[v] = dist[u] + 1;
				if(maxDist[v] < d - dist[v])
				{
					maxDist[v] = d - dist[v];
					if(!colour[v])
						colour[v] = c;
					q.push(v);
				}
			}

		}
	}
	memset(dist , -1 , sizeof dist);
}
int main() {
	memset(dist , -1 , sizeof dist);
	memset(maxDist , -1 , sizeof maxDist);
	scanf("%d %d" , &n , &m);
	for(int i = 0; i < m; i++)
	{
		int u , v;
		scanf("%d %d" , &u , &v);
		u--;v--;
		g[u].pb(v);
		g[v].pb(u);
	}
	scanf("%d" , &q);
	for(int i = 0; i < q; i++)
	{
		scanf("%d %d %d" , &v[i] , &d[i] , &c[i]);
		v[i]--;
	}
	for(int i = q - 1; i >= 0; i--)
	{
		if(maxDist[v[i]] < d[i])
		{
			bfs(v[i] , c[i] , d[i]);
		}
	}
	for(int i = 0; i < n; i++)
		printf("%d\n" , colour[i]);
}

Submission Info

Submission Time
Task B - Splatter Painting
User vjudge3
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1443 Byte
Status AC
Exec Time 907 ms
Memory 9208 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:58:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d" , &n , &m);
                          ^
./Main.cpp:62:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d" , &u , &v);
                           ^
./Main.cpp:67:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d" , &q);
                  ^
./Main.cpp:70:44: 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]);
                                            ^

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 3 ms 3328 KB
00_example_02.txt AC 3 ms 3328 KB
10_01.txt AC 3 ms 3456 KB
10_02.txt AC 3 ms 3328 KB
10_03.txt AC 4 ms 3328 KB
10_04.txt AC 3 ms 3328 KB
10_05.txt AC 3 ms 3456 KB
10_06.txt AC 2 ms 3328 KB
10_07.txt AC 4 ms 3328 KB
10_08.txt AC 19 ms 3456 KB
10_09.txt AC 19 ms 3456 KB
10_10.txt AC 19 ms 3456 KB
10_11.txt AC 19 ms 3456 KB
10_12.txt AC 19 ms 3456 KB
10_13.txt AC 8 ms 3456 KB
10_14.txt AC 5 ms 3456 KB
10_15.txt AC 4 ms 3456 KB
10_16.txt AC 10 ms 3456 KB
10_17.txt AC 11 ms 3456 KB
20_01.txt AC 907 ms 8064 KB
20_02.txt AC 892 ms 8064 KB
20_03.txt AC 901 ms 8064 KB
20_04.txt AC 17 ms 4096 KB
20_05.txt AC 39 ms 3456 KB
20_06.txt AC 99 ms 4096 KB
20_07.txt AC 59 ms 3456 KB
20_08.txt AC 132 ms 4352 KB
20_09.txt AC 53 ms 3456 KB
20_10.txt AC 351 ms 4224 KB
20_11.txt AC 178 ms 4608 KB
20_12.txt AC 185 ms 7040 KB
20_13.txt AC 642 ms 7936 KB
20_14.txt AC 714 ms 8064 KB
20_15.txt AC 396 ms 9080 KB
20_16.txt AC 396 ms 9208 KB