QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#441956	#8332. Two in One	ucup-team045^#	WA	26ms	3936kb	C++20	1.7kb	2024-06-14 23:49:03	2024-06-14 23:49:03

Judging History

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

[2024-06-14 23:49:03]
评测

测评结果：WA
用时：26ms
内存：3936kb

查看

[2024-06-14 23:49:03]
提交

answer

#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    int T;
    cin >> T;
    while(T--){
        int n;
        cin >> n;
        vector<int> a(n + 1), cnt(n + 1);
        int mx = 0;
        for(int i = 1; i <= n; i++){
            cin >> a[i];
            cnt[a[i]] += 1;
            mx = max(mx, __lg(cnt[a[i]]));
        }
        int c = 0;
        int val = -1;
        for(int i = 1; i <= n; i++){
            if (cnt[i] > 0 and __lg(cnt[i]) == mx){
                c += 1;
                val = i;
            }
        }
        if (c >= 2){
            cout << (1 << mx + 1) - 1 << '\n';
            continue;
        }

        vector<int> p(n + 1);
        for(int i = 1; i <= n; i++){
            if (i != val){
                p[cnt[i]] += 1;
            }
        }
        int ans = cnt[val];
        for(int i = 1; i <= n; i++){
            if (p[i]){
                ans = max(ans, cnt[val] ^ i);
                int sum = 0;
                for(int j = mx - 1; j >= 0; j--){
                    int bit1 = (cnt[val] >> j & 1);
                    int bit2 = (i >> j & 1);
                    if (bit1 && bit2){
                        sum |= (1 << j + 1) - 1;
                        break;
                    }
                    if (bit1 or bit2){
                        sum |= 1 << j;
                    }
                }
                ans = max(ans, sum);
            }
        }
        cout << ans << '\n';
    }

}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3876kb

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

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

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: 0

Accepted

time: 26ms

memory: 3560kb

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:

ok 79114 numbers

Test #5:

score: -100

Wrong Answer

time: 24ms

memory: 3536kb

input:

50000
10
6 3 8 5 4 6 3 5 3 9
10
10 4 3 10 4 5 2 7 8 10
10
10 6 2 2 4 9 7 3 3 4
10
1 2 9 7 5 2 1 2 10 1
10
2 8 2 3 7 8 3 5 10 5
10
5 6 10 2 7 3 5 10 5 4
10
3 4 4 2 2 1 1 8 5 10
10
3 3 3 8 5 7 3 6 7 9
10
10 6 5 3 2 8 10 9 9 4
10
5 8 6 2 10 5 8 8 10 7
10
5 8 2 10 2 2 9 5 4 2
10
7 6 4 7 5 9 2 2 1 7
10
7...

output:

result:

wrong answer 91st numbers differ - expected: '7', found: '6'