QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#709231#8332. Two in OneXiCenWA 23ms3860kbC++201013b2024-11-04 13:08:182024-11-04 13:08:18

Judging History

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

  • [2024-11-04 13:08:18]
  • 评测
  • 测评结果:WA
  • 用时:23ms
  • 内存:3860kb
  • [2024-11-04 13:08:18]
  • 提交

answer

#include<bits/stdc++.h>
//#define int long long

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    std::cout.tie(0);

    int T;std::cin >> T;
    while (T--)
    {
        int n;std::cin>>n;

        std::vector<int> a(n+1,0),cnt(n+1,0),suf(n+1,0);
        for(int i = 1;i<=n;++i)std::cin>>a[i];

        int mx = 0,mi = 0;
        for(int i = n;i >= 1;--i)
        {
            if(cnt[a[i]] == mx)suf[i] = mi;
            else suf[i] = mx;
            cnt[a[i]]++;
            if(cnt[a[i]] > mx)mi = mx,mx = cnt[a[i]];
            else if(cnt[a[i]] > mi)mi = cnt[a[i]];
        }

        int ans = 0;
        for(int i = 1;i<=n;++i)
        {
            int x = cnt[a[i]],y = suf[i],z = x & y;
            //std::cout<<x<<" "<<y<<" "<<z<<"\n";
            while(z - (z & -z) > 0)z -= (z & -z);
            z = std::max(z,1);
            ans = std::max(ans,(x | y) | (z - 1));
        }

        std::cout<<ans<<"\n";
    }

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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: 20ms
memory: 3676kb

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: 23ms
memory: 3596kb

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
6
3
3
3
3
3
3
3
3
3
3
3
6
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
3
6
3
3
3
3
6
3
3
3
6
3
3
3
3
3
3
3
3
3
3
6
3
3
3
3
3
3
3
3
3
3
3
6
3
3
3
1
3
3
3
3
3
3
6
3
3
3
3
3
3
3
3
3
3
...

result:

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