#820690 (C++17) No.1776 Love Triangle 2 (Hard)

提出ソース

結果

問題	No.1776 Love Triangle 2 (Hard)
ユーザー	HIR180
提出日時	2022-11-29 18:10:12
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	8,239 bytes
コンパイル時間	3,214 ms
コンパイル使用メモリ	190,768 KB
実行使用メモリ	7,292 KB
最終ジャッジ日時	2024-10-07 05:49:37
合計ジャッジ時間	10,708 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	6 ms 6,820 KB
testcase_01	AC	6 ms 6,816 KB
testcase_02	AC	6 ms 6,816 KB
testcase_03	AC	6 ms 6,820 KB
testcase_04	AC	52 ms 6,820 KB
testcase_05	AC	94 ms 6,896 KB
testcase_06	AC	93 ms 6,820 KB
testcase_07	AC	37 ms 6,824 KB
testcase_08	AC	64 ms 6,820 KB
testcase_09	AC	8 ms 6,820 KB
testcase_10	WA	-
testcase_11	AC	8 ms 6,820 KB
testcase_12	WA	-
testcase_13	WA	-
testcase_14	WA	-
testcase_15	AC	8 ms 7,008 KB
testcase_16	AC	8 ms 6,820 KB
testcase_17	AC	8 ms 6,820 KB
testcase_18	AC	9 ms 6,820 KB
testcase_19	AC	8 ms 6,820 KB
testcase_20	AC	8 ms 6,820 KB
testcase_21	AC	8 ms 6,816 KB
testcase_22	WA	-
testcase_23	AC	7 ms 6,816 KB
testcase_24	AC	8 ms 6,816 KB
testcase_25	WA	-
testcase_26	AC	7 ms 7,024 KB
testcase_27	AC	7 ms 6,816 KB
testcase_28	AC	9 ms 6,820 KB
testcase_29	WA	-
testcase_30	AC	11 ms 6,820 KB
testcase_31	AC	11 ms 6,816 KB
testcase_32	AC	12 ms 6,816 KB
testcase_33	AC	14 ms 6,820 KB
testcase_34	AC	12 ms 6,816 KB
testcase_35	AC	12 ms 6,816 KB
testcase_36	AC	12 ms 6,820 KB
testcase_37	AC	10 ms 6,820 KB
testcase_38	AC	9 ms 6,820 KB
testcase_39	AC	8 ms 6,820 KB
testcase_40	AC	12 ms 6,816 KB
testcase_41	AC	12 ms 6,820 KB
testcase_42	AC	11 ms 6,904 KB
testcase_43	AC	10 ms 6,820 KB
testcase_44	AC	10 ms 6,820 KB
testcase_45	AC	13 ms 6,820 KB
testcase_46	AC	9 ms 6,820 KB
testcase_47	AC	7 ms 6,896 KB
testcase_48	AC	8 ms 6,820 KB
testcase_49	AC	6 ms 6,820 KB
testcase_50	AC	9 ms 6,816 KB
testcase_51	WA	-
testcase_52	WA	-
testcase_53	WA	-
testcase_54	WA	-
testcase_55	WA	-
testcase_56	WA	-
testcase_57	WA	-
testcase_58	WA	-
testcase_59	WA	-
testcase_60	AC	9 ms 6,816 KB
testcase_61	AC	10 ms 6,820 KB
testcase_62	AC	9 ms 6,816 KB
testcase_63	AC	8 ms 7,012 KB
testcase_64	AC	9 ms 6,820 KB
testcase_65	AC	7 ms 6,900 KB
testcase_66	AC	8 ms 6,820 KB
testcase_67	AC	7 ms 6,824 KB
testcase_68	WA	-
testcase_69	AC	173 ms 6,816 KB
testcase_70	AC	314 ms 7,140 KB
testcase_71	AC	309 ms 6,820 KB
testcase_72	AC	115 ms 6,912 KB
testcase_73	AC	210 ms 6,816 KB
testcase_74	AC	10 ms 6,816 KB
testcase_75	AC	9 ms 6,816 KB
testcase_76	AC	9 ms 6,820 KB
testcase_77	WA	-
testcase_78	AC	9 ms 6,820 KB
testcase_79	AC	9 ms 6,816 KB
testcase_80	AC	10 ms 6,824 KB
testcase_81	AC	10 ms 6,820 KB
testcase_82	AC	10 ms 6,820 KB
testcase_83	AC	13 ms 7,080 KB
testcase_84	AC	10 ms 6,820 KB
testcase_85	AC	9 ms 6,816 KB
testcase_86	AC	10 ms 6,816 KB
testcase_87	AC	10 ms 6,816 KB
testcase_88	AC	10 ms 6,820 KB
testcase_89	WA	-
testcase_90	WA	-
testcase_91	AC	9 ms 6,820 KB
testcase_92	AC	9 ms 6,816 KB
testcase_93	AC	9 ms 6,820 KB
testcase_94	WA	-
testcase_95	AC	15 ms 6,820 KB
testcase_96	AC	22 ms 6,820 KB
testcase_97	AC	26 ms 6,820 KB
testcase_98	AC	27 ms 6,820 KB
testcase_99	AC	25 ms 6,816 KB
testcase_100	AC	21 ms 6,820 KB
testcase_101	AC	19 ms 6,816 KB
testcase_102	AC	17 ms 6,908 KB
testcase_103	AC	11 ms 6,820 KB
testcase_104	AC	12 ms 6,820 KB
testcase_105	AC	15 ms 6,820 KB
testcase_106	AC	19 ms 6,820 KB
testcase_107	AC	12 ms 6,816 KB
testcase_108	WA	-
testcase_109	AC	13 ms 6,816 KB
testcase_110	AC	11 ms 6,820 KB
testcase_111	AC	11 ms 6,820 KB
testcase_112	AC	10 ms 6,816 KB
testcase_113	AC	10 ms 6,820 KB
testcase_114	WA	-
testcase_115	WA	-
testcase_116	WA	-
testcase_117	WA	-
testcase_118	WA	-
testcase_119	WA	-
testcase_120	WA	-
testcase_121	WA	-
testcase_122	WA	-
testcase_123	WA	-
testcase_124	AC	13 ms 6,824 KB
testcase_125	AC	13 ms 6,820 KB
testcase_126	AC	15 ms 6,820 KB
testcase_127	AC	12 ms 6,816 KB
testcase_128	AC	11 ms 6,816 KB
testcase_129	AC	12 ms 6,816 KB
testcase_130	AC	11 ms 6,820 KB
testcase_131	WA	-
testcase_132	WA	-
testcase_133	AC	10 ms 6,908 KB
testcase_134	WA	-
testcase_135	WA	-
testcase_136	WA	-
testcase_137	WA	-
testcase_138	WA	-
testcase_139	WA	-
testcase_140	WA	-
testcase_141	WA	-
testcase_142	WA	-
testcase_143	WA	-
testcase_144	WA	-
testcase_145	WA	-
testcase_146	WA	-
testcase_147	WA	-
testcase_148	WA	-
testcase_149	WA	-
testcase_150	WA	-
testcase_151	WA	-
testcase_152	WA	-
testcase_153	WA	-
testcase_154	WA	-
testcase_155	WA	-
testcase_156	WA	-
testcase_157	WA	-
testcase_158	WA	-
testcase_159	WA	-
testcase_160	WA	-
testcase_161	WA	-
testcase_162	WA	-
testcase_163	WA	-
testcase_164	WA	-
testcase_165	WA	-
testcase_166	WA	-
testcase_167	WA	-
testcase_168	WA	-
testcase_169	WA	-
testcase_170	WA	-
testcase_171	WA	-
testcase_172	WA	-
testcase_173	WA	-
testcase_174	WA	-
testcase_175	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

