Submission #1198535

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

using pii = pair<int,int>;
using ll = long long;
#define rep(i, j) for(int i=0; i < (int)(j); i++)
#define repeat(i, j, k) for(int i = (j); i < (int)(k); i++)
#define all(v) v.begin(),v.end()
#define debug(x) cerr << #x << " : " << x << endl

template<class T> bool set_min(T &a, const T &b) { return a > b  ? a = b, true : false; }
template<class T> bool set_max(T &a, const T &b) { return a < b  ? a = b, true : false; }
// vector
template<class T> istream& operator >> (istream &is , vector<T> &v) { for(T &a : v) is >> a; return is; }
template<class T> ostream& operator << (ostream &os , const vector<T> &v) { for(const T &t : v) os << "\t" << t; return os << endl; }
// pair
template<class T, class U> ostream& operator << (ostream &os , const pair<T, U> &v) { return os << "<" << v.first << ", " << v.second << ">"; }

const int INF = 1 << 30;
const ll INFL = 1LL << 60;


class Solver {
  public:
    bool solve() {
        ll N; cin >> N;
        int len = ceil(log2(N)) + 1;
        vector<int> ans;
        rep(i, len) ans.push_back(i + 1);

        N += 1;
        stack<int> pos;        
        for(int i = len; i >= 0; i--) {
            if(N & (1 << i)) pos.push(i);
        }
        {
            int n = len + pos.size();
            for(int i = 0; not pos.empty(); i++) {
                ans.insert(ans.begin() + pos.top() + i + 1, n++);
                pos.pop();
            }
        }
        rep(i, len) ans.push_back(i + 1);
        cout << ans.size() << endl;
        rep(i, ans.size()) cout << ans[i] << (i == ans.size() - 1 ? "\n" : " ");
        return 0;
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    Solver s;
    s.solve();
    return 0;
}

Submission Info

Judge Result