QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #561686 | #1830. AND | ydzr00000 | WA | 9ms | 3956kb | C++17 | 501b | 2024-09-13 08:21:20 | 2024-09-13 08:21:20 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int b[100001];
inline void solve()
{
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&b[i]);
int minn=1048576;
for(int i=1;i<=n;i++)
minn=min(minn,b[i]);
for(int i=1;i<=n;i++)
if((minn&b[i])!=minn)
{
puts("-1");
return;
}
printf("%d\n",2*n-1);
for(int i=1;i<=2*n-1;i++)
printf("%d ",(i&1?minn:b[i/2+1]));
puts("");
}
int main(){
int t;
scanf("%d",&t);
while(t--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3956kb
input:
3 1 5 3 0 1 2 2 1 2
output:
1 5 5 0 1 0 2 0 -1
result:
ok answer is correct (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 9ms
memory: 3772kb
input:
20000 5 16 13 5 15 20 5 11 0 13 2 17 5 13 12 8 10 18 5 1 8 16 19 5 5 9 12 3 10 13 5 7 0 14 3 16 5 10 3 9 11 6 5 1 0 4 18 14 5 1 10 5 9 12 5 10 18 16 20 17 5 7 8 19 6 1 5 18 7 4 5 12 5 17 4 6 11 7 5 1 0 12 2 15 5 0 15 7 5 4 5 16 3 4 10 14 5 16 0 2 18 14 5 0 16 20 5 3 5 8 9 10 4 6 5 19 2 12 20 13 5 16...
output:
-1 9 0 0 0 13 0 2 0 17 0 -1 -1 -1 9 0 0 0 14 0 3 0 16 0 -1 9 0 0 0 4 0 18 0 14 0 -1 -1 -1 -1 -1 9 0 0 0 12 0 2 0 15 0 9 0 15 0 7 0 5 0 4 0 -1 9 0 0 0 2 0 18 0 14 0 9 0 16 0 20 0 5 0 3 0 -1 -1 -1 -1 -1 -1 -1 -1 9 0 19 0 0 0 10 0 17 0 -1 9 0 15 0 0 0 17 0 10 0 -1 -1 -1 -1 -1 9 0 2 0 0 0 5 0 1...
result:
wrong answer set of ands are not equal (test case 2)