//Let's join Kaede Takagaki Fan Club !!
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
//#include <unordered_map>
//#include <unordered_set>
#include <cassert>
#include <iomanip>
#include <chrono>
#include <random>
#include <bitset>
#include <complex>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#include <atcoder/convolution>
//#include <atcoder/lazysegtree>
//#include <atcoder/maxflow>
//#include <atcoder/mincostflow>
//#include <atcoder/segtree>
//#include <atcoder/string>
using namespace std;
//using namespace atcoder;
//#define int long long
//#define L __int128
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define a first
#define b second
#define fi first
#define sc second
#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
#define pcnt(x) __builtin_popcountll(x)

#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,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.fi<<","<<p.sc<<"}";
}
 
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}
 
 //https://codeforces.com/blog/entry/62393
struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		// http://xorshift.di.unimi.it/splitmix64.c
		x += 0x9e3779b97f4a7c15;
		x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
		x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
		return x ^ (x >> 31);
	}
 
	size_t operator()(uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
		return splitmix64(x + FIXED_RANDOM);
	}
	//don't make x negative!
	size_t operator()(pair<int,int> x)const{
		return operator()(uint64_t(x.first)<<32|x.second);
	}
};
//unordered_set -> dtype, null_type
//unordered_map -> dtype(key), dtype(value)
using namespace __gnu_pbds;
template<class t,class u>
using hash_table=gp_hash_table<t,u,custom_hash>;

