Submission #19184892

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define x first
#define y second
#define bg begin()
#define ed end()
#define pb push_back
#define mp make_pair
#define sz(a) int((a).size())
#define R(i,n) for(int i(0);i<(n);++i)
#define L(i,n) for(int i((n)-1);i>=0;--i)
const int iinf=0x3f3f3f3f;
const ll linf=0x3f3f3f3f3f3f3f3f;

//Data
ll n;

//mylist
int l_n;
struct mylist{
    int x; mylist *l,*r;
    mylist(int x):x(x),l(NULL),r(NULL){}
}*be,*en;

//Function
void solve(ll n){
    if(n==1) be=en=new mylist(l_n++);
    else if(n&1) solve(n>>1),en->r=new mylist(l_n++),en->r->l=en,en=en->r;
    else solve(n-1),be->l=new mylist(l_n++),be->l->r=be,be=be->l;
}

//Main
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    cin>>n,solve(n);
    cout<<l_n+100<<'\n';
    for(mylist* i=be;i;i=i->r) cout<<i->x+1<<' ';
    R(i,100) cout<<i+1<<' ';
    cout<<'\n';
    return 0;
}

Submission Info

Judge Result