Submission #1195353


Source Code Expand

#include <bits/stdc++.h>
#define LL long long
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
using namespace std;

typedef pair<int,int> ii;
typedef pair<int,ii> iii;
iii query[100100];
int n,m,x,y,d[100100],mark[100100];
vector<int> graph[100100];
bool vis[100100];
vector<int> v;


int main() {
	scanf("%d %d",&n,&m);
	for(int i=0;i<m;i++){
		scanf("%d %d",&x,&y);
		graph[x].pb(y);
		graph[y].pb(x);
	}
	int qq;
	scanf("%d",&qq);
	for(int i=0;i<qq;i++){
		scanf("%d %d %d",&query[i].fi, &query[i].sc.fi, &query[i].sc.sc);
	}
	queue<int> q;
	for(int i=qq-1;i>=0;i--){
		x = query[i].fi;
		q.push(x);
		while(v.size()) vis[v[v.size()-1]] = 0, v.pop_back();
		d[x] = 0;
		vis[x] = 1;
		while(!q.empty()){
			x = q.front();
			if(!mark[x]) mark[x] = query[i].sc.sc;
			v.pb(x);
			q.pop();
			for(int j=0;j<graph[x].size();j++){
				y = graph[x][j];
				if(!vis[y] && d[x]+1<=query[i].sc.fi){
					vis[y] = 1;
					d[y] = d[x]+1;
					q.push(y);
				}
			}
		}
	}
	for(int i=1;i<=n;i++) cout<<mark[i]<<endl;
	return 0;
}

Submission Info

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

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d",&n,&m);
                      ^
./Main.cpp:21:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&x,&y);
                       ^
./Main.cpp:26:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&qq);
                 ^
./Main.cpp:28:67: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d",&query[i].fi, &query[i].sc.fi, &query[i].sc.sc);
                                                                   ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 0 / 500
Status
AC × 2
AC × 19
AC × 28
TLE × 7
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 4224 KB
00_example_02.txt AC 3 ms 4224 KB
10_01.txt AC 3 ms 4224 KB
10_02.txt AC 3 ms 4224 KB
10_03.txt AC 3 ms 4224 KB
10_04.txt AC 3 ms 4224 KB
10_05.txt AC 3 ms 4224 KB
10_06.txt AC 3 ms 4224 KB
10_07.txt AC 5 ms 4224 KB
10_08.txt AC 12 ms 4352 KB
10_09.txt AC 11 ms 4352 KB
10_10.txt AC 11 ms 4352 KB
10_11.txt AC 11 ms 4352 KB
10_12.txt AC 11 ms 4352 KB
10_13.txt AC 6 ms 4352 KB
10_14.txt AC 6 ms 4352 KB
10_15.txt AC 6 ms 4352 KB
10_16.txt AC 41 ms 4352 KB
10_17.txt AC 41 ms 4352 KB
20_01.txt TLE 2104 ms 7552 KB
20_02.txt TLE 2103 ms 9600 KB
20_03.txt TLE 2103 ms 7552 KB
20_04.txt AC 126 ms 4992 KB
20_05.txt AC 14 ms 4224 KB
20_06.txt AC 147 ms 4608 KB
20_07.txt AC 8 ms 4224 KB
20_08.txt TLE 2103 ms 4352 KB
20_09.txt AC 6 ms 4224 KB
20_10.txt AC 162 ms 4224 KB
20_11.txt TLE 2103 ms 4608 KB
20_12.txt AC 181 ms 7552 KB
20_13.txt AC 254 ms 7680 KB
20_14.txt AC 269 ms 7808 KB
20_15.txt TLE 2104 ms 9336 KB
20_16.txt TLE 2104 ms 9336 KB