QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#142704 | #4565. Rarest Insects | Qwerty1232# | 0 | 8ms | 4084kb | C++20 | 1.1kb | 2023-08-19 18:15:33 | 2024-07-04 01:49:02 |
answer
#include "insects.h"
#include <numeric>
#include <vector>
int min_cardinality(int n) {
int beg = 0, end = n;
while (beg + 1 < end) {
int mid = (beg + end) / 2;
std::vector<bool> fucked(n);
std::vector<int> vec;
for (int i = 0; i < n; i++) {
move_inside(i);
if (mid < press_button()) {
fucked[i] = true;
move_outside(i);
} else {
vec.push_back(i);
}
}
for (int i : vec) {
move_outside(i);
}
vec.clear();
for (int i = n - 1; i >= 0; i--) {
move_inside(i);
if (mid < press_button()) {
fucked[i] = true;
move_outside(i);
} else {
vec.push_back(i);
}
}
for (int i : vec) {
move_outside(i);
}
vec.clear();
if (std::accumulate(fucked.begin(), fucked.end(), 0) == n) {
beg = mid;
} else {
end = mid;
}
}
return end;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 10
Accepted
time: 1ms
memory: 3796kb
input:
6 1 1 1 2 2 3 1 2 2 3 3 3 1 1 1 2 2 2 1 2 1 2 1 2
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 0 5 8 2 8 1 0 8 1 1 8 1 2 8 1 3 8 1 4 8 1 5 8 0 5 8 2 8 0 4 8 2 8 0 3 8 2 8 0 2 8 2 8 0 1 8 2 8 0 0 8 2 8 1 5 8 1 4 8 1 3 8 1 2 8 1 1 8 1 0 8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 1 3 8 0 4 8 2 8 1 4 8 0 5 8 2 8 1 5 8 1 0 8 1 1 8 1 2 8 0 5 8 2 8 ...
result:
ok
Test #2:
score: 0
Accepted
time: 1ms
memory: 3728kb
input:
2 1 2 1 2
output:
8 0 0 8 2 8 0 1 8 2 8 1 1 8 1 0 8 0 1 8 2 8 0 0 8 2 8 1 0 8 1 1 8 3 2
result:
ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3784kb
input:
2 1 1 1 1
output:
8 0 0 8 2 8 0 1 8 2 8 1 0 8 1 1 8 0 1 8 2 8 0 0 8 2 8 1 1 8 1 0 8 3 1
result:
ok
Test #4:
score: 0
Accepted
time: 1ms
memory: 4068kb
input:
3 1 1 2 1 2 1
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 1 2 8 1 0 8 1 1 8 0 2 8 2 8 0 1 8 2 8 1 1 8 0 0 8 2 8 1 2 8 1 0 8 3 1
result:
ok
Test #5:
score: 0
Accepted
time: 1ms
memory: 3860kb
input:
5 1 1 2 2 3 1 2 2 2 3 1 1 2 2 2 1 2 1 2 2
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 1 4 8 1 0 8 1 1 8 1 2 8 1 3 8 0 4 8 2 8 0 3 8 2 8 0 2 8 2 8 0 1 8 2 8 0 0 8 2 8 1 0 8 1 4 8 1 3 8 1 2 8 1 1 8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 1 2 8 0 3 8 2 8 1 3 8 0 4 8 2 8 1 4 8 1 0 8 1 1 8 0 4 8 2 8 0 3 8 2 8 1 3 8 0 2 8 2 8 0 1 8 2 8 1 1 8 0 0 8 ...
result:
ok
Test #6:
score: 0
Accepted
time: 1ms
memory: 3784kb
input:
8 1 1 2 3 4 5 4 4 1 1 1 2 3 4 5 4 1 1 2 3 3 3 2 2 1 1 1 2 3 3 3 2 1 1 2 2 2 2 2 1 1 1 1 2 2 2 2 2
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 0 5 8 2 8 1 5 8 0 6 8 2 8 0 7 8 2 8 1 0 8 1 1 8 1 2 8 1 3 8 1 4 8 1 6 8 1 7 8 0 7 8 2 8 0 6 8 2 8 0 5 8 2 8 0 4 8 2 8 0 3 8 2 8 0 2 8 2 8 0 1 8 2 8 1 1 8 0 0 8 2 8 1 7 8 1 6 8 1 5 8 1 4 8 1 3 8 1 2 8 1 0 8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 1 ...
result:
ok
Test #7:
score: -10
Wrong Answer
time: 3ms
memory: 3788kb
input:
199 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 100 ...
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 0 5 8 2 8 0 6 8 2 8 0 7 8 2 8 0 8 8 2 8 0 9 8 2 8 0 10 8 2 8 0 11 8 2 8 0 12 8 2 8 0 13 8 2 8 0 14 8 2 8 0 15 8 2 8 0 16 8 2 8 0 17 8 2 8 0 18 8 2 8 0 19 8 2 8 0 20 8 2 8 0 21 8 2 8 0 22 8 2 8 0 23 8 2 8 0 24 8 2 8 0 25 8 2 8 0 26 8 2 8 0 27 8 2 8 ...
result:
wrong answer Wrong answer.
Subtask #2:
score: 0
Wrong Answer
Test #24:
score: 0
Wrong Answer
time: 8ms
memory: 3736kb
input:
1000 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101...
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 0 5 8 2 8 0 6 8 2 8 0 7 8 2 8 0 8 8 2 8 0 9 8 2 8 0 10 8 2 8 0 11 8 2 8 0 12 8 2 8 0 13 8 2 8 0 14 8 2 8 0 15 8 2 8 0 16 8 2 8 0 17 8 2 8 0 18 8 2 8 0 19 8 2 8 0 20 8 2 8 0 21 8 2 8 0 22 8 2 8 0 23 8 2 8 0 24 8 2 8 0 25 8 2 8 0 26 8 2 8 0 27 8 2 8 ...
result:
wrong answer Wrong answer.
Subtask #3:
score: 0
Wrong Answer
Test #43:
score: 75
Accepted
time: 1ms
memory: 4084kb
input:
2 1 2 1 2
output:
8 0 0 8 2 8 0 1 8 2 8 1 1 8 1 0 8 0 1 8 2 8 0 0 8 2 8 1 0 8 1 1 8 3 2
result:
ok
Test #44:
score: 75
Accepted
time: 1ms
memory: 3756kb
input:
2 1 1 1 1
output:
8 0 0 8 2 8 0 1 8 2 8 1 0 8 1 1 8 0 1 8 2 8 0 0 8 2 8 1 1 8 1 0 8 3 1
result:
ok
Test #45:
score: 75
Accepted
time: 1ms
memory: 3780kb
input:
3 1 1 2 1 2 1
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 1 2 8 1 0 8 1 1 8 0 2 8 2 8 0 1 8 2 8 1 1 8 0 0 8 2 8 1 2 8 1 0 8 3 1
result:
ok
Test #46:
score: 70.33
Acceptable Answer
time: 1ms
memory: 3784kb
input:
6 1 2 2 3 4 4 1 2 3 3 4 4 1 2 1 2 2 2 1 2 2 1 2 2
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 1 4 8 0 5 8 2 8 1 5 8 1 0 8 1 1 8 1 2 8 1 3 8 0 5 8 2 8 0 4 8 2 8 0 3 8 2 8 0 2 8 2 8 0 1 8 2 8 1 1 8 0 0 8 2 8 1 0 8 1 5 8 1 4 8 1 3 8 1 2 8 0 0 8 2 8 0 1 8 2 8 1 1 8 0 2 8 2 8 0 3 8 2 8 1 3 8 0 4 8 2 8 1 4 8 0 5 8 2 8 1 5 8 1 0 8 1 2 8 0 5 8 2 8 ...
result:
points 0.93773333330 points 0.93773333330
Test #47:
score: 0
Wrong Answer
time: 0ms
memory: 3868kb
input:
10 1 1 2 3 3 3 4 4 5 6 1 2 2 3 4 5 5 5 5 6 1 1 2 3 2 3 3 3 3 3 1 2 2 3 3 3 2 3 3 3 1 1 2 3 3 3 4 4 4 4 1 2 2 3 4 4 3 3 4 4
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 0 5 8 2 8 0 6 8 2 8 0 7 8 2 8 0 8 8 2 8 0 9 8 2 8 1 9 8 1 0 8 1 1 8 1 2 8 1 3 8 1 4 8 1 5 8 1 6 8 1 7 8 1 8 8 0 9 8 2 8 0 8 8 2 8 0 7 8 2 8 0 6 8 2 8 0 5 8 2 8 0 4 8 2 8 0 3 8 2 8 0 2 8 2 8 0 1 8 2 8 0 0 8 2 8 1 0 8 1 9 8 1 8 8 1 7 8 1 6 8 1 5 8 1 ...
result:
wrong answer Wrong answer.