QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#44251 | #4565. Rarest Insects | aurelion_sol | 0 | 42ms | 3876kb | C++14 | 715b | 2022-08-14 12:58:47 | 2022-08-14 12:58:49 |
Judging History
answer
#include"insects.h"
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;++i)
#define pb push_back
#define s(x) int(x.size())
using namespace std;
typedef vector<int> VI;
VI a,b,c;
mt19937 rnd(time(0));
int min_cardinality(int n){
int m=0,r=1;
rep(i,0,n){
move_inside(i);
if(press_button()>1)move_outside(i),a.pb(i);
else ++m;
}
for(;s(a)>=m;){
shuffle(a.begin(),a.end(),rnd);
int l=(s(a)/m+1)/2;
for(int i:a){
move_inside(i);
if(press_button()>r+l)move_outside(i),b.pb(i);
else{
c.pb(i);
if(s(c)==l*m)break;
}
}
if(s(c)<l*m){
for(int i:c)move_outside(i);
a=c;
}else{
r+=l,a=b;
}
b.clear(),c.clear();
}
return r;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 10
Accepted
time: 0ms
memory: 3820kb
input:
6 1 1 1 2 2 2 2 3 2
output:
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 0 5 8 2 8 0 4 8 2 8 1 4 8 0 3 8 2 8 1 5 8 1 3 8 3 1
result:
ok
Test #2:
score: 0
Accepted
time: 3ms
memory: 3712kb
input:
2 1 2 2
output:
8 0 0 8 2 8 0 1 8 2 8 1 1 8 0 1 8 2 8 3 2
result:
ok
Test #3:
score: 0
Accepted
time: 1ms
memory: 3848kb
input:
2 1 1
output:
8 0 0 8 2 8 0 1 8 2 8 3 1
result:
ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3804kb
input:
3 1 1 2
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 1 2 8 3 1
result:
ok
Test #5:
score: 0
Accepted
time: 3ms
memory: 3876kb
input:
5 1 1 2 2 2 2 3 2
output:
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 0 4 8 2 8 0 3 8 2 8 1 3 8 0 2 8 2 8 3 2
result:
ok
Test #6:
score: 0
Accepted
time: 3ms
memory: 3688kb
input:
8 1 1 2 2 2 2 2 1 2 3 3 3 2
output:
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 0 5 8 2 8 1 5 8 0 6 8 2 8 1 6 8 0 7 8 2 8 0 4 8 2 8 0 3 8 2 8 1 3 8 0 5 8 2 8 1 5 8 0 2 8 2 8 1 2 8 0 6 8 2 8 1 4 8 1 6 8 3 1
result:
ok
Test #7:
score: -10
Wrong Answer
time: 4ms
memory: 3848kb
input:
199 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 2 2 2 ...
output:
8 0 0 8 2 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 ...
result:
wrong answer Wrong answer.
Subtask #2:
score: 0
Wrong Answer
Test #24:
score: 0
Wrong Answer
time: 42ms
memory: 3812kb
input:
1000 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 2 2 2...
output:
8 0 0 8 2 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 ...
result:
wrong answer Wrong answer.
Subtask #3:
score: 0
Wrong Answer
Test #43:
score: 75
Accepted
time: 3ms
memory: 3804kb
input:
2 1 2 2
output:
8 0 0 8 2 8 0 1 8 2 8 1 1 8 0 1 8 2 8 3 2
result:
ok
Test #44:
score: 75
Accepted
time: 0ms
memory: 3736kb
input:
2 1 1
output:
8 0 0 8 2 8 0 1 8 2 8 3 1
result:
ok
Test #45:
score: 75
Accepted
time: 2ms
memory: 3824kb
input:
3 1 1 2
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 8 1 2 8 3 1
result:
ok
Test #46:
score: 75
Accepted
time: 3ms
memory: 3688kb
input:
6 1 2 1 2 2 2 2 3 3 3
output:
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 0 1 8 2 8 0 3 8 2 8 1 3 8 0 5 8 2 8 1 5 8 0 4 8 2 8 1 4 8 1 1 8 3 1
result:
ok
Test #47:
score: 0
Wrong Answer
time: 2ms
memory: 3812kb
input:
10 1 1 2 2 2 2 2 2 2 2 2 3 3 3
output:
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 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 2 8 2 8 0 3 8 2 8 0 6 8 2 8 0 8 8 2 8 3 3
result:
wrong answer Wrong answer.