QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#925058#8332. Two in Oneqwq123#WA 5ms3712kbC++14913b2025-03-03 23:47:262025-03-03 23:47:39

Judging History

This is the latest submission verdict.

  • [2025-03-03 23:47:39]
  • Judged
  • Verdict: WA
  • Time: 5ms
  • Memory: 3712kb
  • [2025-03-03 23:47:26]
  • Submitted

answer

#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define lll __int128
// #define int ll
#define db double
#define pii pair<int,int>
#define fi first
#define se second
#define mp make_pair
using namespace std;
ll read(){
	ll sum=0,f=1;char st=getchar();
	while(st<'0'||st>'9'){
		if(st=='-')f=-1;
		st=getchar();
	}
	while('0'<=st&&st<='9'){
		sum=(sum<<3)+(sum<<1)+st-'0';
		st=getchar();
	}
	return sum*f;
}
const int maxn=100010;//maxm=600010;
int cnt[maxn];
signed main(){
	
	int TT=read();
	while(TT--){
		int n=read();
		for(int i=1;i<=n;++i){
			int x=read();
			++cnt[x];
		}
		int ma1=0,ma2=0;
		for(int i=1;i<=n;++i){
			if(cnt[i]>ma1)ma2=ma1,ma1=cnt[i];
			else ma2=max(ma2,cnt[i]);
		}
		for(int i=19;i>=0;--i){
			int op1=(ma1>>i)&1,op2=(ma2>>i)&1;
			if(!op1||!op2)continue;
			for(int j=i;j>=0;--j)ma1|=(1<<j);
			break;
		}
		printf("%d\n",ma1|ma2);
	}	
	
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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: 5ms
memory: 3712kb

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'