Submission #1679798


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define LL long long
LL n;
int u = 0, v = 0;
vector <int> A, B;
int main()
{
    cin >> n; n ++;
    for (int i = 0; (1ll << i) <= n; ++ i)
        if ((1ll << i) & n)
            u ++;
    for (int i = 0; (1ll << (i + 1)) <= n; ++ i)
    {
        if ((1ll << i) & n)
            B.push_back(++ v);
        A.push_back(u + i);
        B.push_back(u + i);
    }
    cout << A.size() + B.size() + u - 1 << endl;
    for (int i = 1; i < u; ++ i) cout << i << " ";
    for (int i = A.size() - 1; ~i; -- i) cout << A[i] << " ";
    for (int i = B.size() - 1; ~i; -- i) cout << B[i] << " ";
}

Submission Info

Submission Time
Task C - Tautonym Puzzle
User AwD
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 658 Byte
Status AC
Exec Time 2 ms
Memory 384 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 1000 / 1000
Status
AC × 2
AC × 32
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
All 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 AC 2 ms 384 KB
00_example_02.txt AC 1 ms 256 KB
01.txt AC 1 ms 256 KB
02.txt AC 1 ms 256 KB
03.txt AC 1 ms 256 KB
04.txt AC 1 ms 256 KB
05.txt AC 1 ms 256 KB
06.txt AC 1 ms 256 KB
07.txt AC 1 ms 256 KB
08.txt AC 1 ms 256 KB
09.txt AC 1 ms 256 KB
10.txt AC 1 ms 256 KB
11.txt AC 1 ms 256 KB
12.txt AC 1 ms 256 KB
13.txt AC 1 ms 256 KB
14.txt AC 1 ms 256 KB
15.txt AC 1 ms 256 KB
16.txt AC 1 ms 256 KB
17.txt AC 1 ms 256 KB
18.txt AC 1 ms 256 KB
19.txt AC 1 ms 256 KB
20.txt AC 1 ms 256 KB
21.txt AC 1 ms 256 KB
22.txt AC 1 ms 256 KB
23.txt AC 1 ms 256 KB
24.txt AC 1 ms 256 KB
25.txt AC 1 ms 256 KB
26.txt AC 1 ms 256 KB
27.txt AC 1 ms 256 KB
28.txt AC 1 ms 256 KB
29.txt AC 1 ms 256 KB
30.txt AC 1 ms 256 KB