Submission #63538449

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<iostream>
#include<iomanip>
#include<cmath>
#include<climits>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<stack>
#include<numeric>
#include<queue>
#include<bitset>
#include<unordered_map>
#include<unordered_set>
#include<limits>
#include<cassert>
#include<ranges>
#include<list>
using namespace std;
#define MOD 998244353
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<iostream>
#include<iomanip>
#include<cmath>
#include<climits>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<set>
#include<stack>
#include<numeric>
#include<queue>
#include<bitset>
#include<unordered_map>
#include<unordered_set>
#include<limits>
#include<cassert>
#include<ranges>
#include<list>
using namespace std;
#define MOD 998244353

long long ans=LLONG_MAX;

void saiki(int pos,long long xori,vector<bool>& arr,const vector<vector< pair<int,long long> >>& edge,const int& n){
	if(pos==n-1){
		ans=min(ans,xori);
		return;
	}

	arr[pos]=true;
	for(auto [e,w]: edge[pos]){
		if(arr[e]) continue;
		saiki(e,(xori ^ w),arr,edge,n);
	}
	arr[pos]=false;
}

int main(){
	int n,m;
	cin>>n>>m;

	vector<int> u(m),v(m);
	vector<long long> w(m);
	vector<vector< pair<int,long long> >> edge(n,vector<pair<int,long long>>());
	for(int i=0;i<m;++i){
		cin>>u[i]>>v[i]>>w[i];
		u[i]--;v[i]--;
		edge[u[i]].push_back( {v[i],w[i]} );
		edge[v[i]].push_back( {u[i],w[i]} );
	}

	vector<bool> arr(n,false);
	saiki(0,0,arr,edge,n);

	cout<<ans<<endl;

	//cout<<min(mini[n-1],mini[n+n-1])<<endl;

	//cout<<tmpp.size()<<endl;
	//cout<<*tmpp.begin()<<endl;

	//if(flag)cout<<"Yes"<<endl;
	//else cout<<"No"<<endl;

	return 0;
}

Submission Info

Judge Result