QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#44180 | #4565. Rarest Insects | zghtyarecrenj | 0 | 10ms | 3848kb | C++17 | 764b | 2022-08-13 14:23:25 | 2022-08-13 14:23:27 |
Judging History
answer
#include "insects.h"
#include <bits/stdc++.h>
int a[2005], b[2005];
int min_cardinality(int N) {
int col = 0;
for (int i = 0; i < N; ++i) {
move_inside(i);
if (i && press_button() > 1) move_outside(i);
else ++col, a[i] = 1;
}
int L = 1, R = N, num = col;
while (L <= R) {
int mid = (L + R) >> 1;
for (int i = 0; i < N; ++i)
if (!a[i] && !b[i]) {
move_inside(i);
if (press_button() > mid) move_outside(i);
else a[i] = 2, ++num;
if (num >= col * mid) break;
}
if (num >= col * mid) {
L = mid + 1;
for (int i = 0; i < N; ++i) if (a[i] == 2) a[i] = 1;
} else {
R = num / col;
for (int i = 0; i < N; ++i) if (a[i] == 2) move_outside(i), a[i] = 0; else b[i] = 1;
}
}
return R;
}
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3736kb
input:
6 1 1 2 2 2 2 2 3 2 2
output:
8 0 0 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 0 3 8 2 8 0 4 8 2 8 0 5 8 2 8 1 3 8 1 4 8 1 5 8 0 3 8 2 8 1 3 8 0 3 8 2 8 3 2
result:
wrong answer Wrong answer.
Subtask #2:
score: 0
Wrong Answer
Test #24:
score: 15
Accepted
time: 1ms
memory: 3832kb
input:
1000 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2...
output:
8 0 0 8 0 1 8 2 8 1 1 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 0 5 8 2 8 1 5 8 0 6 8 2 8 1 6 8 0 7 8 2 8 1 7 8 0 8 8 2 8 1 8 8 0 9 8 2 8 1 9 8 0 10 8 2 8 1 10 8 0 11 8 2 8 1 11 8 0 12 8 2 8 1 12 8 0 13 8 2 8 1 13 8 0 14 8 2 8 1 14 8 0 15 8 2 8 1 15 8 0 16 8 2 8 1 16 8 0 17 8 2 8 1 17 8 0 18...
result:
ok
Test #25:
score: 0
Accepted
time: 10ms
memory: 3688kb
input:
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1...
output:
8 0 0 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 0 28...
result:
ok
Test #26:
score: 0
Accepted
time: 7ms
memory: 3684kb
input:
999 1 1 1 1 1 1 1 1 2 1 1 1 1 2 2 1 1 1 1 1 1 2 2 2 2 2 2 2 2 1 2 2 1 2 2 2 2 1 1 1 1 2 2 1 2 1 1 2 2 2 1 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
output:
8 0 0 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 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 1 14 8 0 15 8 2 8 1 15 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 1 22 8 0 23 8 2 8 1 23 8 0 24 8 2 8 1 2...
result:
ok
Test #27:
score: -15
Wrong Answer
time: 2ms
memory: 3760kb
input:
999 1 1 1 1 2 1 1 1 2 2 1 1 1 2 1 1 1 1 1 2 2 1 2 1 2 1 2 1 2 1 2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 1 2 2 2 1 2 2 2 2 1 2 2 2 2 2 2 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 2 2 2 2 2 2 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ...
output:
8 0 0 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 0 8 8 2 8 0 9 8 2 8 1 9 8 0 10 8 2 8 1 10 8 0 11 8 2 8 0 12 8 2 8 0 13 8 2 8 0 14 8 2 8 1 14 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 1 20 8 0 21 8 2 8 1 21 8 0 22 8 2 8 0 23 8 2 8 1 23 8 0...
result:
wrong answer Wrong answer.
Subtask #3:
score: 0
Wrong Answer
Test #43:
score: 75
Accepted
time: 3ms
memory: 3804kb
input:
2 2 2 2
output:
8 0 0 8 0 1 8 2 8 1 1 8 0 1 8 2 8 1 1 8 0 1 8 2 8 3 2
result:
ok
Test #44:
score: 75
Accepted
time: 3ms
memory: 3848kb
input:
2 1
output:
8 0 0 8 0 1 8 2 8 3 1
result:
ok
Test #45:
score: 75
Accepted
time: 0ms
memory: 3804kb
input:
3 1 2 2 2
output:
8 0 0 8 0 1 8 2 8 0 2 8 2 8 1 2 8 0 2 8 2 8 1 2 8 0 2 8 2 8 1 2 8 3 1
result:
ok
Test #46:
score: 0
Wrong Answer
time: 4ms
memory: 3684kb
input:
6 2 1 2 2 2 2 3 4 4 2 2
output:
8 0 0 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 0 1 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 1 8 1 3 8 0 1 8 2 8 1 1 8 0 1 8 2 8 3 2
result:
wrong answer Wrong answer.