Submission #1673225
Source Code Expand
#include <bits/stdc++.h>
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<map>
#include<cstring>
#include<string>
#include <math.h>
#include<algorithm>
// #include <boost/multiprecision/cpp_int.hpp>
#include<functional>
#define int long long
#define inf 1000000007
#define pa pair<int,int>
#define ll long long
#define pal pair<double,pa>
#define ppa pair<int,int>
#define ppap pair<int,pa>
#define ssa pair<string,int>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
#define equals(a,b) (fabs((a)-(b))<EPS)
using namespace std;
class Point{
public:
double x,y;
Point(double x=0,double y=0):x(x),y(y) {}
Point operator + (Point p) {return Point(x+p.x,y+p.y);}
Point operator - (Point p) {return Point(x-p.x,y-p.y);}
Point operator * (double a) {return Point(x*a,y*a);}
Point operator / (double a) {return Point(x/a,y/a);}
double absv() {return sqrt(norm());}
double norm() {return x*x+y*y;}
bool operator < (const Point &p) const{
return x != p.x ? x<p.x: y<p.y;
}
bool operator == (const Point &p) const{
return fabs(x-p.x)<EPS && fabs(y-p.y)<EPS;
}
};
typedef Point Vector;
struct Segment{
Point p1,p2;
};
double dot(Vector a,Vector b){
return a.x*b.x+a.y*b.y;
}
double cross(Vector a,Vector b){
return a.x*b.y-a.y*b.x;
}
bool parareru(Point a,Point b,Point c,Point d){
// if(abs(cross(a-b,d-c))<EPS)cout<<"dd "<<cross(a-b,d-c)<<endl;
return abs(cross(a-b,d-c))<EPS;
}
double distance_ls_p(Point a, Point b, Point c) {
if ( dot(b-a, c-a) < EPS ) return (c-a).absv();
if ( dot(a-b, c-b) < EPS ) return (c-b).absv();
return abs(cross(b-a, c-a)) / (b-a).absv();
}
bool is_intersected_ls(Segment a,Segment b) {
if(a.p1==b.p1||a.p2==b.p1||a.p1==b.p2||a.p2==b.p2) return false;
if(parareru((a.p2),(a.p1),(a.p1),(b.p2))&¶reru((a.p2),(a.p1),(a.p1),(b.p1))){
// cout<<"sss"<<endl;
if(dot(a.p1-b.p1,a.p1-b.p2)<EPS) return true;
if(dot(a.p2-b.p1,a.p2-b.p2)<EPS) return true;
if(dot(a.p1-b.p1,a.p2-b.p1)<EPS) return true;
if(dot(a.p1-b.p2,a.p2-b.p2)<EPS) return true;
return false;
}
else return ( cross(a.p2-a.p1, b.p1-a.p1) * cross(a.p2-a.p1, b.p2-a.p1) < EPS ) && ( cross(b.p2-b.p1, a.p1-b.p1) * cross(b.p2-b.p1, a.p2-b.p1) < EPS );
}
double segment_dis(Segment a,Segment b){
if(is_intersected_ls(a,b))return 0;
double r=distance_ls_p(a.p1, a.p2, b.p1);
r=min(r,distance_ls_p(a.p1, a.p2, b.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p2));
r=min(r,distance_ls_p(b.p1, b.p2, a.p1));
return r;
}
Point intersection_ls(Segment a, Segment b) {
Point ba = b.p2-b.p1;
double d1 = abs(cross(ba, a.p1-b.p1));
double d2 = abs(cross(ba, a.p2-b.p1));
double t = d1 / (d1 + d2);
return a.p1 + (a.p2-a.p1) * t;
}
string itos( int i ) {
ostringstream s ;
s << i ;
return s.str() ;
}
int gcd(int v,int b){
if(v>b) return gcd(b,v);
if(v==b) return b;
if(b%v==0) return v;
return gcd(v,b%v);
}
double distans(double x1,double y1,double x2,double y2){
double rr=(x1-x2)*(x1-x2)+(y1-y2)*(y1-y2);
return sqrt(rr);
}
/*
int pr[100010];
//int inv[100010];
*/
int beki(int wa,int rr,int warukazu){
if(rr==0) return 1ll;
if(rr==1) return wa%warukazu;
if(rr%2==1) return (beki(wa,rr-1,warukazu)*wa)%warukazu;
int zx=beki(wa,rr/2,warukazu);
return (zx*zx)%warukazu;
}
/*
void gya(){
pr[0]=1;
for(int i=1;i<100010;i++){
pr[i]=(pr[i-1]*i)%inf;
}
for(int i=0;i<100010;i++) inv[i]=beki(pr[i],inf-2);
}
*/
//sort(ve.begin(),ve.end(),greater<int>());
//----------------kokomade tenpure------------
//vector<double> ans(100000000),ans2(100000000);
int n,m;
vector<int> G[100020];
int v[100020],d[100030],c[100030];
int dp[100030][11];
void dfs(int s,int k,int f){
if(k==-1) return ;
if(dp[s][k]!=-1) return;
// cout<<s<<" "<<k<<" "<<f<<endl;
dp[s][k]=f;
dfs(s,k-1,f);
for(int i=0;i<G[s].size();i++){
dfs(G[s][i],k-1,f);
}
}
signed main(){
for(int i=0;i<100030;i++)for(int j=0;j<=10;j++) dp[i][j]=-1;
cin>>n>>m;
for(int i=0;i<m;i++){
int y,yy;
cin>>y>>yy;
G[y].pb(yy);
G[yy].pb(y);
}
int q;
cin>>q;
for(int i=0;i<q;i++){
cin>>v[i]>>d[i]>>c[i];
}
for(int i=q-1;i>=0;i--){
dfs(v[i],d[i],i);
}
for(int i=1;i<=n;i++){
int y=dp[i][0];
if(y!=-1) cout<<c[y]<<endl;
else cout<<0<<endl;
}
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Splatter Painting |
User |
smiken |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
6285 Byte |
Status |
AC |
Exec Time |
332 ms |
Memory |
17780 KB |
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 |
5 ms |
13568 KB |
00_example_02.txt |
AC |
5 ms |
13568 KB |
10_01.txt |
AC |
6 ms |
13568 KB |
10_02.txt |
AC |
5 ms |
13568 KB |
10_03.txt |
AC |
5 ms |
13568 KB |
10_04.txt |
AC |
5 ms |
13568 KB |
10_05.txt |
AC |
6 ms |
13568 KB |
10_06.txt |
AC |
5 ms |
13568 KB |
10_07.txt |
AC |
8 ms |
13568 KB |
10_08.txt |
AC |
11 ms |
13568 KB |
10_09.txt |
AC |
11 ms |
13568 KB |
10_10.txt |
AC |
11 ms |
13568 KB |
10_11.txt |
AC |
10 ms |
13568 KB |
10_12.txt |
AC |
11 ms |
13568 KB |
10_13.txt |
AC |
9 ms |
13568 KB |
10_14.txt |
AC |
9 ms |
13568 KB |
10_15.txt |
AC |
9 ms |
13568 KB |
10_16.txt |
AC |
11 ms |
13568 KB |
10_17.txt |
AC |
10 ms |
13568 KB |
20_01.txt |
AC |
327 ms |
17408 KB |
20_02.txt |
AC |
332 ms |
17408 KB |
20_03.txt |
AC |
328 ms |
17408 KB |
20_04.txt |
AC |
42 ms |
14592 KB |
20_05.txt |
AC |
10 ms |
13568 KB |
20_06.txt |
AC |
155 ms |
13824 KB |
20_07.txt |
AC |
10 ms |
13568 KB |
20_08.txt |
AC |
50 ms |
13696 KB |
20_09.txt |
AC |
10 ms |
13568 KB |
20_10.txt |
AC |
50 ms |
13696 KB |
20_11.txt |
AC |
65 ms |
13696 KB |
20_12.txt |
AC |
217 ms |
17152 KB |
20_13.txt |
AC |
281 ms |
17280 KB |
20_14.txt |
AC |
288 ms |
17152 KB |
20_15.txt |
AC |
299 ms |
17652 KB |
20_16.txt |
AC |
299 ms |
17780 KB |