Submission #1194672
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define pi M_PI
#define R cin>>
#define Z class
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;i--)
#define REP(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
template<Z A>void pr(A a){cout<<a;ln;}
template<Z A,Z B>void pr(A a,B b){cout<<a<<' ';pr(b);}
template<Z A,Z B,Z C>void pr(A a,B b,C c){cout<<a<<' ';pr(b,c);}
template<Z A,Z B,Z C,Z D>void pr(A a,B b,C c,D d){cout<<a<<' ';pr(b,c,d);}
template<Z A>void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<<a[i];}ln;}
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}
const ll MAX=1000000007,MAXL=1LL<<61,dx[4]={-1,0,1,0},dy[4]={0,1,0,-1};
typedef pair<int,int> P;
void Main() {
ll n,m,q;
cin >> n >> m;
vector<int> v[n];
rep(i,m) {
int x,y;
cin >> x >> y;
x--,y--;
v[x].pb(y);
v[y].pb(x);
}
R q;
int c[n];
mem(c);
while(q--) {
int d[n];
fill(d,d+n,MAX);
int s,t,r;
cin >> s >> t >> r;
s--;
d[s]=0;
c[s]=r;
queue<int> que;
que.push(s);
while(!que.empty()) {
int x=que.front();que.pop();
rep(i,v[x].size()) {
int y=v[x][i];
if(d[y]<=d[x]+1) continue;
d[y]=d[x]+1;
c[y]=r;
if(d[y]<t) que.push(y);
}
}
}
rep(i,n) pr(c[i]);
}
int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}
Submission Info
Submission Time |
|
Task |
B - Splatter Painting |
User |
kzyKT |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
1759 Byte |
Status |
WA |
Exec Time |
2108 ms |
Memory |
7288 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 |
1 ms |
256 KB |
00_example_02.txt |
AC |
1 ms |
256 KB |
10_01.txt |
AC |
1 ms |
256 KB |
10_02.txt |
AC |
1 ms |
256 KB |
10_03.txt |
WA |
32 ms |
256 KB |
10_04.txt |
AC |
1 ms |
256 KB |
10_05.txt |
AC |
1 ms |
256 KB |
10_06.txt |
AC |
1 ms |
256 KB |
10_07.txt |
AC |
1 ms |
256 KB |
10_08.txt |
WA |
7 ms |
384 KB |
10_09.txt |
WA |
6 ms |
384 KB |
10_10.txt |
WA |
6 ms |
384 KB |
10_11.txt |
WA |
7 ms |
384 KB |
10_12.txt |
WA |
6 ms |
384 KB |
10_13.txt |
WA |
2 ms |
384 KB |
10_14.txt |
WA |
2 ms |
384 KB |
10_15.txt |
WA |
2 ms |
384 KB |
10_16.txt |
AC |
27 ms |
384 KB |
10_17.txt |
AC |
27 ms |
384 KB |
20_01.txt |
TLE |
2104 ms |
6144 KB |
20_02.txt |
TLE |
2104 ms |
6144 KB |
20_03.txt |
TLE |
2108 ms |
6144 KB |
20_04.txt |
WA |
92 ms |
1152 KB |
20_05.txt |
WA |
11 ms |
256 KB |
20_06.txt |
WA |
185 ms |
3456 KB |
20_07.txt |
WA |
8 ms |
256 KB |
20_08.txt |
AC |
1682 ms |
384 KB |
20_09.txt |
WA |
6 ms |
256 KB |
20_10.txt |
AC |
141 ms |
256 KB |
20_11.txt |
TLE |
2103 ms |
384 KB |
20_12.txt |
WA |
391 ms |
6272 KB |
20_13.txt |
TLE |
2104 ms |
6144 KB |
20_14.txt |
TLE |
2104 ms |
6016 KB |
20_15.txt |
TLE |
2104 ms |
7288 KB |
20_16.txt |
TLE |
2103 ms |
7288 KB |