Submission #5477114


Source Code Expand

Copy
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
//#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
/*---------------------------------------------------------------------------------------------------
            ∧_∧  
      ∧_∧  (´<_` )  Welcome to My Coding Space!
     ( ´_ゝ`) /  ⌒i     
    /   \     | |     
    /   / ̄ ̄ ̄ ̄/  |  
  __(__ニつ/     _/ .| .|____  
     \/____/ (u ⊃  
---------------------------------------------------------------------------------------------------*/






int N;
vector<pair<int, int>> E[101010];
//---------------------------------------------------------------------------------------------------
int ans[101010];
void dfs(int cu, int pa = -1, int col = 0) {
	ans[cu] = col;
	fore(p, E[cu]) {
		if (p.first == pa) continue;

		if (p.second % 2 == 0) dfs(p.first, cu, col);
		else dfs(p.first, cu, 1 - col);
	}
}
//---------------------------------------------------------------------------------------------------
void _main() {
	cin >> N;
	rep(i, 0, N - 1) {
		int a, b, c; cin >> a >> b >> c;
		a--; b--;

		E[a].push_back({ b,c });
		E[b].push_back({ a,c });
	}

	dfs(0);

	rep(i, 0, N) printf("%d\n", ans[i]);
}

Submission Info

Submission Time
Task D - Even Relation
User hamayanhamayan
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1942 Byte
Status AC
Exec Time 56 ms
Memory 9216 KB

Judge Result

Set Name All Sample
Score / Max Score 400 / 400 0 / 0
Status
AC × 22
AC × 2
Set Name Test Cases
All sample_01, sample_02, testcase_01, testcase_02, testcase_03, testcase_04, testcase_05, testcase_06, testcase_07, testcase_08, testcase_09, testcase_10, testcase_11, testcase_12, testcase_13, testcase_14, testcase_15, testcase_16, testcase_17, testcase_18, testcase_19, testcase_20
Sample sample_01, sample_02
Case Name Status Exec Time Memory
sample_01 AC 2 ms 2688 KB
sample_02 AC 2 ms 2688 KB
testcase_01 AC 29 ms 5496 KB
testcase_02 AC 20 ms 4472 KB
testcase_03 AC 23 ms 4856 KB
testcase_04 AC 31 ms 6912 KB
testcase_05 AC 49 ms 9216 KB
testcase_06 AC 22 ms 5632 KB
testcase_07 AC 2 ms 2688 KB
testcase_08 AC 2 ms 2688 KB
testcase_09 AC 2 ms 2688 KB
testcase_10 AC 15 ms 3712 KB
testcase_11 AC 3 ms 2688 KB
testcase_12 AC 22 ms 4352 KB
testcase_13 AC 23 ms 4352 KB
testcase_14 AC 23 ms 4352 KB
testcase_15 AC 56 ms 6912 KB
testcase_16 AC 56 ms 6912 KB
testcase_17 AC 54 ms 6656 KB
testcase_18 AC 11 ms 3328 KB
testcase_19 AC 38 ms 5504 KB
testcase_20 AC 15 ms 3712 KB