Submission #1195765

---

Source Code Expand

#include<bits/stdc++.h>
 
using namespace std;
 
#define pb push_back
#define mp make_pair
#define F first
#define S second
 
#define fo(i, n) for(int i = 1; i <= n; ++i)
#define rep(i, a, b) for(int (i) = (a); (i) < (b); ++(i))
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
 
const int N = 200200;
const int mod = 1e9 + 7;
const ll INF = 1e18;
 
 
int main()
{
	ios::sync_with_stdio(0); cin.tie(0);
	ll n;
	cin>>n;
	if(n==1)
	{
		cout<<"2\n1 1";
		return 0;
	}
	ll nc=n;
	ll step=0;
	while(nc)
	{
		nc>>=1;
		step++;
	}	
	step--;
	vector<int> a;
	for(int i=1;i<=step;++i)
		a.pb(i);
	for(int i=1;i<=step;++i)
		a.pb(i);
	a.pb(step+1);
	a.pb(step+1);
	int sz=step+1;
	for(int i=step-1;i>=1;--i)
	{
		vector<int>b;
		if((n >> i)&1)
		{
			sz++;
			int f=1;
			for(int j=0;j<a.size();++j)
			{
				b.pb(a[j]);
				if(a[j]==i&&f)
					f--,b.pb(sz);
			}
			b.pb(sz);
			a=b;
			b.clear();
			b.shrink_to_fit();
		}
	}
	if(n%2==1)
		a.pb(sz+1),a.pb(sz+1);
	cout<<a.size()<<"\n";
	for(int x:a)
		cout<<x<<' ';
	return 0;	
}

Submission Info

Judge Result