QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#649254#8332. Two in OneSredWA 91ms3708kbC++17649b2024-10-17 22:19:132024-10-17 22:19:13

Judging History

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

  • [2024-10-17 22:19:13]
  • 评测
  • 测评结果:WA
  • 用时:91ms
  • 内存:3708kb
  • [2024-10-17 22:19:13]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 5;
const int mod = 1e9 + 7;

int a[maxn];
void solve(){
      
    unordered_map<int,int> mp;
   int n;
   cin >> n;
   for(int i = 1;i <= n ;i ++) cin >> a[i],mp[a[i]]++;
   if(n == 1){
   	  cout << a[1] << endl;
   	  return;
   }
   int id = 0,id1 = 0;
   int mx = 0;
   for(auto [x,y] : mp){
   	     if(y >= mx) id1 = id,id = x,mx = y;
   }
   mx = 0;
   for(int i = 1 ;i <= mp[id1];i ++) mx = max(mx,mp[id] | i);
   cout << mx << endl;

}
int main(){
    

    int t = 1;
    cin >> t;
    while(t--){
    	solve();
    }	 
   return 0;
}

详细

Test #1:

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

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

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: 52ms
memory: 3708kb

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: 91ms
memory: 3508kb

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
5
3
3
3
3
3
3
3
3
3
3
3
5
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
0
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
5
3
3
3
5
3
3
3
3
3
0
3
3
3
3
5
3
3
3
0
3
3
3
3
3
3
3
5
3
3
3
1
3
3
3
3
3
0
5
3
3
3
3
3
3
3
3
3
3
...

result:

wrong answer 56th numbers differ - expected: '3', found: '0'