QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#400853	#8332. Two in One	asxziill	RE	11ms	3784kb	C++23	891b	2024-04-27 17:00:33	2024-04-27 17:00:34

Judging History

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

[2024-04-27 17:00:34]
评测

测评结果：RE
用时：11ms
内存：3784kb

查看

[2024-04-27 17:00:33]
提交

answer

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

int __lg(ll x) {
  for (int i = 32; i >= 0; i--) {
    if ((x >> i) & 1) return i;
  }
  assert(1 ==  -1);
}

void solve()
{
    ll n;
    std::cin >> n;
    std::vector<ll> c(n+1,0);
    std::vector<ll> cnt(n+1, 0);
    for (int i = 1; i <= n; i++)
    {
        std::cin >> c[i];
        cnt[c[i]]++;
    }
    std::sort(cnt.begin()+1, cnt.end());
    if (n <= 1)
    {
        std::cout << cnt[1] << '\n';
        return;
    }
    int k = 1<<(__lg(cnt[n] & cnt[n-1]));
    k--;

    ll ans = 0;
    ans |= cnt[n];
    ans |= cnt[n-1];
    ans |= k;
    std::cout << ans << '\n';
}

int main()
{
    std::ios::sync_with_stdio(false);std::cin.tie(0);
    int T = 1;
    std::cin >> T;
    while (T--)
        solve();
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3728kb

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

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

memory: 3784kb

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

Runtime Error

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