QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#641371#8332. Two in OnekalikariWA 37ms3708kbC++171.2kb2024-10-14 20:12:292024-10-14 20:12:29

Judging History

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

  • [2024-10-14 20:12:29]
  • 评测
  • 测评结果:WA
  • 用时:37ms
  • 内存:3708kb
  • [2024-10-14 20:12:29]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
/*
ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
*/
// #define int long long
#define ld long double
//#define INT __int128
#define eb(x) emplace_back(x)
#define fi first
#define se second
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<long long, long long> PLL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const int inf = 0x3f3f3f3f;
const LL mod = 1e9 + 7;
const ld eps = 1e-12;
const int N = 1e5 + 10, M = N + 10;
int n;
int a[N];
map<int,int>mp;

void solve(){
    cin>>n;
    mp.clear();
    for(int i=1;i<=n;i++){
        scanf("%d",&a[i]);
        mp[a[i]]++;
    }   
    int mx1=0,mx2=0;
    for(auto i:mp){
        if(i.second>mx1){
            mx2=mx1;
            mx1=i.second;
        }
        else if(i.second>mx2){
            mx2=i.second;
        }
    }
    int ans=mx1|mx2|((mx1&mx2)-1);
    cout<<ans<<endl;
}

signed main(){
    // ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
    int T=1,cas=1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0;
}

详细

Test #1:

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

input:

1
7
1 2 3 4 3 2 1

output:

3

result:

ok 1 number(s): "3"

Test #2:

score: 0
Accepted
time: 1ms
memory: 3704kb

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: 37ms
memory: 3692kb

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:

223
207
223
255
223
255
255
223
207
207
223
255
255
255
223
207
223
211
207
205
247
255
247
197
255
223
223
223
223
203
255
255
245
223
235
223
239
219
207
223
223
223
223
239
223
255
223
219
219
223

result:

wrong answer 1st numbers differ - expected: '255', found: '223'