Submission #1194688
Source Code Expand
#include <iostream> #include <vector> #define REP(i,a,b) for(int i=int(a);i<int(b);i++) using namespace std; typedef long long int lli; int main () { int N, M; cin >> N >> M; const int inf = 1 << 29; if (N <= 2000) { vector<vector<int>> cost(N, vector<int>(N, inf)); REP (i, 0, N) cost[i][i] = 0; REP (i, 0, M) { int a, b; cin >> a >> b; a--; b--; cost[a][b] = cost[b][a] = 1; } REP (k, 0, N) { REP (i, 0, N) { REP (j, 0, N) { cost[i][j] = min(cost[i][j], cost[i][k] + cost[k][j]); } } } int Q; cin >> Q; vector<int> color(N, 0); REP (i, 0, Q) { int v, d, c; cin >> v >> d >> c; v--; REP (j, 0, N) { if (cost[v][j] <= d) color[j] = c; } } REP (i, 0, N) { cout << color[i] << endl; } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Splatter Painting |
User | commy |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1100 Byte |
Status | WA |
Exec Time | 2104 ms |
Memory | 18048 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 6 ms | 768 KB |
00_example_02.txt | AC | 1 ms | 256 KB |
10_01.txt | AC | 4 ms | 256 KB |
10_02.txt | AC | 4 ms | 256 KB |
10_03.txt | AC | 2 ms | 256 KB |
10_04.txt | AC | 4 ms | 256 KB |
10_05.txt | AC | 4 ms | 256 KB |
10_06.txt | AC | 1 ms | 256 KB |
10_07.txt | TLE | 2104 ms | 11904 KB |
10_08.txt | TLE | 2104 ms | 16000 KB |
10_09.txt | TLE | 2103 ms | 18048 KB |
10_10.txt | TLE | 2104 ms | 16000 KB |
10_11.txt | TLE | 2104 ms | 16000 KB |
10_12.txt | TLE | 2104 ms | 16000 KB |
10_13.txt | TLE | 2104 ms | 14208 KB |
10_14.txt | TLE | 2104 ms | 16128 KB |
10_15.txt | TLE | 2104 ms | 13568 KB |
10_16.txt | TLE | 2104 ms | 16000 KB |
10_17.txt | TLE | 2104 ms | 16000 KB |
20_01.txt | WA | 1 ms | 256 KB |
20_02.txt | WA | 1 ms | 256 KB |
20_03.txt | WA | 1 ms | 256 KB |
20_04.txt | WA | 1 ms | 256 KB |
20_05.txt | AC | 271 ms | 1536 KB |
20_06.txt | WA | 1 ms | 256 KB |
20_07.txt | AC | 359 ms | 1920 KB |
20_08.txt | AC | 247 ms | 1152 KB |
20_09.txt | AC | 957 ms | 3456 KB |
20_10.txt | AC | 156 ms | 640 KB |
20_11.txt | AC | 670 ms | 2304 KB |
20_12.txt | WA | 1 ms | 256 KB |
20_13.txt | WA | 1 ms | 256 KB |
20_14.txt | WA | 1 ms | 256 KB |
20_15.txt | WA | 1 ms | 256 KB |
20_16.txt | WA | 1 ms | 256 KB |