QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #623953 | #9428. Be Positive | Vamilio | WA | 35ms | 7808kb | C++14 | 636b | 2024-10-09 14:27:59 | 2024-10-09 14:27:59 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+100;
#define gc getchar()
#define rd read()
inline int read(){
int x=0,f=0; char c=gc;
for(;c<'0'||c>'9';c=gc) f|=(c=='-');
for(;c>='0'&&c<='9';c=gc) x=(x<<1)+(x<<3)+(c^48);
return f?-x:x;
}
int n,a[N];
inline int chk(int x){ return (1<<(int)log2(x)==x); }
void solve(){
n=rd; if(n!=2&&chk(n)) return printf("impossible\n"),void();
for(int i=0;i<n;++i) printf("%d ", a[i]); puts("");
}
int main(){
for(int i=0;i<N-100;++i) a[i]=i;
for(int i=1;i<N-100;i*=2) if(i!=2) swap(a[i-1],a[i]);
int T=rd;
while(T--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 2ms
memory: 7808kb
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: 1ms
memory: 7724kb
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: 35ms
memory: 7776kb
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)