#486080 (C++17) No.1061 素敵な数列

提出ソース
結果

問題	No.1061 素敵な数列
コンテスト
ユーザー	maroon_kuri
提出日時	2020-05-23 03:09:05
言語	C++17 (gcc 13.3.0 + boost 1.87.0)
結果	AC
実行時間	45 ms / 2,000 ms
コード長	6,162 bytes
コンパイル時間	3,622 ms
コンパイル使用メモリ	212,576 KB
最終ジャッジ日時	2025-01-10 15:13:54
ジャッジサーバーID （参考情報）	judge3 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
sample	AC * 3
other	AC * 33
権限があれば一括ダウンロードができます
ソースコード

raw source code
#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> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}

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;
}

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);
}

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);
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
}
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
}

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;
}

bool check(int n,const vi&p){
	vi pre(n,-1),len(n,-1);
	rep(i,3*n){
		int v=p[i];
		if(pre[v]!=-1){
			int dif=i-pre[v];
			if(len[v]!=-1){
				if(abs(len[v]-dif)!=v)
					return false;
			}
			len[v]=dif;
		}
		pre[v]=i;
	}
	return true;
}

vi waf(int n){
	vi p(3*n);
	rep(i,3*n)p[i]=i/3+1;
	do{
		bool ok=true;
		vi pre(n+1,-1),len(n+1,-1);
		rep(i,3*n){
			int v=p[i];
			if(pre[v]!=-1){
				int dif=i-pre[v];
				if(len[v]!=-1){
					if(abs(len[v]-dif)!=v)
						ok=false;
				}
				len[v]=dif;
			}
			pre[v]=i;
		}
		if(ok){
			return p;
		}
	}while(next_permutation(all(p)));
	return {};
}

vi relka(int n){
	vi p(3*n);
	rep(i,3*n)p[i]=i/3+1;
	do{
		bool ok=true;
		vi pre(n+1,-1),len(n+1,-1);
		vi q(3*n+1);
		rep(i,3*n)q[i]=p[i];
		swap(q[3*n-1],q[3*n]);
		rep(i,3*n+1){
			int v=q[i];
			if(pre[v]!=-1){
				int dif=i-pre[v];
				if(len[v]!=-1){
					if(abs(len[v]-dif)!=v)
						ok=false;
				}
				len[v]=dif;
			}
			pre[v]=i;
		}
		if(ok){
			return q;
		}
	}while(next_permutation(all(p)));
	assert(0);
}

vvc<int> wls{{},{},{1,2,1,1,2,2,},{1,1,3,1,2,2,3,3,2,},{1,1,2,1,3,4,4,2,3,3,2,4,},{1,1,2,1,2,3,4,5,2,3,3,4,4,5,5,},{1,1,2,1,2,3,5,6,2,3,3,4,5,5,6,6,4,4,},};
vvc<int> rls{{},{1,1,0,1,},{2,1,2,1,1,0,2,},{1,2,3,1,2,1,3,3,0,2,},{1,1,2,1,2,3,4,4,2,3,3,0,4,},{1,1,2,1,3,2,3,4,5,5,2,3,4,4,0,5,},{1,1,2,1,2,3,4,6,2,3,3,5,5,4,6,6,4,0,5,},};

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	int n;cin>>n;
	if(n==2){
		print(-1);
		return 0;
	}
	
	int raw=n;
	n--;
	
	vi ans,odd;
	
	auto addodd=[&](vi w){
		if(si(odd)){
			odd[si(odd)-2]=w.back();
			ans.insert(ans.ed,all(odd));
			ans.insert(ans.ed,w.rbegin()+2,w.rend());
			odd.clear();
		}else{
			odd=w;
		}
	};
	
	while(n>6){
		int k=n/2;
		if(n%2==0){
			rng(i,k,2*k+1)ans.pb(i);
			rng(i,k,2*k+1)rep(_,2)ans.pb(i);
			n=k-1;
		}else{
			vi w;
			rng(i,k+1,2*k+2)w.pb(i);
			w.pb(0);
			rng(i,k+1,2*k+2)rep(_,2)w.pb(i);
			swap(w[k+1],w[k*3+2]);
			addodd(w);
			n=k;
		}
	}
	
	if(si(odd)){
		assert(si(rls[n]));
		addodd(rls[n]);
	}else{
		assert(n!=1);
		ans.insert(ans.ed,all(wls[n]));
	}
	
	rep(_,3)ans.pb(0);
	
	assert(check(raw,ans));
	
	print(ans);
}
yukicoder

結果

ソースコード
