結果
| 問題 | No.1776 Love Triangle 2 (Hard) |
| ユーザー |
 Taiki0715
|
| 提出日時 | 2026-06-18 12:45:25 |
| 言語 | C++23 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 223 ms / 10,000 ms |
| コード長 | 11,251 bytes |
| 記録 | |
| コンパイル時間 | 3,945 ms |
| コンパイル使用メモリ | 472,428 KB |
| 実行使用メモリ | 6,400 KB |
| 最終ジャッジ日時 | 2026-06-18 12:45:45 |
| 合計ジャッジ時間 | 14,479 ms |
|
ジャッジサーバーID （参考情報） |
judge1_0 / judge2_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 176 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>istream &operator>>(istream &is,pair<T1,T2>&p){is>>p.first>>p.second;return is;}
template<typename T1,typename T2,typename T3>istream &operator>>(istream &is,tuple<T1,T2,T3>&a){is>>std::get<0>(a)>>std::get<1>(a)>>std::get<2>(a);return is;}
template<typename T,size_t n>istream &operator>>(istream &is,array<T,n>&a){for(auto&i:a)is>>i;return is;}
template<typename T>istream &operator>>(istream &is,vector<T> &a){for(auto &i:a)is>>i;return is;}
template<typename T1,typename T2>void operator++(pair<T1,T2>&a,int n){a.first++,a.second++;}
template<typename T1,typename T2>void operator--(pair<T1,T2>&a,int n){a.first--,a.second--;}
template<typename T>void operator++(vector<T>&a,int n){for(auto &i:a)i++;}
template<typename T>void operator--(vector<T>&a,int n){for(auto &i:a)i--;}
#define overload3(_1,_2,_3,name,...) name
#define rep1(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define rep(...) overload3(__VA_ARGS__,rep2,rep1)(__VA_ARGS__)
#define reps(i,l,r) rep2(i,l,r)
#define all(x) x.begin(),x.end()
#define pcnt(x) __builtin_popcountll(x)
#define fin(x) return cout<<(x)<<'\n',static_cast<void>(0)
#define yn(x) cout<<((x)?"Yes\n":"No\n")
#define uniq(x) sort(all(x)),x.erase(unique(all(x)),x.end())
template<typename T>
inline int fkey(vector<T>&z,T key){return lower_bound(z.begin(),z.end(),key)-z.begin();}
ll myceil(ll a,ll b){return (a+b-1)/b;}
template<typename T,size_t n,size_t id=0>
auto vec(const int (&d)[n],const T &init=T()){
if constexpr (id<n)return vector(d[id],vec<T,n,id+1>(d,init));
else return init;
}
#ifdef LOCAL
#include<debug.h>
#define SWITCH(a,b) (a)
#else
#define debug(...) static_cast<void>(0)
#define debugg(...) static_cast<void>(0)
#define SWITCH(a,b) (b)
template<typename T1,typename T2>ostream &operator<<(ostream &os,const pair<T1,T2>&p){os<<p.first<<' '<<p.second;return os;}
#endif
struct Timer{
clock_t start;
Timer(){
start=clock();
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout<<fixed<<setprecision(16);
}
inline double now(){return (double)(clock()-start)/1000;}
#ifdef LOCAL
~Timer(){
cerr<<"time:";
cerr<<now();
cerr<<"ms\n";
}
#endif
}timer;
void SOLVE();
int main(){
int testcase=1;
//cin>>testcase;
for(int i=0;i<testcase;i++){
SOLVE();
}
}
template<typename T=int>
struct Edge{
int from,to;
T weight;
int index;
Edge(int from_,int to_,T weight_=T(),int index_=-1):from(from_),to(to_),weight(weight_),index(index_){}
Edge():from(-1),to(-1),weight(),index(-1){}
friend std::ostream &operator<<(std::ostream &os,const Edge&e){
os<<'[';
os<<"from:"<<e.from;
os<<"to:"<<e.to;
os<<"weight:"<<e.weight;
os<<"index:"<<e.index;
os<<']';
return os;
}
};
template<typename T=int>
struct Graph{
private:
int n;
std::vector<Edge<T>>edge;
std::vector<Edge<T>>g;
std::vector<int>ptr;
bool directed;
struct graph_range{
using iterator=typename std::vector<Edge<T>>::iterator;
iterator l,r;
iterator begin()const{return l;}
iterator end()const{return r;}
int size()const{return r-l;}
Edge<T> &operator[](int i)const{return l[i];}
};
struct const_graph_range{
using iterator=typename std::vector<Edge<T>>::const_iterator;
iterator l,r;
iterator begin()const{return l;}
iterator end()const{return r;}
int size()const{return r-l;}
const Edge<T> &operator[](int i)const{return l[i];}
};
public:
Graph(int n_,bool dir_):n(n_),directed(dir_){}
Graph():n(0){}
Graph(int n_,bool dir_,const std::vector<Edge<T>>&e):n(n_),directed(dir_),edge(e){build();}
template<bool weighted=false,bool index=1>
void read(int m){
edge.reserve(m);
for(int i=0;i<m;i++){
int u,v;
std::cin>>u>>v;
T w;
if constexpr(index)u--,v--;
if constexpr(weighted)std::cin>>w;
else w=1;
edge.emplace_back(u,v,w,i);
}
build();
}
void add_edge(int u,int v){
assert(0<=u&&u<n);
assert(0<=v&&v<n);
int id=edge.size();
edge.emplace_back(u,v,1,id);
}
void add_edge(int u,int v,T w){
assert(0<=u&&u<n);
assert(0<=v&&v<n);
int id=edge.size();
edge.emplace_back(u,v,w,id);
}
void add_edge(int u,int v,T w,int index){
assert(0<=u&&u<n);
assert(0<=v&&v<n);
edge.emplace_back(u,v,w,index);
}
void add_edge(Edge<T>e){
edge.emplace_back(e);
}
void build(){
std::vector<int>cnt(n+1,0);
for(const Edge<T>&e:edge){
cnt[e.from+1]++;
if(!directed)cnt[e.to+1]++;
}
for(int i=1;i<=n;i++)cnt[i]+=cnt[i-1];
ptr=cnt;
g.resize(cnt[n]);
for(const Edge<T>&e:edge){
g[cnt[e.from]++]=e;
if(!directed)g[cnt[e.to]++]=Edge<T>(e.to,e.from,e.weight,e.index);
}
}
void reverse(){
if(directed){
for(Edge<T>&e:edge)std::swap(e.from,e.to);
build();
}
}
inline void to_directed(){
directed=true;
build();
}
inline void to_undirected(){
directed=false;
build();
}
void reserve(int m){edge.reserve(m);}
graph_range operator[](int i){return graph_range{g.begin()+ptr[i],g.begin()+ptr[i+1]};}
const_graph_range operator[](int i)const{return const_graph_range{g.begin()+ptr[i],g.begin()+ptr[i+1]};}
const Edge<T>& get_edge(int i)const{return edge[i];}
std::vector<Edge<T>>get_edges()const{return edge;}
inline bool is_directed()const{return directed;}
inline int size()const{return n;}
inline int edge_size()const{return edge.size();}
typename std::vector<Edge<T>>::iterator begin(){return edge.begin();}
typename std::vector<Edge<T>>::iterator end(){return edge.end();}
typename std::vector<Edge<T>>::const_iterator begin()const{return edge.begin();}
typename std::vector<Edge<T>>::const_iterator end()const{return edge.end();}
};
#include<concepts>
#include<immintrin.h>
struct gf2{
private:
unsigned long long v;
static constexpr unsigned long long table[16]={0,27,45,54,90,65,119,108,175,180,130,153,245,238,216,195};
public:
constexpr gf2():v(){}
template<std::integral T>
constexpr gf2(T x):v(x){}
inline gf2 operator+()const{return *this;}
inline gf2 operator-()const{return *this;}
inline gf2 &operator+=(const gf2&rhs){v^=rhs.v;return *this;}
inline gf2 &operator-=(const gf2&rhs){v^=rhs.v;return *this;}
__attribute__((target("pclmul,sse4.2")))
inline gf2 &operator*=(const gf2&rhs){
__m128i m=_mm_clmulepi64_si128(_mm_set_epi64x(0,v),_mm_set_epi64x(0,rhs.v),0);
unsigned long long high=_mm_extract_epi64(m,1);
unsigned long long low=_mm_extract_epi64(m,0);
v=high^(high<<1);
low^=v^(v<<3);
v=low^table[high>>60];
return *this;
}
inline gf2 &operator/=(const gf2&rhs){return *this*=rhs.inv();}
friend gf2 operator+(const gf2&lhs,const gf2&rhs){return gf2(lhs)+=rhs;}
friend gf2 operator-(const gf2&lhs,const gf2&rhs){return gf2(lhs)-=rhs;}
friend gf2 operator*(const gf2&lhs,const gf2&rhs){return gf2(lhs)*=rhs;}
friend gf2 operator/(const gf2&lhs,const gf2&rhs){return gf2(lhs)/=rhs;}
auto operator<=>(const gf2&)const=default;
gf2 pow(unsigned long long k)const{
gf2 res=1,a=*this;
while(k){
if(k&1)res*=a;
a*=a;
k>>=1;
}
return res;
}
inline gf2 inv()const{return pow(-2);}
unsigned long long val()const{return v;}
friend std::istream &operator>>(std::istream&is,gf2&rhs){is>>rhs.v;return is;}
friend std::ostream &operator<<(std::ostream&os,const gf2&rhs){os<<rhs.v;return os;}
};
#include<type_traits>
namespace Random{
std::mt19937_64 mt(std::random_device{}());
template<typename T>inline std::enable_if_t<std::is_integral_v<T>,T> get(){return mt();}
template<typename T>inline std::enable_if_t<std::is_floating_point_v<T>,T> get(){return T(mt())/T(-1ull);}
template<typename T>inline std::enable_if_t<std::is_integral_v<T>,T>range(T n){return mt()%n;}
template<typename T>inline std::enable_if_t<std::is_integral_v<T>,T>range(T l,T r){return l+mt()%(r-l);}
template<typename T>inline std::enable_if_t<std::is_integral_v<T>,std::pair<T,T>>distinct(T n){
T l=mt()%n,r=mt()%(n-1);
if(l==r)r++;
if(l>r)std::swap(l,r);
return std::make_pair(l,r);
}
}
template<typename T,bool restore=false>
std::conditional_t<restore,std::vector<int>,int>shortest_path(const Graph<T>&g,int s,int t,std::vector<int>vs){
int n=g.size();
int m=g.edge_size();
std::erase_if(vs,[&](int v){return s==v||t==v;});
int k=vs.size();
assert(0<=s&&s<n);
assert(0<=t&&t<n);
assert(k<=24);
assert(!g.is_directed());
std::vector<int>mask(n);
for(int i=0;i<k;i++){
assert(0<=vs[i]&&vs[i]<n);
assert(mask[vs[i]]==0);
mask[vs[i]]=1<<i;
}
std::vector<std::tuple<int,int,gf2>>edges;
for(const Edge<T>&e:g)if(e.from!=e.to){
edges.emplace_back(e.from,e.to,Random::get<unsigned long long>());
}
std::vector<int>res;
std::vector<int>a;
do{
a.clear();
for(auto[u,v,w]:edges){
if(u==s||v==s)a.push_back(s^u^v);
}
std::sort(a.begin(),a.end());
if(s!=t)std::erase_if(edges,[&](const std::tuple<int,int,gf2>&tp){return std::get<0>(tp)==s||std::get<1>(tp)==s;});
std::erase_if(vs,[&](int v){return s==v;});
k=vs.size();
std::fill(mask.begin(),mask.end(),0);
for(int i=0;i<k;i++)mask[vs[i]]=1<<i;
m=edges.size();
std::vector<std::vector<gf2>>dpv(1<<k,std::vector<gf2>(n)),dpe(1<<k,std::vector<gf2>(m*2));
dpv[0][t]=1;
int d=std::numeric_limits<int>::max();
int ns=-1;
for(int i=0;i<n;i++){
for(int a2:a)if(dpv.back()[a2].val()){
ns=a2;
d=i+1;
break;
}
if(ns!=-1){
break;
}
std::vector<std::vector<gf2>>ndpv(1<<k,std::vector<gf2>(n)),ndpe(1<<k,std::vector<gf2>(m*2));
for(int S=0;S<(1<<k);S++){
for(int j=0;j<m;j++){
auto [u,v,w]=edges[j];
if(!(S&mask[v])){
gf2 w1=(dpv[S][u]-dpe[S][j*2+1])*w;
ndpv[S|mask[v]][v]+=w1;
ndpe[S|mask[v]][j*2]+=w1;
}
if(!(S&mask[u])){
gf2 w2=(dpv[S][v]-dpe[S][j*2])*w;
ndpv[S|mask[u]][u]+=w2;
ndpe[S|mask[u]][j*2+1]+=w2;
}
}
}
dpv=std::move(ndpv);
dpe=std::move(ndpe);
}
if constexpr(!restore)return d;
else if(ns==-1)return {};
res.push_back(s);
s=ns;
}while(s!=t);
if constexpr(restore){
res.push_back(t);
return res;
}
else return -1;
}
void SOLVE(){
int n,m;
cin>>n>>m;
int x,y,z;
cin>>x>>y>>z;
x--,y--,z--;
vector<vector<bool>>edge(n,vector<bool>(n));
rep(i,m){
int u,v;
cin>>u>>v;
u--,v--;
edge[u][v]=edge[v][u]=true;
}
Graph g(n,false);
rep(i,n)rep(j,i+1,n)if(!edge[i][j])g.add_edge(i,j);
g.build();
auto ans=shortest_path<int,true>(g,x,x,{x,y,z});
if(ans.empty())fin(-1);
ans++;
cout<<ans.size()-1<<endl;
rep(i,ans.size())cout<<ans[i]<<" \n"[i+1==ans.size()];
}