QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#725784 | #9541. Expanding Array | gzy | WA | 0ms | 3956kb | C++14 | 415b | 2024-11-08 20:01:38 | 2024-11-08 20:01:38 |
Judging History
answer
#include<bits/stdc++.h>
#define ins s.insert
using namespace std;
using ll = long long;
const int N = 2e5 + 7;
int i, j, k, n, m, x, y;
set<int> s;
int main() {
scanf("%d%d", &n, &x);
for(i = 1; i < n; i++) {
scanf("%d", &y);
ins(x);
ins(y);
ins(x | y);
ins(x & y);
ins(x ^ y);
ins(x & (x ^ y));
ins(y & (x ^ y));
x = y;
}
printf("%d\n", s.size());
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3956kb
input:
2 2 3
output:
4
result:
ok single line: '4'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3904kb
input:
2 3 4
output:
4
result:
ok single line: '4'
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3832kb
input:
2 3 5
output:
7
result:
wrong answer 1st lines differ - expected: '8', found: '7'