QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#392579	#8332. Two in One	Yia^#	TL	61ms	4444kb	C++17	688b	2024-04-17 17:26:38	2024-04-17 17:26:39

Judging History

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

[2024-04-17 17:26:39]
评测

测评结果：TL
用时：61ms
内存：4444kb

查看

[2024-04-17 17:26:38]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e5+10;
int n,m1,m2,a[N];
bool cmp(int p,int q){
    return p>q;
}
void solve(){
    int x;
    cin>>n;
    for(int i=1;i<=N;i++)a[i]=0;
    for(int i=1;i<=n;i++){
        cin>>x;
        a[x]++;
    }
    sort(a+1,a+1+n,cmp);
    m1=a[1];
    for(int i=2;i<=n;i++){
        if(a[i]!=a[1]){
            m2=a[i];
            break;
        }
    }
    int ans=m1;
    for(int i=0;i<=m1;i++){
        for(int j=0;j<=m2;j++){
            ans=max(ans,i|j);
        }
    }
    cout<<ans<<endl;
}
signed main() {
    int T;
    cin>>T;
    while(T--)solve();
    return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 4444kb

input:

1
7
1 2 3 4 3 2 1

output:

result:

ok 1 number(s): "3"

Test #2:

score: 0

Accepted

time: 1ms

memory: 4412kb

input:

1
9
1 1 1 1 1 2 2 2 2

output:

result:

ok 1 number(s): "7"

Test #3:

score: 0

Accepted

time: 61ms

memory: 4340kb

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:

ok 50 numbers

Test #4:

score: -100

Time Limit Exceeded

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: