QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #28133 | #1830. AND | Seniorious | WA | 17ms | 3752kb | C++17 | 686b | 2022-04-12 10:51:09 | 2022-04-29 09:03:30 |
Judging History
answer
#include <bits/stdc++.h>
#define File(a) freopen(a ".in", "r", stdin), freopen(a ".out", "w", stdout)
const int N = 100005;
int a[N];
int T, n;
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d", &n);
int all = (1 << 20) - 1;
for (int i = 1; i <= n; ++i) {
scanf("%d", a + i);
all &= a[i];
}
if (all == 0) {
bool flag = true;
for (int i = 1; i <= n; ++i) {
if (a[i] == all) flag = false;
}
if (flag) {
puts("-1");
continue;
}
}
printf("%d\n", 2 * n);
for (int i = 1; i <= n; ++i) printf("%d %d%c", all, a[i], " \n"[i == n]);
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 3ms
memory: 3640kb
input:
3 1 5 3 0 1 2 2 1 2
output:
2 5 5 6 0 0 0 1 0 2 -1
result:
ok answer is correct (3 test cases)
Test #2:
score: -100
Wrong Answer
time: 17ms
memory: 3752kb
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 10 0 11 0 0 0 13 0 2 0 17 -1 -1 -1 10 0 7 0 0 0 14 0 3 0 16 -1 10 0 1 0 0 0 4 0 18 0 14 -1 -1 -1 -1 -1 10 0 1 0 0 0 12 0 2 0 15 10 0 0 0 15 0 7 0 5 0 4 -1 10 0 16 0 0 0 2 0 18 0 14 10 0 0 0 16 0 20 0 5 0 3 -1 -1 -1 -1 -1 -1 -1 -1 10 0 12 0 19 0 0 0 10 0 17 -1 10 0 13 0 15 0 0 0 17 0 10 -1 -1 -1 -...
result:
wrong answer set of ands are not equal (test case 74)