QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#610576	#8332. Two in One	mhw^#	WA	52ms	3780kb	C++20	1.9kb	2024-10-04 16:30:14	2024-10-04 16:30:14

Judging History

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

[2024-10-04 16:30:14]
评测

测评结果：WA
用时：52ms
内存：3780kb

查看

[2024-10-04 16:30:14]
提交

answer

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

int n; 
vector<ll> a, cnt;

ll get_id(int x){
    ll t = -1;
    while(x){
        t++;
        x >>= 1;
    }
    return t;
}
void slv(){
    int n;
    cin >> n;
    a.resize(n + 1), cnt.resize(n + 1);
 
    int f = 1;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    for(int i = 2; i <= n; ++i) if(a[i] != a[i - 1]) f = 0;
    if(f){cout << n << '\n'; return;}

    for(int i = 1; i <= n; ++i) cnt[a[i]]++;

    ll id = -1, sum = 0, p = -1;
    for(int i = 1; i <= n; ++i){
        if(cnt[i] == 0) continue;
        id = max(id, get_id(cnt[i]));//cnt表示出现次数，我们要找位最高的
    }
    for(int i = 1; i <= n; ++i){
        if(get_id(cnt[i] == id)) sum++, p = i;//i出现次数最高
    }
    
    ll _ans = 0;
    if(sum > 1){
        for(int j = 0; j <= id; ++j) _ans = _ans + (1 << j);
        cout << _ans << '\n';
        return ;
    }

    //p是最高的id
    for(int i = 1; i <= n; ++i){
        ll ans = 0;
        if(cnt[i] == 0) continue;
        if(i == p) continue;
        ll x = cnt[p], y = cnt[i];
        for(int j = id; j >= 0; --j){
            int kx = ((x >> j) & 1), ky = ((y >> j) & 1);
            if(kx == 1 && ky == 1){
                for(int k = j; k >= 0; --k){
                    ans = ans + (1 << k);
                }
                break;
            }else if((kx == 1 && ky == 0) || (kx == 0 && ky == 1)){
                ans = ans + (1 << j);
            }else if(kx == 0 && ky == 0){
                ans = ans + 0;
            }
        }
        _ans = max(_ans, ans);
    }
    cout << _ans << '\n';
}

signed main(){
    // ios::sync_with_stdio(0), cin.tie(0);
    int _; cin >> _;
    while(_--) slv();
    return 0;
}
/*
2
7
1 2 3 4 3 2 1
9
1 1 1 1 1 2 2 2 2
*/

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 1ms

memory: 3684kb

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

input:

1
9
1 1 1 1 1 2 2 2 2

output:

result:

ok 1 number(s): "7"

Test #3:

score: -100

Wrong Answer

time: 52ms

memory: 3780kb

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:

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