QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #533846 | #6131. Tournament | Tomato_Fish# | WA | 1ms | 3868kb | C++14 | 997b | 2024-08-26 15:31:55 | 2024-08-26 15:31:55 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int main()
{
int T;scanf("%d",&T);
while(T--){
int n,K;
scanf("%d%d",&n,&K);
if(n%2==1) printf("Impossible\n");
else if(n%2==0&&n%4==2){
if(K==1){
for(int i=1;i<=n;i++){
if(i%2==1) printf("%d",i+1);
else printf("%d",i-1);
if(i<n) printf(" ");
else printf("\n");
}
}
else printf("Impossible\n");
}
else{
if(K<n){
for(int i=1;i<=K;i++){
for(int j=1;j<=n;j++){
int tmp=(i^(j-1))+1;
printf("%d",tmp);
if(j<n) printf(" ");
else printf("\n");
}
}
}
else printf("Impossible\n");
}
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3868kb
input:
2 3 1 4 3
output:
Impossible 2 1 4 3 3 4 1 2 4 3 2 1
result:
ok 4 lines
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3792kb
input:
100 1 4 2 1 2 2 2 3 3 6 4 2 4 3 4 4 4 5 5 4 6 1 6 2 6 4 7 1 8 3 8 7 8 8 8 14 9 4 10 1 10 2 10 3 12 2 12 3 12 4 12 8 13 2 14 1 14 2 14 4 15 4 16 9 16 15 16 16 16 28 17 6 18 1 18 2 18 4 19 5 20 1 20 3 20 4 20 6 21 1 22 1 22 2 22 3 23 4 24 5 24 7 24 8 24 15 25 3 26 1 26 2 26 3 27 5 28 1 28 3 28 4 28 6 ...
output:
Impossible 2 1 Impossible Impossible Impossible 2 1 4 3 3 4 1 2 2 1 4 3 3 4 1 2 4 3 2 1 Impossible Impossible Impossible 2 1 4 3 6 5 Impossible Impossible Impossible 2 1 4 3 6 5 8 7 3 4 1 2 7 8 5 6 4 3 2 1 8 7 6 5 2 1 4 3 6 5 8 7 3 4 1 2 7 8 5 6 4 3 2 1 8 7 6 5 5 6 7 8 1 2 3 4 6 5 8 7 2 1 4 3 7 8 5 ...
result:
wrong answer 39th lines differ - expected: 'Impossible', found: '2 1 4 3 6 5 8 7 10 9 12 11'