Submission #1194621
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define REPE(i, a, b) for (int i = (a); i <= int(b); ++i)
#define SZ(x) ((int)(x).size())
#define ALL(x) x.begin(), x.end()
#define PB push_back
#define EB emplace_back
using LL = long long;
using PII = pair<int, int>;
#define F first
#define S second
int n, m, q;
vector<int> g[100010];
int a[100010];
int d[100010];
void f(int s, int mx, int c) {
queue<int> q;
q.push(s);
fill(d, d + n + 1, -1);
d[s] = 0;
while (q.size()) {
int x = q.front(); q.pop();
a[x] = c;
if (d[x] >= mx) continue;
for (int y : g[x]) if (d[y] == -1) {
d[y] = d[x] + 1;
q.push(y);
}
}
}
int main() {
scanf("%d%d", &n, &m);
REP(i, m) {
int u, v;
scanf("%d%d", &u, &v);
g[u].PB(v);
g[v].PB(u);
}
scanf("%d", &q);
while (q--) {
int u, d, c;
scanf("%d%d%d", &u, &d, &c);
f(u, d, c);
}
REPE(i, 1, n) printf("%d\n", a[i]);
return 0;
}
Submission Info
Submission Time
2017-04-01 21:09:43+0900
Task
B - Splatter Painting
User
cchao
Language
C++14 (GCC 5.4.1)
Score
200
Code Size
1043 Byte
Status
TLE
Exec Time
2104 ms
Memory
8192 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:35:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &m);
^
./Main.cpp:38:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &u, &v);
^
./Main.cpp:42:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &q);
^
./Main.cpp:45:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &u, &d, &c);
^
Judge Result
Set Name
Sample
Subtask1
All
Score / Max Score
0 / 0
200 / 200
0 / 500
Status
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
2560 KB
00_example_02.txt
AC
3 ms
2560 KB
10_01.txt
AC
3 ms
2688 KB
10_02.txt
AC
3 ms
2560 KB
10_03.txt
AC
3 ms
2560 KB
10_04.txt
AC
3 ms
2560 KB
10_05.txt
AC
3 ms
2688 KB
10_06.txt
AC
3 ms
2560 KB
10_07.txt
AC
3 ms
2560 KB
10_08.txt
AC
8 ms
2688 KB
10_09.txt
AC
8 ms
2688 KB
10_10.txt
AC
8 ms
2688 KB
10_11.txt
AC
8 ms
2688 KB
10_12.txt
AC
12 ms
2688 KB
10_13.txt
AC
4 ms
2688 KB
10_14.txt
AC
3 ms
2688 KB
10_15.txt
AC
3 ms
2688 KB
10_16.txt
AC
28 ms
2688 KB
10_17.txt
AC
28 ms
2688 KB
20_01.txt
TLE
2104 ms
6144 KB
20_02.txt
TLE
2104 ms
6144 KB
20_03.txt
TLE
2104 ms
6144 KB
20_04.txt
AC
85 ms
3328 KB
20_05.txt
AC
12 ms
2560 KB
20_06.txt
AC
188 ms
3584 KB
20_07.txt
AC
9 ms
2560 KB
20_08.txt
AC
1304 ms
2688 KB
20_09.txt
AC
8 ms
2688 KB
20_10.txt
AC
135 ms
2560 KB
20_11.txt
AC
1919 ms
2688 KB
20_12.txt
AC
396 ms
6528 KB
20_13.txt
TLE
2103 ms
6272 KB
20_14.txt
TLE
2103 ms
8192 KB
20_15.txt
TLE
2104 ms
7288 KB
20_16.txt
TLE
2103 ms
7288 KB