QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #649339 | #8332. Two in One | Sred | WA | 48ms | 3596kb | C++17 | 555b | 2024-10-17 22:53:15 | 2024-10-17 22:53:15 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 5;
const int mod = 1e9 + 7;
int a[maxn];
void solve(){
unordered_map<int,int> mp;
int n;
cin >> n;
for(int i = 1;i <= n ;i ++) cin >> a[i],mp[a[i]]++;
int id = 0,id1 = 0;
for(auto [x,y] : mp){
id1 = id;
id = y;
}
int mx = 0;
for(int i = 0 ;i <= id1;i ++) mx = max(mx,id | i);
cout << mx << endl;
}
int main(){
int t = 1;
cin >> 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: 3484kb
input:
1 7 1 2 3 4 3 2 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
1 9 1 1 1 1 1 2 2 2 2
output:
7
result:
ok 1 number(s): "7"
Test #3:
score: -100
Wrong Answer
time: 48ms
memory: 3584kb
input:
50 10000 72 65 90 94 67 93 41 43 54 83 31 34 38 37 44 42 92 63 66 79 90 45 41 40 19 54 34 90 13 74 40 77 41 57 74 86 91 79 34 39 21 88 90 57 23 31 8 15 80 27 45 38 53 96 51 82 70 71 19 75 62 95 31 67 99 97 94 29 90 7 95 82 61 98 62 77 43 65 66 30 41 69 38 79 51 9 63 77 13 30 72 70 67 93 92 45 74 50 ...
output:
255 190 255 230 255 255 255 249 255 127 95 127 222 255 223 255 127 239 255 253 127 127 255 223 255 127 127 223 127 255 191 127 127 255 239 255 255 255 223 255 127 255 255 255 255 255 247 127 255 255
result:
wrong answer 2nd numbers differ - expected: '255', found: '190'