oj.uz

Submission #374818

# Submission time Handle Problem Language Result Execution time Memory
374818 2021-03-08T09:13:34 Z maroonrk Counting Mushrooms (IOI20_mushrooms) C++17
79.5775 / 100
 23 ms 952 KB 
#include "mushrooms.h"

#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<<"}";
}

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

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,class u>
void print(const pair<t,u>&p,int suc=1){
	print(p.a,2);
	print(p.b,suc);
}

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

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

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

//#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 botbit(signed a){
	return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
	return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
	return __builtin_popcount(t);
}
int popcount(ll t){
	return __builtin_popcountll(t);
}
bool ispow2(int i){
	return i&&(i&-i)==i;
}
ll mask(int i){
	return (ll(1)<<i)-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);
}

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;
}

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);
}

int tot=0;

using A=array<vi,2>;
int sub(A idx,vi rem){
	cerr<<tot<<" "<<si(idx[0])<<" "<<si(idx[1])<<" "<<si(rem)<<endl;
	//dmp(idx);
	//dmp(rem);
	if(rem.empty())return si(idx[0]);
	int head=0;
	vi off[2];
	int sum=0;
	while(head<si(rem)){
		vi tmp;
		int z=rem[head];
		rep(i,si(idx[0])){
			if(head<si(rem)){
				if(i)off[0].pb(rem[head]);
				tmp.pb(rem[head++]);
			}
			tmp.pb(idx[0][i]);
		}
		rep(i,si(idx[1])){
			if(i&&head<si(rem)){
				off[1].pb(rem[head]);
				tmp.pb(rem[head++]);
			}
			tmp.pb(idx[1][i]);
		}
		tot++;
		int val=use_machine(tmp);
		if(si(idx[1]))val--;
		int dif=(val+1)/2;
		sum+=dif;
		int k=val%2;
		idx[k].pb(z);
		sum-=k;
	}
	if(si(off[0])<si(off[1])){
		int val=sub(idx,off[0]);
		return val+sum-(si(off[0])-(val-si(idx[0])));
	}else{
		int val=sub(idx,off[1]);
		return val+si(off[0])-(sum-(val-si(idx[0])));
	}
}

int count_mushrooms(int n){
	vi rem(n-1);iota(all(rem),1);
	return sub(A{vi{0},vi{}},rem);
}

Subtask #1
79.5775 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 236 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 8 ms 748 KB Output is correct
8 Correct 8 ms 748 KB Output is correct
9 Correct 9 ms 748 KB Output is correct
10 Partially correct 11 ms 748 KB Output is partially correct
11 Partially correct 14 ms 876 KB Output is partially correct
12 Partially correct 15 ms 748 KB Output is partially correct
13 Correct 10 ms 768 KB Output is correct
14 Correct 9 ms 504 KB Output is correct
15 Partially correct 12 ms 812 KB Output is partially correct
16 Partially correct 16 ms 748 KB Output is partially correct
17 Correct 8 ms 492 KB Output is correct
18 Correct 8 ms 748 KB Output is correct
19 Partially correct 14 ms 748 KB Output is partially correct
20 Partially correct 10 ms 748 KB Output is partially correct
21 Partially correct 11 ms 748 KB Output is partially correct
22 Partially correct 13 ms 748 KB Output is partially correct
23 Correct 9 ms 748 KB Output is correct
24 Correct 8 ms 668 KB Output is correct
25 Partially correct 13 ms 748 KB Output is partially correct
26 Partially correct 16 ms 856 KB Output is partially correct
27 Partially correct 16 ms 876 KB Output is partially correct
28 Partially correct 17 ms 748 KB Output is partially correct
29 Partially correct 15 ms 748 KB Output is partially correct
30 Partially correct 15 ms 884 KB Output is partially correct
31 Partially correct 17 ms 748 KB Output is partially correct
32 Partially correct 23 ms 748 KB Output is partially correct
33 Partially correct 13 ms 768 KB Output is partially correct
34 Partially correct 13 ms 748 KB Output is partially correct
35 Partially correct 18 ms 748 KB Output is partially correct
36 Partially correct 14 ms 748 KB Output is partially correct
37 Partially correct 16 ms 748 KB Output is partially correct
38 Partially correct 14 ms 748 KB Output is partially correct
39 Partially correct 14 ms 876 KB Output is partially correct
40 Partially correct 12 ms 748 KB Output is partially correct
41 Partially correct 14 ms 876 KB Output is partially correct
42 Partially correct 14 ms 748 KB Output is partially correct
43 Partially correct 17 ms 872 KB Output is partially correct
44 Partially correct 14 ms 904 KB Output is partially correct
45 Partially correct 18 ms 868 KB Output is partially correct
46 Partially correct 15 ms 952 KB Output is partially correct
47 Partially correct 12 ms 748 KB Output is partially correct
48 Partially correct 13 ms 748 KB Output is partially correct
49 Partially correct 16 ms 748 KB Output is partially correct
50 Partially correct 14 ms 748 KB Output is partially correct
51 Partially correct 17 ms 748 KB Output is partially correct
52 Partially correct 19 ms 748 KB Output is partially correct
53 Partially correct 16 ms 748 KB Output is partially correct
54 Partially correct 12 ms 848 KB Output is partially correct
55 Partially correct 13 ms 748 KB Output is partially correct
56 Partially correct 13 ms 876 KB Output is partially correct
57 Partially correct 14 ms 876 KB Output is partially correct
58 Partially correct 11 ms 864 KB Output is partially correct
59 Partially correct 14 ms 748 KB Output is partially correct
60 Partially correct 13 ms 748 KB Output is partially correct
61 Partially correct 13 ms 748 KB Output is partially correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 1 ms 492 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 384 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 1 ms 364 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 1 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 1 ms 364 KB Output is correct
78 Correct 1 ms 364 KB Output is correct
79 Correct 1 ms 364 KB Output is correct
80 Correct 1 ms 364 KB Output is correct
81 Correct 1 ms 364 KB Output is correct
82 Correct 1 ms 364 KB Output is correct
83 Correct 1 ms 364 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 1 ms 364 KB Output is correct
86 Correct 1 ms 364 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 1 ms 364 KB Output is correct
89 Correct 1 ms 364 KB Output is correct
90 Correct 1 ms 364 KB Output is correct
91 Correct 1 ms 364 KB Output is correct