Submission #1586726


Source Code Expand

#include <bits/stdc++.h>
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define lp(i,a,n) for(int i=(a);i<=(int)(n);++i)
#define lpd(i,a,n) for(int i=(a);i>=(int)(n);--i)
#define mem(a,b) memset(a,b,sizeof a)
#define all(v) v.begin(),v.end()
#define println(a) cout <<(a) <<endl
#define sz(x) ((int)(x).size())
#define readi(x) scanf("%d",&x)
#define read2i(x,y) scanf("%d%d",&x,&y)
#define read3i(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define mod 1000000007
#define eps 1e-8
#define infi 1000000000
#define infll 1000000000000000000ll
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef set<int> si;
typedef map<int,int> mii;

const int N = 100002;
int n,m,q,v[N],d[N],c[N],ans[N],dist[N];
vvi g(N);
bool vis[N];

void bfs(int src, int d, int c){
    ans[src] = c;
    vis[src] = true;
    queue<pii> q;
    q.push(mp(src, 0));
    while(sz(q)){
        pii curr = q.front(); q.pop();
        if(curr.s == d) break;
        for(int j : g[curr.f]) if(!vis[j]){
            vis[j] = true;
            ans[j] = c;
            q.push(mp(j, curr.s+1));
        }
    }
}

void go(int src){
    lp(i,1,n) dist[i] = infi;
    dist[src] = 0;
    mem(vis,0);
    vis[src] = true;
    queue<pii> q;
    q.push(mp(src, 0));
    while(sz(q)){
        pii curr = q.front(); q.pop();
        if(curr.s == 10) break;
        for(int j : g[curr.f]) if(!vis[j]){
            vis[j] = true;
            dist[j] = curr.s+1;
            q.push(mp(j, curr.s+1));
        }
    }
}

int main(){
    read2i(n,m);
    lp(i,1,m){
        int x,y;
        read2i(x,y);
        g[x].pb(y);
        g[y].pb(x);
    }
    readi(q);
    lp(i,1,q) read3i(v[i],d[i],c[i]);

    lpd(i,q,1) if(!vis[v[i]])
        bfs(v[i], d[i], c[i]);

    lp(i,1,n) if(!ans[i]){
        go(i);
        lpd(j,q,1) if(dist[v[j]] <= d[j]){
            ans[i] = c[j];
            break;
        }
    }
    lp(i,1,n) printf("%d\n",ans[i]);
}

/*
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
*/

Submission Info

Submission Time
Task B - Splatter Painting
User vjudge3
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2109 Byte
Status WA
Exec Time 2103 ms
Memory 8568 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:69:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     read2i(n,m);
                ^
./Main.cpp:72:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         read2i(x,y);
                    ^
./Main.cpp:76:13: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     readi(q);
             ^
./Main.cpp:77:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     lp(i,1,q) read3i(v[i],d[i],c[i]);
                                     ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 200 0 / 500
Status
AC × 2
AC × 10
WA × 9
AC × 15
WA × 18
TLE × 2
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 2688 KB
00_example_02.txt AC 2 ms 2688 KB
10_01.txt AC 3 ms 2688 KB
10_02.txt AC 3 ms 2688 KB
10_03.txt WA 3 ms 2688 KB
10_04.txt AC 3 ms 2688 KB
10_05.txt AC 3 ms 2688 KB
10_06.txt AC 2 ms 2560 KB
10_07.txt AC 10 ms 2688 KB
10_08.txt WA 7 ms 2816 KB
10_09.txt WA 6 ms 2816 KB
10_10.txt WA 7 ms 2816 KB
10_11.txt WA 6 ms 2816 KB
10_12.txt WA 6 ms 2816 KB
10_13.txt WA 6 ms 2816 KB
10_14.txt WA 8 ms 2816 KB
10_15.txt WA 9 ms 2816 KB
10_16.txt AC 3 ms 2688 KB
10_17.txt AC 3 ms 2688 KB
20_01.txt WA 1641 ms 7808 KB
20_02.txt WA 1576 ms 7808 KB
20_03.txt WA 1703 ms 7808 KB
20_04.txt AC 13 ms 3328 KB
20_05.txt WA 4 ms 2688 KB
20_06.txt TLE 2103 ms 3584 KB
20_07.txt WA 4 ms 2688 KB
20_08.txt AC 18 ms 3584 KB
20_09.txt WA 4 ms 2816 KB
20_10.txt WA 17 ms 3456 KB
20_11.txt AC 23 ms 3840 KB
20_12.txt TLE 2059 ms 6656 KB
20_13.txt WA 573 ms 7680 KB
20_14.txt WA 390 ms 7808 KB
20_15.txt AC 61 ms 8568 KB
20_16.txt AC 58 ms 8568 KB