Contest Duration: ~ (local time) (110 minutes) Back to Home

Submission #5174158

Source Code Expand

Copy
```#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define REP(i,n) for (ll i = 0; i < n; i++)
#define REPR(i,n) for (ll i = n-1; i >= 0; i--)
#define FOR(i,m,n) for (ll i = m; i < n; i++)
#define FORE(x,xs) for (const auto& x : xs)
#define ALL(x) x.begin(), x.end()

ll N;

vi solve(ll n) {
vi p;
int k = 1;
while ((1ll<<(k+1)) < n+2) k++;
ll pattern = (1ll<<k) - 1;
cerr << "pattern : " << pattern << endl;
REP (i, k) p.push_back(i+1);

REP (i, p.size()) {
cerr << p[i] << " ";
}
cerr << endl;
while (n-pattern) {
int kk = k;
while ((1ll<<kk) > n-pattern) kk--;
cerr << "kk : " << kk << endl;
pattern += (1ll<<kk);
p.insert(p.begin()+kk, k+1);
k++;
}

REP (i, p.size()) {
cerr << p[i] << " ";
}
cerr << endl;
return p;
}

int main() {
cin >> N;
vi p = solve(N);
FORE (x, p) cout << x << " ";
REP (x, p.size()) cout << x+1 << ((x == p.size()-1)?"\n":" ");
}```

#### Submission Info

Submission Time 2019-04-28 17:18:01+0900 C - Tautonym Puzzle tnyo43 C++14 (GCC 5.4.1) 0 1122 Byte WA 1 ms 256 KB

#### Judge Result

Set Name Score / Max Score Test Cases
Sample 0 / 0 00_example_01.txt, 00_example_02.txt
All 0 / 1000 00_example_01.txt, 00_example_02.txt, 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt
Case Name Status Exec Time Memory
00_example_01.txt 1 ms 256 KB
00_example_02.txt 1 ms 256 KB
01.txt 1 ms 256 KB
02.txt 1 ms 256 KB
03.txt 1 ms 256 KB
04.txt 1 ms 256 KB
05.txt 1 ms 256 KB
06.txt 1 ms 256 KB
07.txt 1 ms 256 KB
08.txt 1 ms 256 KB
09.txt 1 ms 256 KB
10.txt 1 ms 256 KB
11.txt 1 ms 256 KB
12.txt 1 ms 256 KB
13.txt 1 ms 256 KB
14.txt 1 ms 256 KB
15.txt 1 ms 256 KB
16.txt 1 ms 256 KB
17.txt 1 ms 256 KB
18.txt 1 ms 256 KB
19.txt 1 ms 256 KB
20.txt 1 ms 256 KB
21.txt 1 ms 256 KB
22.txt 1 ms 256 KB
23.txt 1 ms 256 KB
24.txt 1 ms 256 KB
25.txt 1 ms 256 KB
26.txt 1 ms 256 KB
27.txt 1 ms 256 KB
28.txt 1 ms 256 KB
29.txt 1 ms 256 KB
30.txt 1 ms 256 KB