template<class T>
void o(const T &a,bool space=false){
	cout << a << (space?' ':'\n');
}
//ios::sync_with_stdio(false);
const ll mod = 998244353;
//const ll mod = 1000000007;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());

struct modular{
	ll v;
	modular(ll vv=0){s(vv%mod+mod);}
	modular& s(ll vv){
		v=vv<mod?vv:vv-mod;
		return *this;
	}
	modular operator-()const{return modular()-*this;}
	modular &operator+=(const modular&rhs){return s(v+rhs.v);}
	modular &operator-=(const modular&rhs){return s(v+mod-rhs.v);}
	modular &operator*=(const modular&rhs){v=ll(v)*rhs.v%mod;return *this;}
	modular &operator/=(const modular&rhs){return *this*=rhs.inv();}
	modular operator+(const modular&rhs)const{return modular(*this)+=rhs;}
	modular operator-(const modular&rhs)const{return modular(*this)-=rhs;}
	modular operator*(const modular&rhs)const{return modular(*this)*=rhs;}
	modular operator/(const modular&rhs)const{return modular(*this)/=rhs;}
	modular pow(ll n)const{
		if(n<0)return inv().pow(-n);
		modular res(1),x(*this);
		while(n){
			if(n&1)res*=x;
			x*=x;
			n>>=1;
		}
		return res;
	}
	modular inv()const{return pow(mod-2);}
	friend modular operator+(ll x,const modular&y){
		return modular(x)+y;
	}
	friend modular operator-(ll x,const modular&y){
		return modular(x)-y;
	}
	friend modular operator*(ll x,const modular&y){
		return modular(x)*y;
	}
	friend modular operator/(ll x,const modular&y){
		return modular(x)/y;
	}
	friend ostream& operator<<(ostream&os,const modular&m){
		return os<<m.v;
	}
	friend istream& operator>>(istream&is,modular&m){
		ll x;is>>x;
		m=modular(x);
		return is;
	}
	bool operator<(const modular&r)const{return v<r.v;}
	bool operator==(const modular&r)const{return v==r.v;}
	bool operator!=(const modular&r)const{return v!=r.v;}
	explicit operator bool()const{
		return v;
	}
};
ll modpow(ll x,ll n){
	ll res=1;
	while(n>0){
		if(n&1) res=res*x%mod;
		x=x*x%mod;
		n>>=1;
	}
	return res;
}
#define _sz 1
modular F[_sz],R[_sz];
void make(){
	F[0] = 1;
	for(int i=1;i<_sz;i++) F[i] = F[i-1] * i;
	R[_sz-1] = F[_sz-1].pow(mod-2);
	for(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1);
}
modular C(int a,int b){
	if(b < 0 || a < b) return modular();
	return F[a]*R[b]*R[a-b];
}
/*int dst(P p, P q){
	return (p.a-q.a)*(p.a-q.a)+(p.b-q.b)*(p.b-q.b);
}*/
/*template<class t>
void add_inplace(t &a, t b){
	if(a.size() < b.size()) swap(a, b);
	for(int i=0;i<b.size();i++){
		a[i] += b[i];
		if(a[i] < 0) a[i] += mod;
		if(a[i] >= mod) a[i] -= mod;
	}
	return ;
}*/
/*template<class t>
void ov(const vc<t>&a){
	if(a.empty()) return;
	rep(i, a.size()) cout << a[i] << (i+1==a.size()?'\n':' ');
}*/
//o(ans?"Yes":"No");

