QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#626787#8332. Two in OneKJJDWA 28ms5844kbC++20937b2024-10-10 13:01:442024-10-10 13:01:44

Judging History

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

  • [2024-10-10 13:01:44]
  • 评测
  • 测评结果:WA
  • 用时:28ms
  • 内存:5844kb
  • [2024-10-10 13:01:44]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const int N = 1e6 + 7;
#define lc p << 1
#define rc p << 1 | 1
// mt19937_64 rng{chrono::steady_clock::now().time_since_epoch().count()};//随机数
ll a[N], b[N];
int lowbit(int x)
{
	return x&(-x);
}
void slove()
{
    ll n, m, k;
    cin >> n;
    vector<int> cnt(n + 1, 0);
    for (int i = 1; i <= n; i++)
        cin >> a[i], cnt[a[i]]++;
    priority_queue<int> q;
    for (int i = 1; i <= n; i++)
        q.push(cnt[i]);
	int mx,mmx;
	mx=q.top(),q.pop();
	mmx=q.top(),q.pop();
	int tmp=mx&mmx;
	while(tmp!=lowbit(tmp))
		tmp-=lowbit(tmp);
	int xx=(mx|mmx)|(tmp-1);
	cout<<xx<<'\n';
}
int main()
{

    // cout << fixed << setprecision(10);
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t;
    cin >> t;
    while (t--)
        slove();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 5604kb

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

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: 17ms
memory: 5844kb

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: 28ms
memory: 5644kb

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'