QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#793641#8332. Two in OneMaxduan#WA 15ms3652kbC++23906b2024-11-29 21:59:402024-11-29 21:59:41

Judging History

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

  • [2024-11-29 21:59:41]
  • 评测
  • 测评结果:WA
  • 用时:15ms
  • 内存:3652kb
  • [2024-11-29 21:59:40]
  • 提交

answer

#include <bits/stdc++.h>
#define int long long 
#define endl '\n'
using namespace std;

const int mod = 998244353;
const int N = 1e5 + 5;

int n;
int cnt[N];

void solve(){
    int ans=0;
    cin>>n;
    for(int i=1;i<=n;i++){
        int x;cin>>x;
        cnt[x]++;
    }
    int max1=0,max2=0;
    for(int i=1;i<=n;i++){
        if(cnt[i]>=max1){
            max2=max2;max1=cnt[i];
        }else if(cnt[i]>max2){
            max2=cnt[i];
        }
    }
    if(max2==0){
        ans=max1;
    }else{
        int tmp=0;
        for(int i=19;i>=0;i--){
            if((max1>>i)&1)continue;
            if(tmp|(1<<i)<=max2)tmp|=(1<<i);
        }
        ans=max(ans,max1|tmp);
    }
    cout<<ans<<endl;
    return;
}

signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int TT=1;cin>>TT;
    while(TT--){
        solve();
    }
}

详细

Test #1:

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

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

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: 15ms
memory: 3596kb

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
511
1023
1023
1023
2047
2047
2047
2047
2047
4095
4095
4095
4095
4095
4095
4095
4095
4095
4095
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
16383
16383
16383
16383
16383
16383
16383
16383
16383

result:

wrong answer 2nd numbers differ - expected: '255', found: '511'