Submission #1195530

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#include <random>
#include <cassert>
using namespace std;

#define rep(i, N) for (int i = 0; i < N; i++)
#define pb push_back

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<int, ll> i_ll;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int v; ll w; };

const int MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int INF = INT_MAX / 2;

int main() {
	ll x; cin >> x; x++;
	vector<int> v;
	int k = 0;
	vector<int> unko;
	while (x > 1) {
		if (x % 2 == 0) x /= 2, unko.pb(+1);
		else x--, unko.pb(-1);
	}
	reverse(unko.begin(), unko.end());
	for (int z: unko) {
		if (z == +1) v.pb(k);
		if (z == -1) v.insert(v.begin(), k);
		k++;
	}
	cout << v.size() * 2 << endl;
	rep(k, v.size()) cout << k + 1 << ' ';
	for (int k: v) cout << k + 1 << ' ';
	cout << endl;
}

Submission Info

Judge Result