Submission #1201734
Source Code Expand
//#pragma GCC optimize("O3") #include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = (int) 1e5 + 5; const int mod = (int) 1e9 + 7; deque<int> d; void construct (ll x) { if (x == 1) { return; } if (x & 1) { construct (x - 1); d.push_front (d.size () + 1); } else { construct (x >> 1); d.push_back (d.size () + 1); } } ll n; inline void solve () { scanf ("%lld", &n); n++; construct (n); printf ("%d\n", d.size () + d.size ()); for (int i : d) { printf ("%d ", i); } for (int i = 1; i <= d.size (); i++) { printf ("%d ", i); } puts (""); } int tests = 1; int main () { // freopen (".in", "r", stdin); // freopen (".out", "w", stdout); // scanf ("%d", &tests); while (tests--) { solve (); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Tautonym Puzzle |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1012 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Compile Error
./Main.cpp: In function ‘void solve()’: ./Main.cpp:31:46: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘std::deque<int>::size_type {aka long unsigned int}’ [-Wformat=] printf ("%d\n", d.size () + d.size ()); ^ ./Main.cpp:29:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf ("%lld", &n); 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 |