Submission #1810392


Source Code Expand

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <bitset>
#include <string>
#include <cmath>
#include <set>
#include <deque>
#define Rep(i, x, y) for (int i = x; i <= y; i ++)
#define Dwn(i, x, y) for (int i = x; i >= y; i --)
#define RepE(i, x) for (int i = pos[x]; i; i = g[i].nex)
#define ev g[i].y
#define eps 1e-10
#define pb push_back
#define pf push_front
using namespace std;
typedef long long ll;
typedef double db;
const int N = 100005, mod = 1000000007;
ll n;
int m;
deque<int> a, b;
void work(ll x) {
	if (!x) return ;
	work(x / 2);
	++ m;
	a.pb(m), b.pb(m);
	if ((x & 1) && x > 1) {
		++ m;
		a.pb(m), b.pf(m);
	}
}
int main()
{
	scanf ("%lld", &n);
	work(n + 1);
	printf("%d\n", m * 2);
	Rep(i, 0, m - 1) printf("%d ", a[i]);
	Rep(i, 0, m - 1) printf("%d ", b[i]);

	return 0;
}

Submission Info

Submission Time
Task C - Tautonym Puzzle
User hzt1
Language C++14 (GCC 5.4.1)
Score 0
Code Size 909 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:38:20: 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 0 / 1000
Status
WA × 2
WA × 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 WA 1 ms 256 KB
00_example_02.txt WA 1 ms 256 KB
01.txt WA 1 ms 256 KB
02.txt WA 1 ms 256 KB
03.txt WA 1 ms 256 KB
04.txt WA 1 ms 256 KB
05.txt WA 1 ms 256 KB
06.txt WA 1 ms 256 KB
07.txt WA 1 ms 256 KB
08.txt WA 1 ms 256 KB
09.txt WA 1 ms 256 KB
10.txt WA 1 ms 256 KB
11.txt WA 1 ms 256 KB
12.txt WA 1 ms 256 KB
13.txt WA 1 ms 256 KB
14.txt WA 1 ms 256 KB
15.txt WA 1 ms 256 KB
16.txt WA 1 ms 256 KB
17.txt WA 1 ms 256 KB
18.txt WA 1 ms 256 KB
19.txt WA 1 ms 256 KB
20.txt WA 1 ms 256 KB
21.txt WA 1 ms 256 KB
22.txt WA 1 ms 256 KB
23.txt WA 1 ms 256 KB
24.txt WA 1 ms 256 KB
25.txt WA 1 ms 256 KB
26.txt WA 1 ms 256 KB
27.txt WA 1 ms 256 KB
28.txt WA 1 ms 256 KB
29.txt WA 1 ms 256 KB
30.txt WA 1 ms 256 KB