QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#601303#8332. Two in Oneast123#WA 77ms3660kbC++14906b2024-09-29 22:10:482024-09-29 22:10:49

Judging History

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

  • [2024-09-29 22:10:49]
  • 评测
  • 测评结果:WA
  • 用时:77ms
  • 内存:3660kb
  • [2024-09-29 22:10:48]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
int t, n, max1, max2;
int a[100010];
int b[100010];
void clrb();

void doit() {
	max1 = 100001, max2 = 100002;
	b[max1] = 0;
	b[max2] = 0;
	cin >> n;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i];
		b[a[i]]++;
	}
	for (int i = 1; i <= n; ++i) {
		if (b[a[i]] > b[max1] && a[i] != max1) {
			max2 = max1;
			max1 = a[i];
		} else if (b[a[i]] > b[max2] && a[i] != max1) {
			max2 = a[i];
		}
	}
	max1 = b[max1];
	max2 = b[max2];
	int ans = max(max1 | max2, max(max1 | max1, max2 | max2));
	int tmp1 = max1 & max2;
	int top = 21;
	for (int i = 20; i >= 0; --i) {
		if ((1 << i) & tmp1) {
			top = (1 << i) - 1;
			break;
		}
	}
	cout << (max1 | max2 | top) << endl;
	clrb();
}

void clrb() {
	for (int i = 1; i <= n; ++i) {
		b[a[i]] = 0;
	}
}

signed main() {
	cin >> t;
	while (t--) {
		doit();
	}
	return 0;
}

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 3644kb

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

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: 53ms
memory: 3660kb

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: 77ms
memory: 3636kb

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
21
3
23
3
3
3
3
3
3
3
23
3
21
3
3
3
23
3
3
23
3
3
23
23
23
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
23
3
23
3
23
3
3
3
23
3
3
3
23
3
3
3
3
23
3
3
3
3
23
3
3
3
3
23
3
3
3
23
3
23
23
23
3
3
3
3
21
23
23
3
21
3
3
3
3
3
3
3
3
3
3
21
3
3
3
3
3
3
3
3
3
3
3
21
23
3
23
1
3
3
3...

result:

wrong answer 18th numbers differ - expected: '5', found: '21'