提出 #66362019

---

ソースコード 拡げる

#include<fstream>
#include<iostream>
#include<iomanip>
#include<vector>
#include<queue>
#include<unordered_set>
#include<unordered_map>
#include<map>
#include<cmath>
#include<numbers>
#include<algorithm>
#include<string>
#include<set>
#include<stack>
#include<random>
#include<bitset>
#include<cassert>
#include<exception>

using namespace std;
using ll=long long;
using uset=unordered_set<long long>;

int H,W;
vector<string> strs;

struct point{
	int x,y;
	point():x(0),y(0){}
	point(int x,int y):x(x),y(y){}
	point operator+(const point& a){
		return point(a.x+x,a.y+y);
	}
	bool rangeCheck(){
		return 0<=x&&x<W&&0<=y&&y<H;
	}
	bool mapCheck(){
		return rangeCheck()&&strs[y][x]=='.';
	}
};

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

int main(){
	int N,M;
	cin>>N>>M;

	vector<vector<pair<int,int>>> graph(N);
	for(int i=0;i<M;i++){
		int u,v,w;
		cin>>u>>v>>w;
		u--;v--;
		graph[u].emplace_back(v, w);
		graph[v].emplace_back(u, w);
	}
	int ans=0;
	unsigned int temp=(unsigned int)-1;

	for(int i=29;i>=0;i--){
		queue<int> queue;
		vector<bool> dist(N,false);

		queue.push(0);
		while(queue.size()>0){
			auto v = queue.front();
			queue.pop();
			if(!dist[v]){
				dist[v]=true;
				for(auto g:graph[v]){
					if((g.second&(~ans)&(temp<<i))==0){
						queue.push(g.first);
					}
				}
			}
		}
		if(!dist[N-1])ans=ans|(1<<i);
	}
	cout<<ans<<endl;
	return 0;
}

提出情報

ジャッジ結果