QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#623347#9428. Be PositiveSlinkWA 34ms3660kbC++14785b2024-10-09 11:27:302024-10-09 11:27:52

Judging History

你现在查看的是最新测评结果

  • [2024-10-09 11:27:52]
  • 评测
  • 测评结果:WA
  • 用时:34ms
  • 内存:3660kb
  • [2024-10-09 11:27:30]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define int ll
#define vi vector<int>

const int INF = 1e18 + 5;

bool check(int n) {
    return n - (n & -n);
}


void solve()
{
    int n;
    cin >> n;
    if (n != 2 && !check(n)) {
        cout << "impossible\n";
        return;
    }

    vi a(n);
    for (int i=0; i<n; i++)
        a[i] = i;
    
    swap(a[0], a[1]);
    for (int i=4; i<n; i++) {
        if (!check(i)) {
            swap(a[i], a[i - 1]);
        }
    }

    for (int i=0; i<n; i++) 
        cout << a[i] << ' ';
    cout << '\n';
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3612kb

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: 3548kb

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: 34ms
memory: 3660kb

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)