QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#655677	#8332. Two in One	rizynvu	RE	21ms	3924kb	C++14	691b	2024-10-19 09:08:28	2024-10-19 09:08:28

Judging History

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

[2024-10-19 09:08:28]
评测

测评结果：RE
用时：21ms
内存：3924kb

查看

[2024-10-19 09:08:28]
提交

answer

#include<bits/stdc++.h>
const int maxn = 1e5 + 10;
int c[maxn];
inline void solve() {
   int n;
   scanf("%d", &n);
   memset(c + 1, 0, sizeof(int) * n);
   for (int i = 1, x; i <= n; i++) {
      scanf("%d", &x), c[x]++;
   }
   int mx = 0, fmx = 0;
   for (int i = 1; i <= n; i++) {
      if (c[i] > mx) fmx = mx, mx = c[i];
      else if (c[i] > fmx) fmx = c[i];
   }
   if (! fmx) return printf("%d\n", mx), void();
   for (int w = 20; ~ w; w--) {
      if ((mx >> w & 1) && (fmx >> w & 1))
         return printf("%d\n", mx | fmx | ((1 << w) - 1)), void();
   }
   assert(false);
}
int main() {
   for (int T, _ = scanf("%d", &T); T--; ) solve();
   return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3732kb

input:

1
7
1 2 3 4 3 2 1

output:

result:

ok 1 number(s): "3"

Test #2:

score: 0

Accepted

time: 0ms

memory: 3924kb

input:

1
9
1 1 1 1 1 2 2 2 2

output:

result:

ok 1 number(s): "7"

Test #3:

score: 0

Accepted

time: 21ms

memory: 3772kb

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:

result:

ok 50 numbers

Test #4:

score: -100

Runtime Error

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