Submission #1201455
Source Code Expand
/**
* author: [itmo] enot.1.10
* created: 03.04.2017 20:33:55
**/
#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define forn(i, n) for(int i = 0 ; (i) < (n) ; ++i)
#define eprintf(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(),a.end()
#define pw(x) (1LL<<(x))
using namespace std;
typedef long long ll;
typedef double dbl;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = 1.01e9;
const dbl eps = 1e-9;
/* --- main part --- */
const int N = 222;
int a[N];
int main()
{
#ifdef home
assert(freopen("1.in", "r", stdin));
assert(freopen("1.out", "w", stdout));
#endif
ll n;
scanf("%lld", &n);
/*if (n <= 100)
{
printf("%lld\n", 2 * n);
forn(i, n) printf("%d %d%c", i + 1, i + 1, " \n"[i + 1 == n]);
return 0;
} */
int last = 0;
vi res;
vi path;
while (n > 0)
{
if (n & 1)
{
path.pb(2);
n >>= 1;
}
else
{
path.pb(1);
n -= 1;
}
}
reverse(all(path));
for (int x : path)
{
if (x == 1)
{
res.insert(res.begin(), ++last);
}
else
{
res.push_back(++last);
}
}
printf("%d\n", 2 * last);
forn(i, last) printf("%d ", i + 1);
forn(i, last) printf("%d%c", res[i], " \n"[i + 1 == last]);
#ifdef home
eprintf("time = %d ms\n", (int)(clock() * 1000. / CLOCKS_PER_SEC));
#endif
return 0;
}
Submission Info
Submission Time
2017-04-04 02:45:33+0900
Task
C - Tautonym Puzzle
User
enot
Language
C++14 (GCC 5.4.1)
Score
1000
Code Size
1763 Byte
Status
AC
Exec Time
1 ms
Memory
256 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:43:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", &n);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
1000 / 1000
Status
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
1 ms
256 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