QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#548306	#8332. Two in One	aries_yff^#	WA	35ms	3908kb	C++20	1.3kb	2024-09-05 16:59:13	2024-09-05 16:59:14

Judging History

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

[2024-09-05 16:59:14]
评测

测评结果：WA
用时：35ms
内存：3908kb

查看

[2024-09-05 16:59:13]
提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS std::ios::sync_with_stdio(false); cin.tie(NULL);cout.tie(NULL);
#define endl "\n"

const ll N = 25;
const ll mod = 1e9+7;


void solve()
{
    ll n;
    cin>>n;

    vector<ll> cnt(n+10);
    for(int i=1;i<=n;i++){
        ll t;cin>>t;
        cnt[t]++;
    }
    
    set<ll> s;
    vector<ll> b;
    for(int i=1;i<=n;i++){
        if(cnt[i])s.insert(cnt[i]);
    }
    ll ans = 0;    
    for(auto x:s){
        b.push_back(x);
        ans = max(ans,x);
    }
   // cout<<b.size()<<endl;


    for(int i=0;i<b.size();i++){
        for(int j=i+1;j<b.size();j++){
            if((b[i]&b[j])==0){
                ans = max(ans,b[i]|b[j]);
            }       
            else{
                // ans = max(ans,b[i]|b[j]|((b[i]&b[j])-1));
                ll x = (b[i]&b[j]);
                for(int k=20;k>=0;k--){
                    if(x&(1<<k)){
                        ans = max(ans,b[i]|b[j]| ( (1<<(k+1))-1 ) );
                        break;
                    }
                }
            }
        }
    }
    
    
    
    cout<<ans<<endl;
}


int main()
{
    IOS;
    int T=1;cin>>T;
    while(T--){
        solve();
    }
    
    return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3780kb

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

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

memory: 3908kb

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

memory: 3532kb

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 120th numbers differ - expected: '3', found: '2'