QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#519793 | #4565. Rarest Insects | kimmoqt# | 0 | 84ms | 4056kb | C++20 | 2.6kb | 2024-08-15 01:52:55 | 2024-08-15 01:52:56 |
Judging History
answer
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
int min_cardinality(int N) {
vector<bool> vis(N);
// strategy 1 : large max cardinality
while(true) {
vector<int> inc;
int lst=0;
for(int i=0;i<N;i++) {
if(vis[i]) continue;
move_inside(i);
int cur=press_button();
if(cur>lst) {
lst=cur;
inc.push_back(i);
}
}
for(int i=N-1;i>inc.back();i--) {
if(vis[i]) continue;
move_outside(i);
}
for(int i=inc.back();i>=0;i--) {
if(vis[i]) continue;
move_outside(i);
int cur=press_button();
if(cur<lst) {
vis[i]=true;
}
move_inside(i);
}
for(int i=0;i<=inc.back();i++) {
if(vis[i]) continue;
move_outside(i);
}
bool ok=1;
for(int i=0;i<N;i++) {
ok&=vis[i];
}
if(ok) return lst;
if(lst<=40) break;
}
// strategy 2 : small max cardinality
vector<int> pos;
for(int i=0;i<N;i++) {
if(vis[i]) continue;
move_inside(i);
if(press_button()==2) {
move_outside(i);
} else {
vis[i]=true;
pos.push_back(i);
}
}
int p=pos.size(),res=1;
while(true) {
for(auto x:pos) {
move_outside(x);
}
pos.clear();
for(int i=0;i<N;i++) {
if(vis[i]) continue;
move_inside(i);
if(press_button()==2) {
move_outside(i);
} else {
vis[i]=true;
pos.push_back(i);
}
}
if(pos.size()!=p) break;
res++;
}
return res;
}
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 10
Accepted
time: 1ms
memory: 3788kb
input:
6 1 1 1 2 2 3 2 2 3 2 3 3 3 3 3
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 2 8 0 5 8 1 4 8 2 8 0 4 8 1 3 8 2 8 0 3 8 1 2 8 2 8 0 2 8 1 1 8 2 8 0 1 8 1 0 8 2 8 0 0 8 1 0 8 1 1 8 1 3 8 0 0 8 2 8 0 1 8 2 8 0 3 8 2 8 1 0 8 1 1 8 1 3 8 3 1
result:
ok
Test #2:
score: 10
Accepted
time: 0ms
memory: 3768kb
input:
2 1 2 1 1
output:
8 0 0 8 2 8 0 1 8 2 8 1 1 8 2 8 0 1 8 1 0 8 2 8 0 0 8 3 2
result:
ok
Test #3:
score: 10
Accepted
time: 0ms
memory: 4056kb
input:
2 1 1 0 1
output:
8 0 0 8 2 8 0 1 8 2 8 1 1 8 1 0 8 2 8 0 0 8 0 1 8 2 8 1 1 8 3 1
result:
ok
Test #4:
score: 0
Wrong Answer
time: 42ms
memory: 3772kb
input:
3 1 1 2 1 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 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 2 8 0 1 8 2 8 0 2 8 2 8 1 2 8 2 8 0 2 8 1 1 8 2 8 0 1 8 1 0 8 2 8 0 0 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 ...
result:
wrong answer Too many queries.
Subtask #2:
score: 0
Wrong Answer
Test #24:
score: 15
Accepted
time: 0ms
memory: 3780kb
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:
ok
Test #25:
score: 15
Accepted
time: 3ms
memory: 3804kb
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 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:
ok
Test #26:
score: 0
Wrong Answer
time: 3ms
memory: 3804kb
input:
999 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 4 5 5 5 5 5 5 5 5 5 5 5 5 5 5 5 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 6 7 7 7 7 7 7 7 7 7 7 7 7 7 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 ...
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: 3796kb
input:
2 1 2 1 1
output:
8 0 0 8 2 8 0 1 8 2 8 1 1 8 2 8 0 1 8 1 0 8 2 8 0 0 8 3 2
result:
ok
Test #44:
score: 75
Accepted
time: 0ms
memory: 3772kb
input:
2 1 1 0 1
output:
8 0 0 8 2 8 0 1 8 2 8 1 1 8 1 0 8 2 8 0 0 8 0 1 8 2 8 1 1 8 3 1
result:
ok
Test #45:
score: 0
Wrong Answer
time: 84ms
memory: 3776kb
input:
3 1 1 2 1 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 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 2 8 0 1 8 2 8 0 2 8 2 8 1 2 8 2 8 0 2 8 1 1 8 2 8 0 1 8 1 0 8 2 8 0 0 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 2 8 1 0 8 0 0 8 ...
result:
wrong answer Too many queries.