QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#541195#8332. Two in OneShiinaMahiruWA 25ms3756kbC++141.0kb2024-08-31 18:53:372024-08-31 18:53:38

Judging History

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

  • [2024-08-31 18:53:38]
  • 评测
  • 测评结果:WA
  • 用时:25ms
  • 内存:3756kb
  • [2024-08-31 18:53:37]
  • 提交

answer

// #pragma GCC optimize(2)
#include<bits/stdc++.h>
#define endl '\n'
#define lowbits(x) ((x)&((-x)))
#define INF 0x3f3f3f3f
#define uu __int128
#define PI acos(-1)
#define ls k<<1
#define rs k<<1|1
using namespace std;
typedef  long long ll;
typedef  unsigned long long ull;
typedef pair<int, int> P;
typedef pair<int, pair<int, int> > PII;
constexpr int N=2e6+10, M=2*N;
constexpr int mod=998244353;
constexpr double eps=1e-9;
int nx[] = {0, 0, 1, -1}, ny[] = {1, -1, 0, 0};


int n,m;

void solve(){
    cin >> n;
    vector<ll> a(n+1);
    for(int i=1; i<=n; ++i){
        int x;cin >> x;
        a[x]++;
    }
    sort(a.begin(), a.end());
    if(n == 1){
        cout << a[1] << endl;
    }
    else {
        int res = __lg((a[n] & a[n-1]));
        cout << (a[n] | a[n-1] | ((1ll << res) - 1)) << endl;
    }
    



}


signed main()
{   
    ios::sync_with_stdio(0);cin.tie(0),cout.tie(0);
    int t = 1;
    // cout << fixed << setprecision(9)
    cin >> t;
    while(t--)solve();
    return 0;

}

详细

Test #1:

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

input:

1
7
1 2 3 4 3 2 1

output:

3

result:

ok 1 number(s): "3"

Test #2:

score: 0
Accepted
time: 1ms
memory: 3752kb

input:

1
9
1 1 1 1 1 2 2 2 2

output:

7

result:

ok 1 number(s): "7"

Test #3:

score: 0
Accepted
time: 18ms
memory: 3556kb

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
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255
255

result:

ok 50 numbers

Test #4:

score: -100
Wrong Answer
time: 25ms
memory: 3756kb

input:

79114
7
1 2 4 3 2 3 7
7
1 2 4 7 4 1 5
6
4 2 2 4 2 1
7
1 2 1 4 7 3 2
7
1 2 4 7 1 1 3
7
1 2 6 1 5 2 5
6
5 2 6 1 2 5
7
1 1 7 6 6 5 2
7
1 2 5 6 6 7 7
7
1 1 2 7 2 3 6
7
1 1 1 4 6 2 2
7
1 1 5 7 3 5 2
7
1 1 7 6 2 2 5
6
4 3 4 6 3 1
6
4 4 3 2 3 1
7
1 1 2 3 7 6 2
6
1 2 5 6 3 4
7
1 1 1 1 4 7 6
6
2 6 6 2 5 3
6
...

output:

3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
1
-1
3
-1
3
3
3
3
3
3
3
-1
3
-1
3
3
3
-1
3
3
-1
3
3
-1
-1
-1
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
-1
3
-1
3
-1
3
3
3
-1
3
3
3
-1
3
3
3
3
-1
3
3
3
3
-1
3
3
3
3
-1
3
3
3
-1
3
-1
-1
-1
3
3
3
3
-1
-1
-1
3
-1
3
3
3
3
3
3
3
3
3
3
-1
3
3
3
3
3
3
3
3
3
3
3
-1
-1
3
-1
1
3
3
3...

result:

wrong answer 18th numbers differ - expected: '5', found: '-1'