Submission #1195539
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,l,r) for(int i = (int) (l);i < (int) (r);i++)
#define ALL(x) x.begin(),x.end()
template<typename T> bool chmax(T& a,const T& b){ return a < b ? (a = b,true) : false; }
template<typename T> bool chmin(T& a,const T& b){ return b < a ? (a = b,true) : false; }
typedef long long ll;
int N,M,Q;
vector<int> edge [100001];
pair<int,int> node [100001] [11];
int main()
{
scanf("%d%d",&N,&M);
FOR(i,0,M){
int u,v;
scanf("%d%d",&u,&v);
edge [u].push_back(v);
edge [v].push_back(u);
}
fill(node [0],node [N + 1],make_pair(0,0));
scanf("%d",&Q);
FOR(i,0,Q){
int v,d,c;
scanf("%d%d%d",&v,&d,&c);
chmax(node [v] [d],make_pair(i + 1,c));
}
for(int i = 10;i > 0;i--){
FOR(j,1,N + 1){
for(const auto& it : edge [j]){
chmax(node [it] [i - 1],node [j] [i]);
}
}
}
FOR(i,1,N + 1){
int color = 0,mx = 0;
FOR(j,0,11){
if(mx < node [i] [j].first){
mx = node [i] [j].first;
color = node [i] [j].second;
}
}
printf("%d\n",color);
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Splatter Painting |
User |
gigime |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
1099 Byte |
Status |
AC |
Exec Time |
102 ms |
Memory |
15096 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:16:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&N,&M);
^
./Main.cpp:19:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&u,&v);
^
./Main.cpp:24:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&Q);
^
./Main.cpp:27:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&v,&d,&c);
^
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
500 / 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 |
2944 KB |
00_example_02.txt |
AC |
2 ms |
2944 KB |
10_01.txt |
AC |
2 ms |
3072 KB |
10_02.txt |
AC |
2 ms |
3072 KB |
10_03.txt |
AC |
2 ms |
2944 KB |
10_04.txt |
AC |
2 ms |
3072 KB |
10_05.txt |
AC |
2 ms |
3072 KB |
10_06.txt |
AC |
2 ms |
2944 KB |
10_07.txt |
AC |
2 ms |
3200 KB |
10_08.txt |
AC |
4 ms |
3328 KB |
10_09.txt |
AC |
4 ms |
3200 KB |
10_10.txt |
AC |
4 ms |
3200 KB |
10_11.txt |
AC |
4 ms |
3200 KB |
10_12.txt |
AC |
4 ms |
3200 KB |
10_13.txt |
AC |
3 ms |
3200 KB |
10_14.txt |
AC |
3 ms |
3200 KB |
10_15.txt |
AC |
3 ms |
3200 KB |
10_16.txt |
AC |
3 ms |
3200 KB |
10_17.txt |
AC |
3 ms |
3200 KB |
20_01.txt |
AC |
102 ms |
14336 KB |
20_02.txt |
AC |
100 ms |
14336 KB |
20_03.txt |
AC |
100 ms |
14336 KB |
20_04.txt |
AC |
18 ms |
4224 KB |
20_05.txt |
AC |
3 ms |
3072 KB |
20_06.txt |
AC |
16 ms |
11392 KB |
20_07.txt |
AC |
4 ms |
3072 KB |
20_08.txt |
AC |
18 ms |
3200 KB |
20_09.txt |
AC |
4 ms |
3072 KB |
20_10.txt |
AC |
17 ms |
3072 KB |
20_11.txt |
AC |
22 ms |
3200 KB |
20_12.txt |
AC |
62 ms |
14336 KB |
20_13.txt |
AC |
85 ms |
14592 KB |
20_14.txt |
AC |
89 ms |
14464 KB |
20_15.txt |
AC |
68 ms |
14840 KB |
20_16.txt |
AC |
69 ms |
15096 KB |