using ull=unsigned;// long long;

ull _sm[256][256];
template<bool is_pre = false>
ull nim_product(ull a, ull b, int k = 16){
	if(min(a, b) <= 1) return a*b;
	if(!is_pre and k <= 8) return _sm[a][b];
	k >>= 1;
	
	ull au = (a>>k), al = a & (((ull)1<<k)-1);
	ull bu = (b>>k), bl = b & (((ull)1<<k)-1);
	
	ull go1 = nim_product<is_pre>(au, bu, k);
	ull go2 = nim_product<is_pre>(al, bl, k);
	ull go3 = nim_product<is_pre>(au^al, bu^bl, k);
	
	return ((go2^go3)<<k)^nim_product(go1, ((ull)1<<(k-1)), k)^go2;
}
//put this into main function
void init_np(){
	rep(a,256)rep(b,256) _sm[a][b]=nim_product<true>(a,b,8);
}
constexpr int NL=150;
ull dp[3*NL+5][NL+5][4], cs[NL+5][NL+5];
P pr[3*NL+5][NL+5][4];
int n,m,x,y,z;
bool bad[NL+5][NL+5];

void solve(){
	cin>>n>>m;
	cin>>x>>y>>z; x--;y--;z--;
	rep(i,n)bad[i][i]=true;
	rep(i,m){
		int a,b;cin>>a>>b;
		a--;b--;
		bad[a][b]=bad[b][a]=true;
	}
	rep(i, n) rep(j, i) if(!bad[i][j]){
		cs[i][j] = cs[j][i] = mt()>>48;
	}
	dp[x][1][0] = 1;
	rep(state, 3*n) repn(len, n) rep(mask, 4) pr[state][len][mask] = mp(-1, -1);
	
	repn(len, n){
		rep(state, 3*n){
			rep(mask, 4){
				if(dp[state][len][mask] == 0) continue;
				
				int pre=-1, now=state;
				if(state>=n){
					pre=state%n;
					if(state/n==1)now=y;
					else now=z;
				}
				rep(nxt, n){
					if(pre == nxt or nxt == x or bad[now][nxt]) continue;
					if(nxt == y and (mask&1)) continue;
					if(nxt == z and (mask&2)) continue;
					
					int nstate = nxt, nmask = mask;
					if(nxt == y) nstate = n+now, nmask|=1;
					else if(nxt == z) nstate = n+n+now, nmask|=2;
					dp[nstate][len+1][nmask] ^= nim_product(dp[state][len][mask], cs[now][nxt]);
					auto &pp = pr[nstate][len+1][nmask];
					if(pp.a < 0) pp = mp(state, mask);
					else{
						int nxt = pp.a; if(nxt/n==1)nxt=y; else if(nxt/n==2)nxt=z;
						int nxt2 = state; if(nxt2/n==1)nxt2=y; else if(nxt2/n==2)nxt2=z;
						if(nxt > nxt2) pp = mp(state, mask);
						else if(nxt == nxt2 and pp.a > state) pp = mp(state, mask);
					}
				}
			}
		}
		rep(now, n){
			if(bad[now][x]) continue;
			if(dp[now][len][3]){
				o(len);
				vc<int>ans{x, now};
				int M=3;
				while(1){
					if(now == x) break;
					auto &pp = pr[now][len][M];
					now=pp.a; len--; M=pp.b;
					if(now/n==1) ans.pb(y);
					else if(now/n==2) ans.pb(z);
					else ans.pb(now);
				}
				rep(i, si(ans)) cout << ++ans[i] << (i+1==si(ans)?'\n':' ');
				return;
			}
		}
	}
	o(-1);
}
signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	init_np();
	int t; t=1;//cin >> t;
	while(t--) solve();
}

yukicoder

結果

テストケース

ソースコード