QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #557970 | #8332. Two in One | DengDuck | WA | 21ms | 3928kb | C++14 | 410b | 2024-09-11 13:00:56 | 2024-09-11 13:00:56 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int T,n,A[N],B[N];
int main()
{
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(int i=1;i<=n;i++)B[i]=0;
for(int i=1;i<=n;i++)scanf("%d",&A[i]),B[A[i]]++;
int Fi=0,Se=0;
for(int i=1;i<=n;i++)
{
if(Fi<=B[i])Se=Fi,Fi=B[i];
else if(Se<B[i])Se=B[i];
}
printf("%d\n",Fi|Se|(1<<__lg(max(Fi&Se,1))-1));
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3828kb
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: 3808kb
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: 21ms
memory: 3928kb
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:
223 207 223 221 222 223 205 221 207 207 219 230 229 223 223 207 218 211 206 205 246 223 247 197 235 219 223 223 222 203 197 247 245 222 235 223 239 219 205 222 223 223 217 239 222 254 223 219 219 220
result:
wrong answer 1st numbers differ - expected: '255', found: '223'