結果
問題 | No.2719 Equal Inner Products in Permutation |
ユーザー |
|
提出日時 | 2024-04-05 22:22:54 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 83 ms / 2,000 ms |
コード長 | 3,407 bytes |
コンパイル時間 | 4,827 ms |
コンパイル使用メモリ | 263,520 KB |
最終ジャッジ日時 | 2025-02-20 21:39:06 |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 30 |
ソースコード
#include<bits/stdc++.h>#include<atcoder/all>using namespace std;using namespace atcoder;typedef long long int ll;typedef long double ld;typedef vector<ll> vi;typedef vector<vi> vvi;typedef vector<vvi> vvvi;typedef vector<vvvi> vvvvi;typedef vector<bool> vb;typedef vector<vb> vvb;typedef vector<vvb> vvvb;typedef vector<vvvb> vvvvb;typedef pair<ll,ll> pi;typedef pair<ll,pi> ppi;typedef pair<ll,ppi> pppi;typedef pair<ll,pppi> ppppi;#define FOR(i,l,r) for(ll i=l;i<r;i++)#define REP(i,n) FOR(i,0,n)#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)#define RREP(i,n) RFOR(i,0,n)#define ALL(x) x.begin(),x.end()#define F first#define S second#define BS(A,x) binary_search(ALL(A),x)#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())#define COU(A,x) (UB(A,x)-LB(A,x))#define sz(c) ((ll)(c).size())/*#include<boost/multiprecision/cpp_int.hpp>namespace mp=boost::multiprecision;using Bint=mp::cpp_int;*/template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}template<typename T>ostream&operator<<(ostream&os,vector<T>v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}vi fast_mod_convolution(vi&a,vi&b,ll mod){const ll m1=167772161,m2=469762049,m3=1224736769;const ll m1_inv_m2=inv_mod(m1,m2);const ll m12_inv_m3=inv_mod(m1*m2,m3);const ll m12_mod=m1*m2%mod;auto x=convolution<m1>(a,b);auto y=convolution<m2>(a,b);auto z=convolution<m3>(a,b);vector<ll>ret(sz(a)+sz(b)-1);REP(i,sz(ret)){ll v1=(y[i]-x[i])*m1_inv_m2%m2;if(v1<0)v1+=m2;ll v2=(z[i]-(x[i]+m1*v1)%m3)*m12_inv_m3%m3;if(v2<0)v2+=m3;ret[i]=(x[i]+m1*v1+m12_mod*v2)%mod;}return ret;}const ld EPS=1e-8;//*using mint=modint998244353;const ll mod=998244353;//*//*using mint=modint1000000007;const ll mod=1000000007;//*///using mint=modint;//*typedef vector<mint> vm;typedef vector<vm> vvm;typedef vector<vvm> vvvm;typedef vector<vvvm> vvvvm;ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}//*/int main(){ll N;cin>>N;if(N==1){cout<<-1<<endl;return 0;}vi ans(3*N);REP(i,N)ans[N+i]=3*i+3,ans[i]=3*i+1,ans[i+2*N]=3*i+2;if(N%4==0){REP(i,N/2)swap(ans[i+N/4],ans[i+N/4+2*N]);}else if(N%4==3){swap(ans[2],ans[2+2*N]);REP(i,(N-3)/2)swap(ans[i+N/4+3],ans[i+N/4+2*N+3]);}else if(N%4==1){ans[3]=8;ans[4]=14;ans[2*N+1]=10;ans[2*N+2]=11;ans[2*N+3]=13;ans[2*N+4]=5;REP(i,(N-5)/2)swap(ans[i+(N-5)/4+5],ans[i+(N-5)/4+2*N+5]);}else{ans[1]=4;ans[2*N]=5;ans[2*N+1]=2;REP(i,(N-2)/2)swap(ans[i+N/4+2],ans[i+2*N+N/4+2]);}ll s=0;REP(i,N)s+=ans[i+N]*(ans[i]-ans[i+2*N]);assert(!s);{auto A=ans;sort(ALL(A));REP(i,3*N-1)assert(A[i+1]!=A[i]);}cout<<ans<<endl;return 0;}