QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#505789#8332. Two in Onek1nsomWA 354ms7908kbC++171.0kb2024-08-05 11:29:032024-08-05 11:29:04

Judging History

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

  • [2024-08-05 11:29:04]
  • 评测
  • 测评结果:WA
  • 用时:354ms
  • 内存:7908kb
  • [2024-08-05 11:29:03]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
#define lowbit(x) (x & -x)
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
int n, a[N], c[N], cnt[N];
void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++)
        cin >> a[i], c[a[i]]++;
    for (int i = 1; i <= n; i++)
        if (c[i])
            cnt[c[i]]++;
    int ans = 0;
    vector<int> tmp;
    for (int i = 1; i <= n; i++)
        if (cnt[i])
        {
            ans = max(ans, i);
            tmp.push_back(i);
            if (cnt[i] >= 2)
                ans = max(ans, i | (lowbit(i) - 1));
        }
    for (auto x : tmp)
        for (auto y : tmp)
        {
            ans = max(ans, x | y);
            int tmp = x & y;
            if (tmp)
                ans = max(ans, x | y | ((1 << __lg(tmp)) - 1));
        }
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    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: 1ms
memory: 7908kb

input:

1
7
1 2 3 4 3 2 1

output:

3

result:

ok 1 number(s): "3"

Test #2:

score: 0
Accepted
time: 1ms
memory: 5596kb

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: 354ms
memory: 7824kb

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
511
1023
1023
1023
2047
2047
2047
2047
2047
4095
4095
4095
4095
4095
4095
4095
4095
4095
4095
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
8191
16383
16383
16383
16383
16383
16383
16383
16383
16383

result:

wrong answer 2nd numbers differ - expected: '255', found: '511'