Submission #1369034
Source Code Expand
/* ID: 5ak0 PROG: LANG: C++11 */ #include <bits/stdc++.h> #define fr first #define sc second #define pb push_back #define mpr make_pair using namespace std; typedef long long ll; typedef pair<int, int> pii; const int INF = 1e9 + 7, MAXN = 2010; int n, m, a, b, q, x, v, d, c[MAXN]; vector <int> g[MAXN]; void dfs(int v, int lvl){ c[v] = x; for (auto to : g[v]) if (c[to] != c[v]){ if (lvl - 1 < 0) return; dfs(to, lvl - 1); } } int main(){ #ifndef SAKO //freopen(".in", "r", stdin); //freopen(".out", "w", stdout); #endif // SAKO ios_base::sync_with_stdio(0); cin >> n >> m; for (int i = 1; i <= m; ++i){ cin >> a >> b; g[a].pb(b); g[b].pb(a); } cin >> q; for (int i = 1; i <= q; ++i){ cin >> v >> d >> x; dfs(v, d); } for (int i = 1; i <= n; ++i) cout << c[i] << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | A - AtCoder Group Contest |
User | Sakzhan |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1006 Byte |
Status | RE |
Exec Time | 110 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 00_example_01.txt, 00_example_02.txt |
All | 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_example_01.txt | WA | 1 ms | 256 KB |
00_example_02.txt | RE | 110 ms | 256 KB |
01.txt | RE | 98 ms | 256 KB |
02.txt | RE | 98 ms | 256 KB |
03.txt | RE | 97 ms | 256 KB |
04.txt | RE | 100 ms | 256 KB |
05.txt | RE | 99 ms | 256 KB |
06.txt | RE | 98 ms | 256 KB |
07.txt | RE | 97 ms | 256 KB |
08.txt | RE | 98 ms | 256 KB |
09.txt | RE | 98 ms | 256 KB |
10.txt | RE | 99 ms | 256 KB |