QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #788926 | #8332. Two in One | aYi_7 | WA | 38ms | 4060kb | C++17 | 917b | 2024-11-27 18:46:49 | 2024-11-27 18:46:53 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int arr[2000009];
int main()
{
int tt=0;
scanf("%d",&tt);
while(tt--)
{
map<int,int>mp;
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d",&arr[i]);
mp[arr[i]]++;
}
int t=0;
map<int,int>::iterator it=mp.end();
it--;
int cnt1=0;
int a1=it->first;
it--;
int cnt2=0;
int a2=it->first;
int ans=0;
//printf("cbt12:%d %d\n",cnt1,cnt2);
for(int i=1;i<=n;i++)
{
if(arr[i]==a1)
{
cnt1++;
ans=max(ans,cnt1|cnt2);
}
else if(arr[i]==a2)
{
cnt2++;
ans=max(ans,cnt1|cnt2);
}
}
printf("%d\n",ans);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 4060kb
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: 3884kb
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: 38ms
memory: 3872kb
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:
203 175 255 190 255 199 255 255 195 199 255 183 255 255 203 255 255 199 255 255 215 255 255 197 255 217 215 207 199 255 194 203 213 255 199 255 185 203 255 255 255 207 255 205 255 229 203 179 255 255
result:
wrong answer 1st numbers differ - expected: '255', found: '203'