QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #676144 | #9428. Be Positive | LianYan | WA | 47ms | 3668kb | C++20 | 645b | 2024-10-25 20:26:40 | 2024-10-25 20:26:40 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{
int n;
cin >> n;
if ((n & (n - 1)) == 0 && n != 2)
{
cout << "impossible" << endl;
return;
}
int a[n + 10] = {0};
for (int i = 0; i < n; i++)
{
a[i] = i;
}
a[0] = 1;
a[1] = 0;
int t = 4;
while (t < n)
{
a[t] = t - 1;
a[t - 1] = t;
t <<= 1;
}
for (int i = 0; i < n; i++)
cout << a[i] << " ";
cout << endl;
}
signed main()
{
int T = 1;
cin >> T;
while (T--)
{
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
input:
4 1 2 3 4
output:
impossible 1 0 1 0 2 impossible
result:
ok 4 test cases (4 test cases)
Test #2:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
10 1 2 3 4 5 6 7 8 9 10
output:
impossible 1 0 1 0 2 impossible 1 0 2 4 3 1 0 2 4 3 5 1 0 2 4 3 5 6 impossible 1 0 2 4 3 5 6 8 7 1 0 2 4 3 5 6 8 7 9
result:
ok 10 test cases (10 test cases)
Test #3:
score: -100
Wrong Answer
time: 47ms
memory: 3552kb
input:
1413 1392 1306 297 726 1353 1059 111 758 1409 843 1013 940 1186 788 60 230 1249 209 776 966 178 25 168 494 70 867 601 195 718 497 1161 323 1054 265 148 388 186 539 760 1184 1230 829 400 460 1253 922 903 42 1347 1368 404 512 1170 378 136 560 1078 612 1201 30 717 934 572 975 255 1131 319 629 264 1240 ...
output:
1 0 2 4 3 5 6 8 7 9 10 11 12 13 14 16 15 17 18 19 20 21 22 23 24 25 26 27 28 29 30 32 31 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 64 63 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 10...
result:
wrong answer xor equals zero (test case 1)