QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#720557#9428. Be PositiveAlasco#WA 0ms3692kbC++14879b2024-11-07 13:16:382024-11-07 13:16:38

Judging History

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

  • [2024-11-07 13:16:38]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3692kb
  • [2024-11-07 13:16:38]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int n,a[104],ans[1000005];
void __(){
    cin>>n;
    for(int i=0;i<=23;i++){
        a[i]=0;
    }
    for(int i=0;i<n;i++){
        for(int j=0;j<=20;j++){
            if((1<<j)&i){
                a[j]++;
            }
        }
    }
    bool fl=0;
    for(int i=0;i<=20;i++){
        if(a[i]&1){
            fl=1;
            break;
        }
    }
    if(!fl){
        cout<<"impossible\n";return;
    }
    int now=0;
    for(int i=0;i<n;i++){
        if((now^i)==0){
            ans[i]=i+1;
            ans[i+1]=i;
            i++;
        }else{
            ans[i]=i;
        }
    }
    for(int i=0;i<n;i++){
        cout<<ans[i]<<" ";
    }
    cout<<"\n";
}
signed main(){
    ios::sync_with_stdio(false),cin.tie(nullptr);
    int _;cin>>_;while(_--)__();
}

詳細信息

Test #1:

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

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: -100
Wrong Answer
time: 0ms
memory: 3596kb

input:

10
1
2
3
4
5
6
7
8
9
10

output:

impossible
1 0 
1 0 2 
impossible
1 0 2 3 4 
1 0 2 3 4 5 
1 0 2 3 4 5 6 
impossible
1 0 2 3 4 5 6 7 8 
1 0 2 3 4 5 6 7 8 9 

result:

wrong answer xor equals zero (test case 5)