Submission #2106250
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}
int nextInt() { int x; scanf("%d", &x); return x;}
const int MAX_N = 112345;
const int MAX_Q = 112345;
vector<int> g[MAX_N];
int color[MAX_Q];
int t[MAX_N][11];
int main2() {
REP(i, MAX_N) g[i].clear();
CLR(t, -1);
int N = nextInt();
int M = nextInt();
REP(i, M) {
int a = nextInt() - 1;
int b = nextInt() - 1;
g[a].push_back(b);
g[b].push_back(a);
}
int Q = nextInt();
REP(i, Q) {
int v = nextInt() - 1;
int d = nextInt();
int c = nextInt();
color[i] = c;
t[v][d] = i;
}
for (int d = 10; d > 0; d--) {
REP(i, N) {
chmax(t[i][d-1], t[i][d]);
for (int j : g[i]) {
chmax(t[j][d-1], t[i][d]);
}
}
}
REP(i, N) {
printf("%d\n", t[i][0] == -1 ? 0 : color[t[i][0]]);
}
return 0;
}
int main() {
for (;!cin.eof();cin>>ws)
main2();
return 0;
}
Submission Info
Submission Time
2018-02-18 05:52:39+0900
Task
B - Splatter Painting
User
hs484
Language
C++14 (GCC 5.4.1)
Score
700
Code Size
1371 Byte
Status
AC
Exec Time
110 ms
Memory
12024 KB
Compile Error
./Main.cpp: In function ‘int nextInt()’:
./Main.cpp:14:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
int nextInt() { int x; scanf("%d", &x); return x;}
^
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
4 ms
8192 KB
00_example_02.txt
AC
4 ms
8192 KB
10_01.txt
AC
4 ms
8192 KB
10_02.txt
AC
4 ms
8192 KB
10_03.txt
AC
4 ms
8192 KB
10_04.txt
AC
4 ms
8192 KB
10_05.txt
AC
4 ms
8192 KB
10_06.txt
AC
4 ms
8192 KB
10_07.txt
AC
4 ms
8192 KB
10_08.txt
AC
6 ms
8192 KB
10_09.txt
AC
6 ms
8192 KB
10_10.txt
AC
6 ms
8192 KB
10_11.txt
AC
6 ms
8192 KB
10_12.txt
AC
6 ms
8192 KB
10_13.txt
AC
5 ms
8192 KB
10_14.txt
AC
5 ms
8192 KB
10_15.txt
AC
5 ms
8192 KB
10_16.txt
AC
7 ms
8192 KB
10_17.txt
AC
5 ms
8192 KB
20_01.txt
AC
110 ms
11392 KB
20_02.txt
AC
106 ms
11264 KB
20_03.txt
AC
108 ms
11264 KB
20_04.txt
AC
18 ms
8832 KB
20_05.txt
AC
6 ms
8192 KB
20_06.txt
AC
16 ms
8320 KB
20_07.txt
AC
6 ms
8192 KB
20_08.txt
AC
23 ms
8320 KB
20_09.txt
AC
6 ms
8192 KB
20_10.txt
AC
23 ms
8192 KB
20_11.txt
AC
29 ms
8320 KB
20_12.txt
AC
68 ms
11264 KB
20_13.txt
AC
94 ms
11520 KB
20_14.txt
AC
98 ms
11392 KB
20_15.txt
AC
77 ms
11896 KB
20_16.txt
AC
79 ms
12024 KB