QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#537754 | #4565. Rarest Insects | Yahia_Emara# | 0 | 11ms | 6188kb | C++20 | 2.1kb | 2024-08-30 18:02:53 | 2024-08-30 18:02:53 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define sz(x) int(x.size())
#define dbg(x) cout << (#x) << " : " << x << endl
#define pb push_back
#define bk(x) x.back()
#define all(x) x.begin(),x.end()
#define LOOP(n) for(int rp=0;rp<n;rp++)
#define sq(x) ((x)*(x))
typedef long long ll;
typedef long double dl;
const int SZ=5e5+7;
const ll INF=1e18+7;
const dl eps=1e-9;
int MOD=1e9+7;
mt19937_64 rng(time(0));
int rnd(int l,int r){
return uniform_int_distribution<int>(l,r)(rng);
}
ll trig(ll x){
return x*(x+1)/2;
}
int getN(){
int n;cin >> n;
return n;
}
#define cmbntrcs fact[0]=1;for(int i=1;i<SZ;i++)fact[i]=mul(fact[i-1],i);finv[SZ-1]=inv(fact[SZ-1]);for(int i=SZ-2;i>0;i--)finv[i]=mul(finv[i+1],i+1);
int fact[SZ],finv[SZ];
int add(int x,int y,int MOD=MOD){
x+=y;if(x>=MOD)x-=MOD;
return x;
}
int sub(int x,int y,int MOD=MOD){
x-=y;if(x<0)x+=MOD;
return x;
}
int mul(int x,int y,int MOD=MOD){
return(x*1ll*y)%MOD;
}
int pwr(int x,ll b,int MOD=MOD){
int rt=1;
while(b>0){
if(b&1)rt=mul(rt,x,MOD);
x=mul(x,x,MOD),b>>=1;
}
return rt;
}
int inv(int x,int MOD=MOD){
return pwr(x,MOD-2,MOD);
}
#include "insects.h"
//#include "stub.cpp"
int n,p[SZ],a[SZ],vs[SZ];
vector<int>v;
void ins(int i){
move_inside(i);
v.pb(i);
}
void dlt(){
move_outside(bk(v));
v.pop_back();
}
int card(){
return press_button();
}
int k;
bool f(int c){
for(int i=0;i<n;i++){
ins(i);
if(card()>c)dlt();
}
if(sz(v)==c*k)return 1;
return 0;
}
int min_cardinality(int N){
n=N;
for(int i=0;i<n;i++){
ins(i);
if(card()>1)dlt();
}
k=sz(v);
while(sz(v))dlt();
int l=2,r=n,ans=1;
while(l<=r){
int md=(l+r)>>1;
if(f(md))l=md+1,ans=md;
else r=md-1;
}
return ans;
}
/*int main(){
ios_base::sync_with_stdio(0);cin.tie(0);
//cout << fixed << setprecision(12);
int tt=1;
//cin >> tt;
LOOP(tt){
//code
}
return 0;
}*/
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: 6188kb
input:
6 1 1 1 2 2 2 1 1 1 2 2 3 3 3 3 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 1 3 8 0 4 8 2 8 1 4 8 0 5 8 2 8 1 5 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 0 4 8 2 8 0 5 8 2 8 0 0 8 2 8 1 0 8 0 1 8 2 8 1 1 8 0 2 8 2 8 1 2 8 0 3 8 2 8 0 4 8 2 8 0 5 8 2 8 3 1
result:
ok
Test #2:
score: 10
Accepted
time: 0ms
memory: 5980kb
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 0 8 2 8 0 1 8 2 8 3 2
result:
ok
Test #3:
score: 10
Accepted
time: 1ms
memory: 5840kb
input:
2 1 1 1 1
output:
8 0 0 8 2 8 0 1 8 2 8 1 1 8 1 0 8 0 0 8 2 8 0 1 8 2 8 3 1
result:
ok
Test #4:
score: 10
Accepted
time: 0ms
memory: 5848kb
input:
3 1 1 2 1 1 2
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 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 3 1
result:
ok
Test #5:
score: 0
Wrong Answer
time: 0ms
memory: 5980kb
input:
5 1 1 2 2 2 1 1 2 2 3 3 2 2 2 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 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 0 4 8 2 8 0 0 8 2 8 1 0 8 0 1 8 2 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 3 1
result:
wrong answer Wrong answer.
Subtask #2:
score: 0
Wrong Answer
Test #24:
score: 0
Wrong Answer
time: 11ms
memory: 5972kb
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: 0ms
memory: 5920kb
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 0 8 2 8 0 1 8 2 8 3 2
result:
ok
Test #44:
score: 75
Accepted
time: 0ms
memory: 6184kb
input:
2 1 1 1 1
output:
8 0 0 8 2 8 0 1 8 2 8 1 1 8 1 0 8 0 0 8 2 8 0 1 8 2 8 3 1
result:
ok
Test #45:
score: 75
Accepted
time: 1ms
memory: 5912kb
input:
3 1 1 2 1 1 2
output:
8 0 0 8 2 8 0 1 8 2 8 0 2 8 2 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 3 1
result:
ok
Test #46:
score: 75
Accepted
time: 1ms
memory: 5888kb
input:
6 1 2 1 2 2 2 1 2 2 3 4 5 4 3 2 2 2 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 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 0 4 8 2 8 0 5 8 2 8 1 5 8 0 0 8 2 8 1 0 8 0 1 8 2 8 1 1 8 0 2 8 2 8 0 3 8 2 8 0 4 8 2 8 0 5 8 2 8 1 5 8 3 1
result:
ok
Test #47:
score: 0
Wrong Answer
time: 1ms
memory: 5916kb
input:
10 1 1 2 2 2 2 2 2 2 2 1 1 2 3 3 3 4 4 5 6 6 5 5 5 5 4 3 3 3 3 4 3 3 3 4 4 3 2 2 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 1 7 8 0 8 8 2 8 1 8 8 0 9 8 2 8 1 9 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 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 0 8 2 8 1 0 8 0 1 8 2 8 1 1 8 0 2 8 ...
result:
wrong answer Wrong answer.