QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#722832 | #8332. Two in One | EMTz | WA | 32ms | 5936kb | C++20 | 1.1kb | 2024-11-07 20:18:36 | 2024-11-07 20:18:36 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
#define ull unsigned long long
using namespace std;
typedef pair<int,int>PII;
typedef pair<int,PII>PPI;
typedef array<int,3>ar;
typedef __int128 i28;
const int N=1e6+7;
const int N1=1e9+9;
const int M=998244353;
const ull mask = std::chrono::steady_clock::now().time_since_epoch().count();
mt19937_64 rng(time(0));
const int M1=19260817;
const int base=233;
const int base1=131;
const int INF = 0x3f3f3f3f;
int a[N];
int cnt[N];
void solve()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a[i];
cnt[a[i]]++;
}
int x=0,y=0;
for(int i=1;i<=n;i++)
{
if(cnt[i]>x)
{
y=x;
x=cnt[i];
}
else if(cnt[i]>y) y=cnt[i];
}
int ans=0;
for(int i=1;i<=x;i++)
{
int now=0,an=0;
for(int j=30;j>=0;j--)
{
int x=(i>>j)&1;
if(x==0)
{
if(now+(1<<j)<=y)
{
now+=1<<j;
an+=1<<j;
}
}
else
{
an+=1<<j;
}
}
ans=max(ans,an);
}
cout<<ans<<"\n";
}
signed main()
{
std::ios::sync_with_stdio(false);
cout.tie(0);cin.tie(0);
int _=1;
cin>>_;
while(_--)
{
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 5936kb
input:
1 7 1 2 3 4 3 2 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 5744kb
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: 32ms
memory: 5748kb
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'