Submission #5474239

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())//vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define LINF 1e18
#define MOD 1000000007
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;

typedef vector<unsigned int>vec;
typedef vector<vec> mat;
//typedef tuple<ll, ll, ll> T;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }


int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};

vector<vector<ll>> tree;
bool visit[10101];
bool white[10101];
vector<vector<ll>> length;

void dfs(int n,int sum){
    if(visit[n]) return;
    visit[n]=true;
    for(int i=0;i<tree[n].size();i++){
        sum+=length[n][tree[n][i]];
        //cout<<tree[n][i]<<":"<<sum<<endl;
        //cout<<sum<<endl;
        if(sum%2==0) white[tree[n][i]]=true;
        dfs(tree[n][i],sum);
    }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;cin>>N;
    tree.resize(N+1);
    length.assign(N+1,vector<ll>(N+1));

    REP(i,N-1){
        visit[i]=false;
        ll u,v,w;
        cin>>u>>v>>w;
        tree[u-1].push_back(v-1);
        //tree[v-1].push_back(u-1);
        length[u-1][v-1]=length[u-1][v-1]=w;
    }
    white[0]=true;
    dfs(0,0);
    REP(i,N){
        if(white[i]) cout<<0<<endl;
        else cout<<1<<endl;
    }
}

Submission Info

Judge Result