結果

問題 No.1775 Love Triangle 2
ユーザー maroon_kurimaroon_kuri
提出日時 2021-12-13 19:02:49
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 262 ms / 8,000 ms
コード長 10,142 bytes
コンパイル時間 4,100 ms
コンパイル使用メモリ 254,180 KB
最終ジャッジ日時 2025-01-26 09:46:18
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 90
権限があれば一括ダウンロードができます

ソースコード

diff # 

#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#endif

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
//#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

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

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class t,class u>
void print(const pair<t,u>&p,int suc=1){
	print(p.a,2);
	print(p.b,suc);
}

template<class T>
void print(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print(v[i],i==int(v.size())-1?suc:2);
}

template<class T>
void print_offset(const vector<T>&v,ll off,int suc=1){
	rep(i,v.size())
		print(v[i]+off,i==int(v.size())-1?suc:2);
}

template<class T,size_t N>
void print(const array<T,N>&v,int suc=1){
	rep(i,N)
		print(v[i],i==int(N)-1?suc:2);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

//#define CAPITAL
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	#ifdef LOCAL
	static mt19937_64 gen;
	#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif
	return uniform_int_distribution<ll>(l, r)(gen);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

namespace Nimber64{
	const vi fs{3,5,17,257,641,65537,6700417};
	const ull s=-1;
	
	ull multiply_powers_of_2(ull,ull);

	ull multiply(ull a,ull b) {
	   ull ans = 0;
	   rep(p1,64)if((a>>p1)&1)
		   rep(p2,64)if((b>>p2)&1)
			  ans=ans^multiply_powers_of_2(ull(1)<<p1,ull(1)<<p2);
	   return ans;
	}
	ull multiply_powers_of_2(ull a, ull b) {
		if (a == 1 or b == 1) return a * b;
		int n=__lg(__lg(max(a,b)));
		ull power = ull(1)<<(1<<n);
		if (a >= power and b >= power) {
			return multiply(power * 3 / 2, multiply_powers_of_2(a / power, b / power));
		} else if (a >= power) {
			return multiply_powers_of_2(a / power, b) * power;
		} else {
			return multiply_powers_of_2(a, b / power) * power;
		}
	}
	
	struct precalc{
		ull tmp[64][64];
		unsigned char x[256][256];
		ull y[8][8][256];
		template<int len>
		ull multfast(ull a,ull b){
			ull c=0;
			rep(i,len)if((a>>i)&1)rep(j,len)if((b>>j)&1)c^=tmp[i][j];
			return c;
		}
		precalc():tmp(),x(),y(){
			rep(i,64)rep(j,64)tmp[i][j]=multiply_powers_of_2(1ULL<<i,1ULL<<j);
			rep(i,256)rep(j,256)x[i][j]=multfast<8>(i,j);
			rep(i,8)rep(j,i+1)rep(k,256)y[i][j][k]=multfast<64>(tmp[i*8][j*8],k);
		}
		ull multfast2(ull a,ull b)const{
			ull res=0;
			rep(i,8){
				rep(j,i){
					res^=y[i][j][
					x[(a>>(i*8))&255][(b>>(j*8))&255]^
					x[(a>>(j*8))&255][(b>>(i*8))&255]];
				}
				res^=y[i][i][x[(a>>(i*8))&255][(b>>(i*8))&255]];
			}
			return res;
		}
	};
	const precalc buf;
	
	struct nim{
		ull v;
		nim(ull vv=0):v(vv){}
		nim& operator+=(const nim&rhs){v^=rhs.v;return *this;}
		nim& operator*=(const nim&rhs){v=buf.multfast2(v,rhs.v);return *this;}
		nim& operator/=(const nim&rhs){return (*this)*=rhs.inv();}
		nim operator+(const nim&rhs)const{return nim(*this)+=rhs;}
		nim operator*(const nim&rhs)const{return nim(*this)*=rhs;}
		nim operator/(const nim&rhs)const{return nim(*this)/=rhs;}
		nim pow(ull n)const{
			nim res=1,x=*this;
			while(n){
				if(n&1)res*=x;
				x*=x;
				n>>=1;
			}
			return res;
		}
		nim inv()const{
			return pow(ull(-2));
		}
		explicit operator bool()const{return v;}
	};
	istream& operator>>(istream&is,nim&x){
		return is>>x.v;
	}
	ostream& operator<<(ostream&os,const nim&x){
		return os<<x.v;
	}
	
	/*
	pair<ull,ull> garnerull(vc<pi> z){
		ull ans=0,w=1;
		rep(i,si(z)){
			int x=z[i].a;
			ans=(ans+w*x);
			rng(j,i+1,si(z))
				z[j].a=(z[j].a+z[j].b-x%z[j].b)*modinv(z[i].b,z[j].b).b%z[j].b;
			w=(w*z[i].b);
		}
		return {ans,w};
	}
	
	//returns minimum x s.t. a^x=b
	//and its period
	//returns (0,0) if infeasible
	pair<ull,ull> discrete_log(const nim a,const nim b){
		vc<pi> z;
		for(auto f:fs){
			nim x=a.pow(s/f);
			nim y=b.pow(s/f);
			if(x.v==1){
				if(y.v==1){
					continue;
				}else{
					return {0,0};
				}
			}
			
			const int L=ceil(sqrt(f-1));
			map<ull,int> v;
			//hash_table<ull,int> v;
			{
				nim cur=1;
				rep(i,L){
					auto itr=v.find(cur.v);
					if(itr==v.ed)v[cur.v]=i;
					cur*=x;
				}
			}
			int ans=-1;
			{
				nim cur=1;
				nim w=x.pow((f-1)*L);
				for(int i=0;i<f;i+=L){
					nim tar=y*cur;
					auto itr=v.find(tar.v);
					if(itr!=v.ed){
						ans=i+itr->b;
						break;
					}
					cur*=w;
				}
			}
			if(ans==-1)return {0,0};
			z.eb(ans,f);
		}
		
		return garnerull(z);
	}
	*/
	
	bool checkprimitive(const nim a){
		for(auto f:fs)if((a.pow(s/f)).v==1)return false;
		return true;
	}
}
using Nimber64::nim;
//原子根 ull(1)<<32|6

//simple undirected graph
//O((ANS)M2^|USE|)
//|USE|>=2
int minimum_simple_cycle(int n,vi use,vc<pi> es){
	{
		for(auto&[i,j]:es){
			if(i<j)swap(i,j);
		}
		mkuni(es);
	}
	mt19937_64 rnd;
	assert(si(use)>=2);
	int root=use[0];
	int m=si(es);
	vvc<tuple<int,int,nim>> g(n);
	rep(idx,m){
		auto [i,j]=es[idx];
		nim val(rnd());
		g[i].eb(j,idx*2,val);
		if(i==root||j==root)val=nim(rnd());
		g[j].eb(i,idx*2+1,val);
	}
	const int s=si(use)-1;
	vc<nim> dp((2*m)<<s),nx((2*m)<<s);
	for(auto [to,idx,val]:g[root])
		dp[idx<<s]=val;
	vi msk(n);
	rep(i,s)msk[use[i+1]]=1<<i;
	vc<nim> buf(1<<s);
	rng(ans,1,n+1){
		fill(all(nx),0);
		rep(i,n){
			fill(all(buf),0);
			for(auto [to,idx,val]:g[i]){
				rep(bit,1<<s){
					buf[bit]+=dp[(idx^1)<<s|bit];
				}
			}
			if(i==root){
				if(buf[mask(s)])return ans;
			}else if(msk[i]){
				for(auto [to,idx,val]:g[i]){
					rep(bit,1<<s)if((bit&msk[i])==0){
						nx[idx<<s|bit|msk[i]]+=(buf[bit]+dp[(idx^1)<<s|bit])*val;
					}
				}
			}else{
				for(auto [to,idx,val]:g[i]){
					rep(bit,1<<s)nx[idx<<s|bit]+=buf[bit]*val;
				}
			}
		}
		swap(nx,dp);
	}
	return -1;
}

void test(){
	//print(minimum_simple_cycle(3,{0},{{0,1},{1,2},{0,2}}));
	/*print(minimum_simple_cycle(9,{5,2,7},{
		{1,2},
		{1,5},
		{6,5},
		{6,7},
		{5,2},
		{2,3},
		{3,4},
		{4,0},
		{0,8},
		{8,7},
		{7,5},
	}));*/
	print(minimum_simple_cycle(5,{0,1,2},{
		{0,3},{0,4},
		{1,3},{1,4},
		{2,3},{2,4},
	}));
	exit(0);
}

void slv(){
	int n,m;cin>>n>>m;
	vi u=readvi(3,-1);
	vvc<int> adj(n,vi(n,1));
	rep(i,m){
		int a,b;cin>>a>>b;
		a--;b--;
		adj[a][b]=0;
	}
	vc<pi> es;
	rep(i,n)rng(j,i+1,n)if(adj[i][j])es.eb(i,j);
	print(minimum_simple_cycle(n,u,es));
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	//test();
	//int t;cin>>t;rep(_,t)
	slv();
}
0