QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #782147 | #9541. Expanding Array | 2jczoo8 | WA | 0ms | 3696kb | C++14 | 401b | 2024-11-25 19:05:03 | 2024-11-25 19:05:05 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 5;
int n , a[N];
map <int , int> mp;
signed main () {
cin >> n;
for (int i = 1;i <= n;i ++) {
cin >> a[i];
if (a[i] > 1)
mp[a[i]] = mp[a[i - 1]] = mp[(a[i] ^ a[i - 1]) & a[i]] = mp[(a[i] ^ a[i - 1]) & a[i - 1]] = mp[a[i] | a[i - 1]] = mp[0] = 1;
}
cout << mp.size();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3560kb
input:
2 2 3
output:
4
result:
ok single line: '4'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3696kb
input:
2 3 4
output:
4
result:
ok single line: '4'
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3652kb
input:
2 3 5
output:
6
result:
wrong answer 1st lines differ - expected: '8', found: '6'