QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#553758	#8332. Two in One	zhaomumu1218	WA	24ms	4064kb	C++20	841b	2024-09-08 19:32:53	2024-09-08 19:32:53

Judging History

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

[2024-09-08 19:32:53]
评测

测评结果：WA
用时：24ms
内存：4064kb

查看

[2024-09-08 19:32:53]
提交

answer

#include<bits/stdc++.h>
using namespace std;
int n,a[100010];
struct node{
    int id,g;
    bool operator<(const node t)const{
        return g>t.g;
    }
}mp[100010];
void solve(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++) mp[i].id=i,mp[i].g=0;
    for(int i=1;i<=n;i++) scanf("%d",&a[i]),mp[a[i]].g++;
    sort(mp+1,mp+1+n);
    int d=mp[1].id,dd=mp[2].id;
    int ans=(mp[1].g|mp[2].g),x=(mp[1].g&mp[2].g);
    int ws=0;
    if(x==0) ws=1;
    while(x) ws++,x/=2;
    ws--,ans|=ws;
    printf("%d\n",ans);
    // for(int i=1;i<=n;i++){
    //     if(a[i]==d) mp[1].g--;
    //     if(a[i]==dd) mp[2].g--;
    //     if((mp[1].g|mp[2].g)==ans){printf("%d %d\n",i,n);break;}
    // }
    // printf("%d %d\n",d,dd);
}
signed main(){
    int T;
    scanf("%d",&T);
    while(T--) solve();
    return 0;
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3948kb

input:

1
7
1 2 3 4 3 2 1

output:

result:

ok 1 number(s): "3"

Test #2:

score: 0

Accepted

time: 0ms

memory: 3952kb

input:

1
9
1 1 1 1 1 2 2 2 2

output:

result:

ok 1 number(s): "7"

Test #3:

score: -100

Wrong Answer

time: 24ms

memory: 4064kb

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:

result:

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