Submission #1195011
Source Code Expand
#include <iostream> #include <algorithm> #include <iomanip> #include <string> #include <functional> #include <utility> #include <queue> #include <vector> #include <string> #include <stack> #define rep(i,n) for(ll i=0;i<n;i++) using namespace std; typedef long long int ll; const ll MOD = 1000000007; typedef pair<ll,ll> P; int N,M; vector<int> vec[100100]; int Q; queue<int> que; int ans[100100]; void bfs(int v ,int d, int c){ que.push(v); ans[v] = c; while(!que.empty() && d>0){ int l=que.size(); d--; rep(i,l){ int tmp = que.front(); que.pop(); int l2 = vec[tmp].size(); rep(j,l2){ int pos = vec[tmp][j]; if(ans[pos] == c) continue; ans[pos] = c; que.push(pos); } } } while(!que.empty()){ que.pop(); } } int main(){ cin >> N >> M; rep(i,M){ int a,b; cin >> a >> b; vec[a].push_back(b); vec[b].push_back(a); } cin >> Q; rep(i,Q){ int v,d,c; cin >> v >> d >> c; bfs(v,d,c); } rep(i,N){ cout << ans[i+1] << endl; } }
Submission Info
Submission Time | |
---|---|
Task | B - Splatter Painting |
User | gamelove765 |
Language | C++11 (GCC 4.8.1) |
Score | 0 |
Code Size | 1063 Byte |
Status | WA |
Exec Time | 2104 ms |
Memory | 7808 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 | 3 ms | 2688 KB |
00_example_02.txt | AC | 3 ms | 2560 KB |
10_01.txt | AC | 3 ms | 2560 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 | 2560 KB |
10_06.txt | AC | 3 ms | 2560 KB |
10_07.txt | AC | 5 ms | 2560 KB |
10_08.txt | WA | 11 ms | 2688 KB |
10_09.txt | WA | 10 ms | 2688 KB |
10_10.txt | WA | 10 ms | 2688 KB |
10_11.txt | WA | 11 ms | 2688 KB |
10_12.txt | WA | 11 ms | 2688 KB |
10_13.txt | WA | 7 ms | 2688 KB |
10_14.txt | WA | 7 ms | 2688 KB |
10_15.txt | AC | 7 ms | 2688 KB |
10_16.txt | AC | 27 ms | 2688 KB |
10_17.txt | AC | 27 ms | 2688 KB |
20_01.txt | WA | 1442 ms | 6144 KB |
20_02.txt | WA | 1347 ms | 7808 KB |
20_03.txt | WA | 1482 ms | 6144 KB |
20_04.txt | AC | 107 ms | 3328 KB |
20_05.txt | AC | 13 ms | 2560 KB |
20_06.txt | AC | 150 ms | 3200 KB |
20_07.txt | AC | 10 ms | 2560 KB |
20_08.txt | AC | 1683 ms | 2688 KB |
20_09.txt | AC | 9 ms | 2560 KB |
20_10.txt | AC | 148 ms | 2560 KB |
20_11.txt | TLE | 2103 ms | 2688 KB |
20_12.txt | WA | 221 ms | 6144 KB |
20_13.txt | WA | 309 ms | 6272 KB |
20_14.txt | WA | 327 ms | 6144 KB |
20_15.txt | TLE | 2104 ms | 6904 KB |
20_16.txt | TLE | 2104 ms | 6904 KB |