QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#619266#8332. Two in Onewsxcb#WA 15ms3768kbC++17607b2024-10-07 13:42:102024-10-07 13:42:10

Judging History

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

  • [2024-10-07 13:42:10]
  • 评测
  • 测评结果:WA
  • 用时:15ms
  • 内存:3768kb
  • [2024-10-07 13:42:10]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long

void solve() {

	int n;
	cin >> n;

	vector<int> cnt(n + 1, 0);
	for (int i = 0 ; i < n ; i++) {
		int x;
		cin >> x;
		cnt[x]++;
	}

	sort(cnt.begin(), cnt.end(), greater<int>());

	int mx = cnt[0] | cnt[1];
	for (int i = 25 ; i ; i--) {
		if (((cnt[0] & cnt[1]) >> i) & 1) {
			mx |= (1 << (i - 1));
			break;
		}
	}

	cout << mx << '\n';

}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	cin >> t;
	while (t--)
		solve();
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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: 15ms
memory: 3656kb

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:

223
207
223
221
222
223
205
221
207
207
219
230
229
223
223
207
218
211
206
205
246
223
247
197
235
219
223
223
222
203
197
247
245
222
235
223
239
219
205
222
223
223
217
239
222
254
223
219
219
220

result:

wrong answer 1st numbers differ - expected: '255', found: '223'