Submission #1240787

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <algorithm>

using namespace std;

struct data {
    int num;
    struct data* Next;
};

struct node {
    int color;
    struct data* next;
    int nextnum = 0;
};
int n, m, q;
struct node Node[100001];
int visit[100001];

void color (int v, int d, int c) {
    Node[v].color = c;
    int i = v;
        visit[i] = 1;
        for (struct data* temp = Node[i].next; temp != NULL; temp = temp -> Next) {
            //if (visit[Node[i].next[j]])
                //continue;
            if (d == 1) {
                Node[temp -> num].color = c;
                
            }
            else {
                Node[temp -> num].color = c;
                color (temp -> num, d - 1, c);
            }
        }
        visit[i] = 0;
    
}

int main () {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) {
        Node[i].color = 0;
        Node[i].nextnum = 0;
        Node[i].next = NULL;
    }
    for (int i = 0; i < m; i++) {
        int a, b;
        scanf("%d%d", &a, &b);
        struct data* A = (struct data*)malloc(sizeof(struct data));
        struct data* B = (struct data*)malloc(sizeof(struct data));
        A -> num = b;
        B -> num = a;
        A -> Next = Node[a].next;
        B -> Next = Node[b].next;
        Node[a].next = A;
        Node[b].next = B;
    }
    scanf("%d", &q);
    memset (visit, 0, sizeof(int) * n);
    for (int i = 0; i < q; i++) {
        int v, d, c;
        scanf("%d%d%d", &v, &d, &c);
        
        color (v, d, c);
    }
    
    for (int i = 1; i <= n; i++) {
        printf("%d\n", Node[i].color);
    }
    return 0;
}

Submission Info

Judge Result