Submission #1335263
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pp; typedef pair<ll,ll> pll; void read(int& x){ scanf("%d",&x); } void read(ll& x){ scanf("%lld",&x); } template<typename T,typename... Args> void read(T& a,Args&... b){ read(a); read(b...); } #define all(x) (x).begin(),(x).end() #define pb push_back #define eb emplace_back #define x first #define y second int n, m; vector<int> edge[100010]; int c[100010]; int qv[100010]; int qd[100010]; int qc[100010]; int best[100010][11]; int main() { read(n, m); for(;m--;){ int a, b; read(a, b); edge[a].pb(b); edge[b].pb(a); } int q; read(q); for(int i=1; i<=q; ++i){ read(qv[i], qd[i], qc[i]); best[qv[i]][0] = i; } for(int d=1; d<=10; ++d){ for(int i=1; i<=n; ++i){ for(int j:edge[i]){ int q=best[j][d-1]; if(qd[q] >= d){ best[i][d] = max(best[i][d], q); } } } } for(int i=1; i<=n; ++i){ printf("%d\n", qc[*max_element(best[i], best[i]+11)]); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Splatter Painting |
User | Namnamseo |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1054 Byte |
Status | WA |
Exec Time | 116 ms |
Memory | 12408 KB |
Compile Error
./Main.cpp: In function ‘void read(int&)’: ./Main.cpp:6:34: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] void read(int& x){ scanf("%d",&x); } ^ ./Main.cpp: In function ‘void read(ll&)’: ./Main.cpp:7:35: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] void read(ll& x){ scanf("%lld",&x); } ^
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 | 2 ms | 4352 KB |
00_example_02.txt | AC | 2 ms | 4352 KB |
10_01.txt | AC | 3 ms | 4352 KB |
10_02.txt | AC | 2 ms | 4352 KB |
10_03.txt | WA | 2 ms | 4352 KB |
10_04.txt | AC | 2 ms | 4352 KB |
10_05.txt | AC | 3 ms | 4352 KB |
10_06.txt | AC | 2 ms | 4352 KB |
10_07.txt | AC | 2 ms | 4480 KB |
10_08.txt | WA | 4 ms | 4480 KB |
10_09.txt | WA | 4 ms | 4480 KB |
10_10.txt | WA | 4 ms | 4480 KB |
10_11.txt | WA | 4 ms | 4480 KB |
10_12.txt | WA | 4 ms | 4480 KB |
10_13.txt | WA | 3 ms | 4480 KB |
10_14.txt | WA | 3 ms | 4480 KB |
10_15.txt | WA | 3 ms | 4480 KB |
10_16.txt | AC | 4 ms | 4480 KB |
10_17.txt | AC | 3 ms | 4480 KB |
20_01.txt | WA | 112 ms | 11648 KB |
20_02.txt | WA | 115 ms | 11776 KB |
20_03.txt | WA | 116 ms | 11648 KB |
20_04.txt | AC | 17 ms | 5376 KB |
20_05.txt | WA | 4 ms | 4352 KB |
20_06.txt | AC | 15 ms | 8704 KB |
20_07.txt | WA | 4 ms | 4352 KB |
20_08.txt | AC | 21 ms | 4480 KB |
20_09.txt | WA | 4 ms | 4480 KB |
20_10.txt | WA | 21 ms | 4352 KB |
20_11.txt | AC | 27 ms | 4480 KB |
20_12.txt | WA | 67 ms | 11648 KB |
20_13.txt | WA | 95 ms | 11776 KB |
20_14.txt | WA | 102 ms | 11648 KB |
20_15.txt | AC | 85 ms | 12152 KB |
20_16.txt | AC | 82 ms | 12408 KB |