Submission #433062

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
433062	2021-06-18T19:27:44 Z	Pbezz	Counting Mushrooms (IOI20_mushrooms)	C++14	79.5775 / 100	17 ms	304 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
typedef pair<ll,ll> pii;

const ll MAXN = 2e5+5;
const ll INF = 1e9+7;

int count_mushrooms(int n){
	std::vector<int> m; int ans=1,i,j;

	if(n==2){
	m={0,1};
	int c1 = use_machine(m);
	if(c1==0)return 2;
	return 1;
	}

	if(n<=220){
m={0,1};
	int c1 = use_machine(m);
	if(c1==0){//0 e 1 sao A
ans=2;
	for(i=2;i<n-1;i+=2){//testar i e i+2
	m={0,i,1,i+1};
	int c1 = use_machine(m);
	if(c1==0)ans+=2;
	if(c1==1)ans++;
	if(c1==2)ans++;
}
	if(n%2==1){
	m={0,n-1};
	int c1 = use_machine(m);
	if(c1==0)ans++;
}
	}else{
	m={1,2};
	int c1 = use_machine(m);
	if(c1==0){//1 e 2 sao B
ans=1;
	for(i=3;i<n-1;i+=2){//testar i e i+2
	m={1,i,2,i+1};
	int c1 = use_machine(m);
	if(c1==1)ans++;
	if(c1==2)ans++;
	if(c1==3)ans+=2;
}
	if(n%2==0){
	m={0,n-1};
	int c1 = use_machine(m);
	if(c1==0)ans++;
}
	}else{//0 e 2 sao A
ans=2;
	for(i=3;i<n-1;i+=2){//testar i e i+2
	m={0,i,2,i+1};
	int c1 = use_machine(m);
	if(c1==0)ans+=2;
	if(c1==1)ans++;
	if(c1==2)ans++;
}
	if(n%2==0){
	m={0,n-1};
	int c1 = use_machine(m);
	if(c1==0)ans++;
}
	}
}
	return ans;
}


vector<int>b,a;
	m={0,1};
	int c1 = use_machine(m);
	if(c1==0){//0 e 1 sao A
ans=2;
int go=0;
	for(i=2;i<n-1;i+=2){//testar i e i+2
	m={0,i,1,i+1};
	int c1 = use_machine(m);

	if(c1==0){
	a.pb(i);
	a.pb(i+1);
ans+=2;
	}
	if(c1==1){
	a.pb(i);
	b.pb(i+1);
ans++;
	}
	if(c1==2){
	b.pb(i);
	a.pb(i+1);
ans++;
	}
	if(c1==3){
	b.pb(i);
	b.pb(i+1);
	}

	if((int)a.size()>140){
	go=1; i+=2;
	break;
	}
	if((int)b.size()>140){
	go=2; i+=2;
	break;
	}

}

	if(go==1){//usar a's para avançar quick

	int k=a.size()-1;

	while(i<n){//testar i e os seus k-1 seguintes
	int round = min(k,n-i);

	m.clear();
	for(j=0;j<round;j++){
	m.pb(a[j]); m.pb(i+j);
	}m.pb(a[round]);

	int c1 = use_machine(m);

	ans+=(round-(c1/2));
	i+=round;
	}
}

	if(go==2){//usar b's para avançar quick

	int k=b.size()-1;

	while(i<n){//testar i e os seus k-1 seguintes
	int round = min(k,n-i);

	m.clear();
	for(j=0;j<round;j++){
	m.pb(b[j]); m.pb(i+j);
	}m.pb(b[round]);

	int c1 = use_machine(m);

	ans+=(c1/2);
	i+=round;
	}
}



	}else{
	m={1,2};
	int c1 = use_machine(m);
	if(c1==0){//1 e 2 sao B

ans=1;
int go=0;
	for(i=3;i<n-1;i+=2){//testar i e i+2
	m={1,i,2,i+1};
	int c1 = use_machine(m);

	if(c1==0){
	b.pb(i);
	b.pb(i+1);
	}
	if(c1==1){
	b.pb(i);
	a.pb(i+1);
ans++;
	}
	if(c1==2){
	a.pb(i);
	b.pb(i+1);
ans++;
	}
	if(c1==3){
	a.pb(i);
	a.pb(i+1);
ans+=2;
	}

	if((int)a.size()>140){
	go=1; i+=2;
	break;
	}
	if((int)b.size()>140){
	go=2; i+=2;
	break;
	}

}

	if(go==1){//usar a's para avançar quick

	int k=a.size()-1;

	while(i<n){//testar i e os seus k-1 seguintes
	int round = min(k,n-i);

	m.clear();
	for(j=0;j<round;j++){
	m.pb(a[j]); m.pb(i+j);
	}m.pb(a[round]);

	int c1 = use_machine(m);

	ans+=(round-(c1/2));
	i+=round;
	}
}

	if(go==2){//usar b's para avançar quick

	int k=b.size()-1;

	while(i<n){//testar i e os seus k-1 seguintes
	int round = min(k,n-i);

	m.clear();
	for(j=0;j<round;j++){
	m.pb(b[j]); m.pb(i+j);
	}m.pb(b[round]);

	int c1 = use_machine(m);

	ans+=(c1/2);
	i+=round;
	}
}




	}else{//0 e 2 sao A

ans=2;
int go=0;
	for(i=3;i<n-1;i+=2){//testar i e i+2
	m={0,i,2,i+1};
	int c1 = use_machine(m);

	if(c1==0){
	a.pb(i);
	a.pb(i+1);
ans+=2;
	}
	if(c1==1){
	a.pb(i);
	b.pb(i+1);
ans++;
	}
	if(c1==2){
	b.pb(i);
	a.pb(i+1);
ans++;
	}
	if(c1==3){
	b.pb(i);
	b.pb(i+1);
	}

	if((int)a.size()>140){
	go=1; i+=2;
	break;
	}
	if((int)b.size()>140){
	go=2; i+=2;
	break;
	}

}
//cout<<i<<
	if(go==1){//usar a's para avançar quick

	int k=a.size()-1;

	while(i<n){//testar i e os seus k-1 seguintes
	int round = min(k,n-i);

	m.clear();
	for(j=0;j<round;j++){
	m.pb(a[j]); m.pb(i+j);
	}m.pb(a[round]);

	int c1 = use_machine(m);

	ans+=(round-(c1/2));
	i+=round;
	}
}

	if(go==2){//usar b's para avançar quick

	int k=b.size()-1;

	while(i<n){//testar i e os seus k-1 seguintes
	int round = min(k,n-i);

	m.clear();
	for(j=0;j<round;j++){
	m.pb(b[j]); m.pb(i+j);
	}m.pb(b[round]);

	int c1 = use_machine(m);

	ans+=(c1/2);
	i+=round;
	}
}





	}
}




	return ans;
}

Subtask #1

79.5775 / 100.0

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