Submission #842115

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
842115	2023-09-02T12:17:11 Z	maroonrk	Rarest Insects (IOI22_insects)	C++17	100 / 100	31 ms	1116 KB

insects

#include "insects.h"

#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#endif

#include <bits/stdc++.h>
using namespace std;

using ll=long long;
//#define int ll

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}

template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;

using pi=pair<int,int>;
using vi=vc<int>;

template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
	return os<<"{"<<p.a<<","<<p.b<<"}";
}

template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
	os<<"{";
	for(auto e:v)os<<e<<",";
	return os<<"}";
}

#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
	os<<t<<" ";
	dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif

using uint=unsigned;
using ull=unsigned long long;

template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
	return os<<vc<t>(all(a));
}

template<int i,class T>
void print_tuple(ostream&,const T&){
}

template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
	if(i)os<<",";
	os<<get<i>(t);
	print_tuple<i+1,T,Args...>(os,t);
}

template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
	os<<"{";
	print_tuple<0,tuple<Args...>,Args...>(os,t);
	return os<<"}";
}

ll read(){
	ll i;
	cin>>i;
	return i;
}

vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=read()+off;
	return v;
}

pi readpi(int off=0){
	int a,b;cin>>a>>b;
	return pi(a+off,b+off);
}

template<class t>
void print_single(t x,int suc=1){
	cout<<x;
	if(suc==1)
		cout<<"\n";
	if(suc==2)
		cout<<" ";
}

template<class t,class u>
void print_single(const pair<t,u>&p,int suc=1){
	print_single(p.a,2);
	print_single(p.b,suc);
}

template<class T>
void print_single(const vector<T>&v,int suc=1){
	rep(i,v.size())
		print_single(v[i],i==int(v.size())-1?suc:2);
}

template<class T>
void print_offset(const vector<T>&v,ll off,int suc=1){
	rep(i,v.size())
		print_single(v[i]+off,i==int(v.size())-1?suc:2);
}

template<class T,size_t N>
void print_single(const array<T,N>&v,int suc=1){
	rep(i,N)
		print_single(v[i],i==int(N)-1?suc:2);
}

template<class T>
void print(const T&t){
	print_single(t);
}

template<class T,class ...Args>
void print(const T&t,const Args&...args){
	print_single(t,2);
	print(args...);
}

string readString(){
	string s;
	cin>>s;
	return s;
}

template<class T>
T sq(const T& t){
	return t*t;
}

