QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#707972	#8332. Two in One	bessie_goes_moo^#	WA	32ms	5716kb	C++14	1.1kb	2024-11-03 18:31:44	2024-11-03 18:31:44

Judging History

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

[2024-11-03 18:31:44]
评测

测评结果：WA
用时：32ms
内存：5716kb

查看

[2024-11-03 18:31:44]
提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 5;
int T;
inline int read() {
	int al = 0, fh = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9') {
		if (ch == '-')
			fh = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') {
		al = al * 10 + ch - '0';
		ch = getchar();
	}
	return al * fh;
}
bool cmp(int a,int b){
	return a<b;
}
int c[N],num[N],dui_a[N],dui_b[N],cnt,n;
signed main() {
	T = read();
	for (int yyc = 1; yyc <= T; yyc++) {
		for(int i=1;i<=n;i++){
			num[i]=0;
		}
		cnt=0;
		n = read();
		for(int i=1;i<=n;i++){
			c[i]=read();
			num[c[i]]++;
		}
		if(n==1){
			cout<<num[1]<<endl;
			continue;
		}
		sort(num+1,num+n+1,cmp);
		int a=num[n],b=num[n-1];
		//cout<<a<<" "<<b<<endl;
		while(a!=0){
			dui_a[++cnt]=a%2;
			dui_b[cnt]=b%2;
			a/=2;
			b/=2;
		}
		for(int i=cnt;i>=1;i--){
			if(dui_a[i]+dui_b[i]==2){
				for(int j=i;j>=1;j--)
					dui_a[j]=1;
				break;
			}
			else dui_a[i]=dui_a[i]+dui_b[i];
		}
		int ans=0;
		for(int i=1;i<=cnt;i++){
			ans=ans*2+dui_a[i];
		}
		cout<<ans<<endl;
	}
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 5648kb

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

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: 13ms

memory: 3752kb

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

Wrong Answer

time: 32ms

memory: 5716kb

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:

result:

wrong answer 97th numbers differ - expected: '6', found: '3'