Submission #1195352


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

struct pen
{
	int d, c, t;
};

vector<int> graph[100005];
deque<pen> queries[100005];

struct query
{
	int v, d, c;
};

query qry[100005];
int rem_dist[100005];
int color[100005];

void bfs(int qidx)
{
	int v = qry[qidx].v;
	int d = qry[qidx].d;
	int c = qry[qidx].c;

	if (rem_dist[v] >= d) return;

	queue<pair<int, int>> que;
	if (rem_dist[v] == -1) color[v] = d;
	rem_dist[v] = d;
	que.emplace(v, d);

	while (que.empty() == false)
	{
		int vv, dd;
		tie(vv, dd) = que.front();
		que.pop();

		if (dd == 0) continue;

		for (int nxt : graph[vv])
		{
			if (rem_dist[nxt] >= dd - 1) continue;
			if (rem_dist[nxt] == -1) color[nxt] = d;
			rem_dist[nxt] = dd - 1;
			que.emplace(nxt, dd - 1);
		}
	}
}

int main()
{
	int n, m;
	scanf("%d%d", &n, &m);
	for (int i = 0; i < m; i++)
	{
		int a, b;
		scanf("%d%d", &a, &b);
		graph[a].push_back(b);
		graph[b].push_back(a);
	}

	for (int i = 1; i <= n; i++) rem_dist[i] = -1;

	int q;
	scanf("%d", &q);

	for (int i = 0; i < q; i++)
	{
		int v, d, c;
		scanf("%d%d%d", &v, &d, &c);
		qry[i] = {v, d, c};

		while (queries[v].empty() == false && queries[v].back().d <= d) queries[v].pop_back();
		queries[v].push_back({ d, c, i });
	}

	for (int i = q - 1; i >= 0; i--)
	{
		bfs(i);
	}

	for (int i = 1; i <= n; i++) printf("%d\n", color[i]);
}

Submission Info

Submission Time
Task B - Splatter Painting
User unused
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1425 Byte
Status WA
Exec Time 145 ms
Memory 74560 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:55:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &m);
                       ^
./Main.cpp:59:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
                        ^
./Main.cpp:67:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &q);
                 ^
./Main.cpp:72:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &v, &d, &c);
                              ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 200 0 / 500
Status
AC × 1
WA × 1
AC × 2
WA × 17
AC × 2
WA × 33
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 39 ms 68224 KB
00_example_02.txt WA 39 ms 68224 KB
10_01.txt WA 43 ms 68224 KB
10_02.txt WA 39 ms 68224 KB
10_03.txt WA 39 ms 68224 KB
10_04.txt WA 39 ms 68224 KB
10_05.txt WA 44 ms 68224 KB
10_06.txt WA 39 ms 68224 KB
10_07.txt WA 39 ms 68224 KB
10_08.txt WA 41 ms 68352 KB
10_09.txt WA 40 ms 68352 KB
10_10.txt WA 41 ms 68352 KB
10_11.txt WA 41 ms 68352 KB
10_12.txt WA 40 ms 68352 KB
10_13.txt WA 40 ms 68352 KB
10_14.txt WA 39 ms 68352 KB
10_15.txt WA 40 ms 68352 KB
10_16.txt WA 41 ms 68352 KB
10_17.txt AC 40 ms 68352 KB
20_01.txt WA 145 ms 73216 KB
20_02.txt WA 144 ms 73216 KB
20_03.txt WA 145 ms 73216 KB
20_04.txt WA 51 ms 68992 KB
20_05.txt WA 41 ms 68352 KB
20_06.txt WA 50 ms 69248 KB
20_07.txt WA 41 ms 68352 KB
20_08.txt WA 60 ms 69120 KB
20_09.txt WA 41 ms 68352 KB
20_10.txt WA 57 ms 69120 KB
20_11.txt WA 62 ms 69504 KB
20_12.txt WA 86 ms 72064 KB
20_13.txt WA 121 ms 72960 KB
20_14.txt WA 128 ms 73088 KB
20_15.txt WA 120 ms 74560 KB
20_16.txt WA 121 ms 74560 KB