QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#534150#8332. Two in Onetraining_233#WA 6ms3872kbC++14739b2024-08-26 21:12:342024-08-26 21:12:34

Judging History

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

  • [2024-08-26 21:12:34]
  • 评测
  • 测评结果:WA
  • 用时:6ms
  • 内存:3872kb
  • [2024-08-26 21:12:34]
  • 提交

answer

#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a),i##END=(b);i<=i##END;i++)
#define Rof(i,b,a) for(int i=(b),i##END=(a);i>=i##END;i--)
#define go(u) for(int i=head[u];i;i=nxt[i])
using namespace std;
inline int read(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
	return x*f;
}
const int N=1e5+10;
int n,c[N],t[N];
signed main(){
	int T=read();while(T--){
		For(i,1,n=read())c[i]=read();
		For(i,1,n)t[i]=0;
		For(i,1,n)t[c[i]]++;
		int mx=0,sx=0;
		For(i,1,n){
			if(t[i]>mx)sx=mx,mx=t[i];
			else if(t[i]>sx)sx=t[i];
		}
		printf("%d\n",mx|sx|((1<<(31-__builtin_clz(mx&sx)))-1));
	}
	return 0;
}

详细

Test #1:

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

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

input:

1
9
1 1 1 1 1 2 2 2 2

output:

7

result:

ok 1 number(s): "7"

Test #3:

score: 0
Accepted
time: 2ms
memory: 3872kb

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
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255

result:

ok 50 numbers

Test #4:

score: -100
Wrong Answer
time: 6ms
memory: 3740kb

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:

3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
1
5
3
268435455
3
3
3
3
3
3
3
268435455
3
5
3
3
3
3
3
3
3
3
3
3
268435455
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
268435455
3
3
3
3
3
3
3
3
3
3
3
268435455
3
3
3
3
268435455
3
3
3
3
268435455
3
3
3
3
3
3
3
3
268435455
3
268435455
268435455
6
3
3
3
3
5
3
268435455
3
5
...

result:

wrong answer 20th numbers differ - expected: '3', found: '268435455'