Submission #3585718


Source Code Expand

/*

                   _ooOoo_
                  o8888888o
                  88" . "88
                  (| -_- |)
                  O\  =  /O
               ____/`---'\____
             .'  \\|     |//  `.
            /  \\|||  :  |||//  \
           /  _||||| -:- |||||-  \
           |   | \\\  -  /// |   |
           | \_|  ''\---/''  |   |
           \  .-\__  `-`  ___/-. /
         ___`. .'  /--.--\  `. . __
      ."" '<  `.___\_<|>_/___.'  >'"".
     | | :  `- \`.;`\ _ /`;.`/ - ` : | |
     \  \ `-.   \_ __\ /__ _/   .-` /  /
======`-.____`-.___\_____/___.-`____.-'======
                   `=---='
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
                    prayer
*/

// g++ -std=c++11 a.cpp
#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<unordered_map>
#include<utility>
#include<cmath>
#include<random>
#include<cstring>
#include<queue>
#include<stack>
#include<bitset>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#include<typeinfo>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define FOR(i,a) for(auto i:a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
#define show1d(v) rep(_,v.size())cout<<" "<<v[_];cout<<endl;
#define show2d(v) rep(__,v.size()){rep(_,v[__].size())cout<<" "<<v[__][_];cout<<endl;}
using namespace std;
//kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
// #define mt make_tuple
// typedef tuple<int,int,int> tp;
// typedef vector<tp> vt;
template<typename A,typename B>bool cmin(A &a,const B &b){return a>b?(a=b,true):false;}
template<typename A,typename B>bool cmax(A &a,const B &b){return a<b?(a=b,true):false;}
//template<class C>constexpr int size(const C &c){return (int)c.size();}
//template<class T,size_t N> constexpr int size(const T (&xs)[N])noexcept{return (int)N;}
const double PI=acos(-1);
const double EPS=1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9+10;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};

signed main(){
	int n;
	cin>>n;
	vvi G(n);
	rep(i,n-1){
		int a,b,c;
		cin>>a>>b>>c;
		G[a].pb(c);
		G[b].pb(c);
	}
	map<int,int>ma;
	rep(i,n){
		int x=0;
		rep(j,G[i].size())x^=G[i][j];
		if(x)ma[x]++;
	}
	int m=0,out=0;
	FOR(a,ma){
		out+=a.second/2;
		if(a.second%2)m+=1<<a.first;
	}
	vi dp(1<<15,inf);
	dp[0]=0;
	m/=2;
	rep(i,1<<15){
		rep(j,15)if((i&1<<j)==0)cmin(dp[i|1<<j],dp[i]+1);
		int t=1<<15;
		t-=1+i;
		for(int j=t;j>0;j=(j-1)&t){
			int x=0,c=0;
			rep(k,15)if(j&1<<k)x^=1+k,c++;
			if(x)continue;
			cmin(dp[i|j],dp[i]+c-1);
		}
	}
	cout<<out+dp[m]<<endl;
}













Submission Info

Submission Time
Task F - XOR Tree
User ixmel_rd
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 3031 Byte
Status AC
Exec Time 784 ms
Memory 6772 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 2
AC × 43
Set Name Test Cases
Sample 0_000.txt, 0_001.txt
All 0_000.txt, 0_001.txt, 1_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 1_011.txt, 1_012.txt, 1_013.txt, 1_014.txt, 1_015.txt, 1_016.txt, 1_017.txt, 1_018.txt, 1_019.txt, 1_020.txt, 1_021.txt, 1_022.txt, 1_023.txt, 1_024.txt, 1_025.txt, 1_026.txt, 1_027.txt, 1_028.txt, 1_029.txt, 1_030.txt, 1_031.txt, 1_032.txt, 1_033.txt, 1_034.txt, 1_035.txt, 1_036.txt, 1_037.txt, 1_038.txt, 1_039.txt, 1_040.txt, 1_041.txt, 1_042.txt
Case Name Status Exec Time Memory
0_000.txt AC 680 ms 512 KB
0_001.txt AC 680 ms 512 KB
1_002.txt AC 772 ms 6016 KB
1_003.txt AC 776 ms 6016 KB
1_004.txt AC 781 ms 6016 KB
1_005.txt AC 776 ms 6016 KB
1_006.txt AC 774 ms 6016 KB
1_007.txt AC 776 ms 6016 KB
1_008.txt AC 777 ms 6016 KB
1_009.txt AC 775 ms 6016 KB
1_010.txt AC 776 ms 6016 KB
1_011.txt AC 776 ms 6016 KB
1_012.txt AC 771 ms 6772 KB
1_013.txt AC 768 ms 6772 KB
1_014.txt AC 771 ms 6772 KB
1_015.txt AC 771 ms 6772 KB
1_016.txt AC 773 ms 6772 KB
1_017.txt AC 772 ms 6772 KB
1_018.txt AC 772 ms 6772 KB
1_019.txt AC 768 ms 6772 KB
1_020.txt AC 779 ms 6772 KB
1_021.txt AC 771 ms 6772 KB
1_022.txt AC 778 ms 6772 KB
1_023.txt AC 770 ms 6772 KB
1_024.txt AC 770 ms 6772 KB
1_025.txt AC 772 ms 6772 KB
1_026.txt AC 765 ms 6772 KB
1_027.txt AC 766 ms 6772 KB
1_028.txt AC 772 ms 6772 KB
1_029.txt AC 771 ms 6772 KB
1_030.txt AC 770 ms 6772 KB
1_031.txt AC 771 ms 6772 KB
1_032.txt AC 770 ms 6772 KB
1_033.txt AC 777 ms 6528 KB
1_034.txt AC 784 ms 6528 KB
1_035.txt AC 778 ms 6528 KB
1_036.txt AC 782 ms 6528 KB
1_037.txt AC 778 ms 6528 KB
1_038.txt AC 776 ms 6528 KB
1_039.txt AC 779 ms 6528 KB
1_040.txt AC 779 ms 6528 KB
1_041.txt AC 776 ms 6528 KB
1_042.txt AC 780 ms 6528 KB