void YES(bool ex=true){
	cout<<"YES\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void NO(bool ex=true){
	cout<<"NO\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void Yes(bool ex=true){
	cout<<"Yes\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void No(bool ex=true){
	cout<<"No\n";
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
//#define CAPITAL
/*
void yes(bool ex=true){
	#ifdef CAPITAL
	cout<<"YES"<<"\n";
	#else
	cout<<"Yes"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void no(bool ex=true){
	#ifdef CAPITAL
	cout<<"NO"<<"\n";
	#else
	cout<<"No"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}*/
void possible(bool ex=true){
	#ifdef CAPITAL
	cout<<"POSSIBLE"<<"\n";
	#else
	cout<<"Possible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}
void impossible(bool ex=true){
	#ifdef CAPITAL
	cout<<"IMPOSSIBLE"<<"\n";
	#else
	cout<<"Impossible"<<"\n";
	#endif
	if(ex)exit(0);
	#ifdef LOCAL
	cout.flush();
	#endif
}

constexpr ll ten(int n){
	return n==0?1:ten(n-1)*10;
}

const ll infLL=LLONG_MAX/3;

#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif

int topbit(signed t){
	return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
	return t==0?-1:63-__builtin_clzll(t);
}
int topbit(ull t){
	return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int botbit(ull a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
int popcount(ull t){
	return __builtin_popcountll(t);
}
int bitparity(ll t){
	return __builtin_parityll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-1;
}
ull umask(int i){
	return (ull(1)<<i)-1;
}
ll minp2(ll n){
	if(n<=1)return 1;
	else return ll(1)<<(topbit(n-1)+1);
}

bool inc(int a,int b,int c){
	return a<=b&&b<=c;
}

template<class t> void mkuni(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

ll rand_int(ll l, ll r) { //[l, r]
	//#ifdef LOCAL
	static mt19937_64 gen;
	/*#else
	static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
	#endif*/
	return uniform_int_distribution<ll>(l, r)(gen);
}

ll rand_int(ll k){ //[0,k)
	return rand_int(0,k-1);
}

template<class t>
void myshuffle(vc<t>&a){
	rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}
template<class t>
bool bis(const vc<t>&v,const t&a){
	return binary_search(all(v),a);
}

vvc<int> readGraph(int n,int m){
	vvc<int> g(n);
	rep(i,m){
		int a,b;
		cin>>a>>b;
		//sc.read(a,b);
		a--;b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	return g;
}

vvc<int> readTree(int n){
	return readGraph(n,n-1);
}

template<class t>
vc<t> presum(const vc<t>&a){
	vc<t> s(si(a)+1);
	rep(i,si(a))s[i+1]=s[i]+a[i];
	return s;
}
vc<ll> presum(const vi&a){
	vc<ll> s(si(a)+1);
	rep(i,si(a))s[i+1]=s[i]+a[i];
	return s;
}
//BIT で数列を管理するときに使う (CF850C)
template<class t>
vc<t> predif(vc<t> a){
	gnr(i,1,si(a))a[i]-=a[i-1];
	return a;
}
template<class t>
vvc<ll> imos(const vvc<t>&a){
	int n=si(a),m=si(a[0]);
	vvc<ll> b(n+1,vc<ll>(m+1));
	rep(i,n)rep(j,m)
		b[i+1][j+1]=b[i+1][j]+b[i][j+1]-b[i][j]+a[i][j];
	return b;
}

//verify してないや
void transvvc(int&n,int&m){
	swap(n,m);
}
template<class t,class... Args>
void transvvc(int&n,int&m,vvc<t>&a,Args&...args){
	assert(si(a)==n);
	vvc<t> b(m,vi(n));
	rep(i,n){
		assert(si(a[i])==m);
		rep(j,m)b[j][i]=a[i][j];
	}
	a.swap(b);
	transvvc(n,m,args...);
}
//CF854E
void rotvvc(int&n,int&m){
	swap(n,m);
}
template<class t,class... Args>
void rotvvc(int&n,int&m,vvc<t>&a,Args&...args){
	assert(si(a)==n);
	vvc<t> b(m,vi(n));
	rep(i,n){
		assert(si(a[i])==m);
		rep(j,m)b[m-1-j][i]=a[i][j];
	}
	a.swap(b);
	rotvvc(n,m,args...);
}

//ソートして i 番目が idx[i]
//CF850C
template<class t>
vi sortidx(const vc<t>&a){
	int n=si(a);
	vi idx(n);iota(all(idx),0);
	sort(all(idx),[&](int i,int j){return a[i]<a[j];});
	return idx;
}
//vs[i]=a[idx[i]]
//例えば sortidx で得た idx を使えば単にソート列になって返ってくる
//CF850C
template<class t>
vc<t> a_idx(const vc<t>&a,const vi&idx){
	int n=si(a);
	assert(si(idx)==n);
	vc<t> vs(n);
	rep(i,n)vs[i]=a[idx[i]];
	return vs;
}
//CF850C
vi invperm(const vi&p){
	int n=si(p);
	vi q(n);
	rep(i,n)q[p[i]]=i;
	return q;
}

template<class t,class s=t>
s SUM(const vc<t>&a){
	return accumulate(all(a),s(0));
}

template<class t>
t MAX(const vc<t>&a){
	return *max_element(all(a));
}

template<class t>
pair<t,int> MAXi(const vc<t>&a){
	auto itr=max_element(all(a));
	return mp(*itr,itr-a.bg);
}

template<class t>
t MIN(const vc<t>&a){
	return *min_element(all(a));
}

template<class t>
pair<t,int> MINi(const vc<t>&a){
	auto itr=min_element(all(a));
	return mp(*itr,itr-a.bg);
}

template<class t,class u>
pair<t,u> operator+(const pair<t,u>&a,const pair<t,u>&b){
	return mp(a.a+b.a,a.b+b.b);
}

vi vid(int n){
	vi res(n);iota(all(res),0);
	return res;
}

template<class S>
S revv(S s){
	reverse(all(s));
	return s;
}

pi operator+(pi a,pi b){return pi(a.a+b.a,a.b+b.b);}

template<class t>
t gpp(vc<t>&vs){
	assert(si(vs));
	t res=move(vs.back());
	vs.pop_back();
	return res;
}

template<class t>
void pb(vc<t>&a,const vc<t>&b){
	a.insert(a.ed,all(b));
}

template<class t>
vc<t> cat(vc<t> a,const vc<t>&b){
	pb(a,b);
	return a;
}

template<class t,class u>
vc<t>& operator+=(vc<t>&a,u x){
	for(auto&v:a)v+=x;
	return a;
}

template<class t,class u>
vc<t> operator+(vc<t> a,u x){
	return a+=x;
}

template<class t,class u>
vc<t>& operator-=(vc<t>&a,u x){
	for(auto&v:a)v-=x;
	return a;
}

template<class t,class u>
vc<t>& operator-(vc<t> a,u x){
	return a-=x;
}

bool dbg=false;

int min_cardinality(int n){
	auto separate=[&](int cap,vi idx,int b=inf){
		myshuffle(idx);
		vi x,y;
		rep(pos,si(idx)){
			int i=idx[pos];
			move_inside(i);
			if(press_button()<=cap){
				x.pb(i);
				if(si(x)==b){
					rng(j,pos+1,si(idx)){
						y.pb(idx[j]);
					}
					break;
				}
			}else{
				y.pb(i);
				move_outside(i);
			}
		}
		for(auto i:x)move_outside(i);
		return mp(x,y);
	};
	auto [base,cur]=separate(1,vid(n));
	int w=si(base),ans=1;
	while(si(cur)>=w){
		int h=(si(cur)/w+1)/2;
		auto [x,y]=separate(h,cur,h*w);
		if(si(x)==w*h){
			ans+=h;
			cur=y;
		}else{
			cur=x;
		}
	}
	return ans;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	592 KB	Output is correct
3	Correct	0 ms	504 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	2 ms	604 KB	Output is correct
7	Correct	1 ms	600 KB	Output is correct
8	Correct	2 ms	600 KB	Output is correct
9	Correct	3 ms	444 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	2 ms	444 KB	Output is correct
12	Correct	3 ms	696 KB	Output is correct
13	Correct	2 ms	692 KB	Output is correct
14	Correct	2 ms	600 KB	Output is correct
15	Correct	2 ms	600 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	2 ms	600 KB	Output is correct
18	Correct	2 ms	852 KB	Output is correct
19	Correct	2 ms	600 KB	Output is correct
20	Correct	2 ms	344 KB	Output is correct
21	Correct	2 ms	600 KB	Output is correct
22	Correct	1 ms	440 KB	Output is correct

Subtask #2

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	592 KB	Output is correct
3	Correct	0 ms	504 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	2 ms	604 KB	Output is correct
7	Correct	1 ms	600 KB	Output is correct
8	Correct	2 ms	600 KB	Output is correct
9	Correct	3 ms	444 KB	Output is correct
10	Correct	2 ms	344 KB	Output is correct
11	Correct	2 ms	444 KB	Output is correct
12	Correct	3 ms	696 KB	Output is correct
13	Correct	2 ms	692 KB	Output is correct
14	Correct	2 ms	600 KB	Output is correct
15	Correct	2 ms	600 KB	Output is correct
16	Correct	3 ms	596 KB	Output is correct
17	Correct	2 ms	600 KB	Output is correct
18	Correct	2 ms	852 KB	Output is correct
19	Correct	2 ms	600 KB	Output is correct
20	Correct	2 ms	344 KB	Output is correct
21	Correct	2 ms	600 KB	Output is correct
22	Correct	1 ms	440 KB	Output is correct
23	Correct	10 ms	604 KB	Output is correct
24	Correct	5 ms	860 KB	Output is correct
25	Correct	9 ms	700 KB	Output is correct
26	Correct	13 ms	600 KB	Output is correct
27	Correct	13 ms	700 KB	Output is correct
28	Correct	5 ms	856 KB	Output is correct
29	Correct	12 ms	860 KB	Output is correct
30	Correct	15 ms	696 KB	Output is correct
31	Correct	13 ms	608 KB	Output is correct
32	Correct	14 ms	856 KB	Output is correct
33	Correct	14 ms	604 KB	Output is correct
34	Correct	10 ms	600 KB	Output is correct
35	Correct	15 ms	600 KB	Output is correct
36	Correct	14 ms	600 KB	Output is correct
37	Correct	13 ms	600 KB	Output is correct
38	Correct	11 ms	344 KB	Output is correct
39	Correct	9 ms	456 KB	Output is correct
40	Correct	7 ms	600 KB	Output is correct
41	Correct	5 ms	856 KB	Output is correct

Subtask #3

75.0 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	344 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	344 KB	Output is correct
5	Correct	0 ms	344 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	18 ms	696 KB	Output is correct
8	Correct	8 ms	860 KB	Output is correct
9	Correct	22 ms	968 KB	Output is correct
10	Correct	28 ms	604 KB	Output is correct
11	Correct	23 ms	952 KB	Output is correct
12	Correct	14 ms	604 KB	Output is correct
13	Correct	29 ms	1104 KB	Output is correct
14	Correct	26 ms	600 KB	Output is correct
15	Correct	20 ms	692 KB	Output is correct
16	Correct	24 ms	964 KB	Output is correct
17	Correct	27 ms	688 KB	Output is correct
18	Correct	26 ms	948 KB	Output is correct
19	Correct	22 ms	696 KB	Output is correct
20	Correct	23 ms	1116 KB	Output is correct
21	Correct	25 ms	1100 KB	Output is correct
22	Correct	25 ms	716 KB	Output is correct
23	Correct	28 ms	596 KB	Output is correct
24	Correct	24 ms	696 KB	Output is correct
25	Correct	16 ms	856 KB	Output is correct
26	Correct	11 ms	604 KB	Output is correct
27	Correct	21 ms	712 KB	Output is correct
28	Correct	24 ms	972 KB	Output is correct
29	Correct	19 ms	604 KB	Output is correct
30	Correct	26 ms	600 KB	Output is correct
31	Correct	27 ms	856 KB	Output is correct
32	Correct	31 ms	708 KB	Output is correct
33	Correct	24 ms	716 KB	Output is correct
34	Correct	27 ms	592 KB	Output is correct
35	Correct	19 ms	856 KB	Output is correct
36	Correct	25 ms	856 KB	Output is correct
37	Correct	24 ms	956 KB	Output is correct
38	Correct	27 ms	700 KB	Output is correct
39	Correct	27 ms	1112 KB	Output is correct
40	Correct	25 ms	1112 KB	Output is correct
41	Correct	24 ms	708 KB	Output is correct
42	Correct	23 ms	856 KB	Output is correct
43	Correct	5 ms	856 KB	Output is correct
44	Correct	17 ms	700 KB	Output is correct
45	Correct	17 ms	944 KB	Output is correct
46	Correct	15 ms	608 KB	Output is correct
47	Correct	16 ms	1112 KB	Output is correct
48	Correct	13 ms	616 KB	Output is correct