QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#723028#8332. Two in OnejokerTWA 35ms3776kbC++20970b2024-11-07 20:58:532024-11-07 20:58:53

Judging History

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

  • [2024-11-07 20:58:53]
  • 评测
  • 测评结果:WA
  • 用时:35ms
  • 内存:3776kb
  • [2024-11-07 20:58:53]
  • 提交

answer

/*
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define sqrt(a) sqrtl(a)
#define abs(a) llabs(a)
#define pow(a) powl(a)
typedef  pair<int,int> pi ;
#define if1(x) for(int i =1 ;i<=x;i++)
#define if0(x) for(int i = 0;i<x;i++)
#define jf0(x) for(int j = 0;j<x;j++)
#define jf1(x) for(int j = 1;j<=x;j++)
#define pb push_back
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const int N = 2e5+10;
void solve(){
    int m,n;
    cin>>n;
    map<int,int> mp;
    int ans = 0;
    if0(n){
        cin>>m;
        mp[m]++;
        auto  a = mp.rbegin();
        int b=0;
        if(mp.size() >1)
        b = prev(a)->second;
        else b = 0;
        ans = max(ans,(a->second | b));
    }
    cout<<ans<<endl;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr); 
    int t=1;
    cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}
/*


*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3548kb

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

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: 35ms
memory: 3660kb

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
248
255
255
215
255
255
197
255
255
255
207
199
255
194
203
255
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'