QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#680769	#8332. Two in One	Icyecho	WA	21ms	3696kb	C++17	857b	2024-10-26 22:37:17	2024-10-26 22:37:18

Judging History

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

[2024-10-26 22:37:18]
评测

测评结果：WA
用时：21ms
内存：3696kb

查看

[2024-10-26 22:37:17]
提交

answer

#include<bits/stdc++.h>
#include<vector>
using namespace std;

typedef long long ll;
const int N = 100005;

int a[N];
int ct[N];

void solve() {
	int n;
	cin >> n;	
	for (int i = 1; i <= n; i++) {
		ct[i] = 0;
	}

	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		ct[x]++;
	}
//	if (n == 1) {
//		cout << ct[1] << '\n';
//		return;
//	}

	int cntx = 0, cnty = 0;

	for (int i = 1; i <= n; i++) {
		if (ct[i] >= cntx) {
			cnty = cntx;
			cntx = ct[i];
		} else if (ct[i] > cnty) {
			cnty = ct[i];
		}
	}

	int ans = cntx | cnty;

	int k = cntx | cnty;
	while(k > (k & (-k))) k -= k & (-k);
	k--;
	if (k < 0) k = 0;
	ans |= k;
	cout << (cntx | cnty | k) << '\n';

}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int T;
	cin >> T;
	while(T--) {
		solve();
	}


	return 0;
}

Source code, Language: C++17

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3648kb

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

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

memory: 3696kb

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

memory: 3660kb

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 18th numbers differ - expected: '5', found: '7'