QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#759644#8332. Two in OneXiCenWA 71ms3800kbC++20841b2024-11-18 10:47:552024-11-18 10:47:56

Judging History

你现在查看的是最新测评结果

  • [2024-11-18 10:47:56]
  • 评测
  • 测评结果:WA
  • 用时:71ms
  • 内存:3800kb
  • [2024-11-18 10:47:55]
  • 提交

answer

#include<iostream>
#include<algorithm>
using namespace std;
using ll=long long;
using pii=pair<int,int>;
#include<queue>
#include<map>

void solve(){
    int n;
    cin>>n;
    vector<int> a(n);
    for(auto&i:a) cin>>i;
    map<int,int> mp;
    for(auto i:a) mp[i]++;
    if(mp.size()==1){
        cout<<mp.begin()->second<<"\n";
        return;
    }
    vector<pii> cnt;
    for(auto [k,v]:mp) cnt.push_back({v,k});
    sort(cnt.rbegin(),cnt.rend());
    auto it=cnt[0],it2=cnt[1];
    int ans=it.first|it2.first;
    ans|=(2<<__lg(it.first&it2.first))-1;
    // for(int i=0;i<=it2.first;i++) ans=max(ans,(it.first^i));
    cout<<ans<<"\n";
}
int main(){
    // freopen("1.txt","r",stdin);
    // ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
    int t=1;
    cin>>t;
    while(t--)
        solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3500kb

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: 3800kb

input:

1
9
1 1 1 1 1 2 2 2 2

output:

7

result:

ok 1 number(s): "7"

Test #3:

score: 0
Accepted
time: 67ms
memory: 3536kb

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
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255

result:

ok 50 numbers

Test #4:

score: -100
Wrong Answer
time: 71ms
memory: 3744kb

input:

79114
7
1 2 4 3 2 3 7
7
1 2 4 7 4 1 5
6
4 2 2 4 2 1
7
1 2 1 4 7 3 2
7
1 2 4 7 1 1 3
7
1 2 6 1 5 2 5
6
5 2 6 1 2 5
7
1 1 7 6 6 5 2
7
1 2 5 6 6 7 7
7
1 1 2 7 2 3 6
7
1 1 1 4 6 2 2
7
1 1 5 7 3 5 2
7
1 1 7 6 2 2 5
6
4 3 4 6 3 1
6
4 4 3 2 3 1
7
1 1 2 3 7 6 2
6
1 2 5 6 3 4
7
1 1 1 1 4 7 6
6
2 6 6 2 5 3
6
...

output:

3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
1
-1
3
-1
3
3
3
3
3
3
3
-1
3
-1
3
3
3
-1
3
3
-1
3
3
-1
-1
-1
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
-1
3
-1
3
-1
3
3
3
-1
3
3
3
-1
3
3
3
3
-1
3
3
3
3
-1
3
3
3
3
-1
3
3
3
-1
3
-1
-1
-1
3
3
3
3
-1
-1
-1
3
-1
3
3
3
3
3
3
3
3
3
3
-1
3
3
3
3
3
3
3
3
3
3
3
-1
-1
3
-1
1
3
3
3...

result:

wrong answer 18th numbers differ - expected: '5', found: '-1'