QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #756050 | #8332. Two in One | XiCen | WA | 1ms | 3684kb | C++20 | 546b | 2024-11-16 18:50:57 | 2024-11-16 18:50:58 |
Judging History
answer
#include<bits/stdc++.h>
signed main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(0);std::cout.tie(0);
int n;std::cin>>n>>n;
std::vector<int> a(n+1,0),cnt(n+1,0);
for(int i = 1;i<=n;++i)std::cin>>a[i],cnt[a[i]]++;
std::sort(cnt.begin(),cnt.end());
int ans = 0;
int x = cnt[n],y = cnt[n - 1],z = x & y;
while(z - (z & -z) > 0)z -= (z & -z);
if(y == 0)ans = x;
else if(z == 0)ans = x ^ y;
else ans = (x ^ (y - z)) | (z - 1);
std::cout<<ans<<"\n";
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
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: 3528kb
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: 1ms
memory: 3684kb
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
result:
wrong answer Answer contains longer sequence [length = 50], but output contains 1 elements