답안 #405655

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
405655	2021-05-16T16:16:28 Z	kshitij_sodani	버섯 세기 (IOI20_mushrooms)	C++14	80.427 / 100	13 ms	328 KB

mushrooms

//#pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
#define endl '\n'
#define ask use_machine

#include "mushrooms.h"

int count_mushrooms(int n) {
	/*pair<int,int> mi={2000000,-1};
	int nn=20000;
	for(int i=2;i<=nn-4;i+=2){
		int cost=(i/2);
		cost+=2;
		int le=((i+3+1)/2);

		cost+=((nn-i-3+le-1))/le;
		mi=min(mi,{cost,i});
	}
	cout<<mi.a<<":"<<mi.b<<endl;
*/
	if(n<=400){
		int ans2=1;
		for(int i=1;i<n;i+=2){
			if(i+1==n){
				ans2+=1-use_machine({0,i});
				continue;
			}
			ans2+=2-use_machine({i,0,i+1});
		}
		return ans2;
	}
	vector<int> aa;
	vector<int> bb;
	vector<int> cc;
	vector<int> dd;
	aa.pb(0);
	for(int i=1;i<3;i++){
		if(ask({0,i})==0){
			aa.pb(i);
		}
		else{
			bb.pb(i);
		}
	}
	//cc=aa;
	//dd=bb;
	int st=0;
	if(aa.size()>=2){
		
	}
	else{
		st=1;
		swap(aa,bb);

	}
	int yy=273;//199;
	for(int i=3;i<yy and i<n;i+=2){
		if(i+1==n){

			if(ask({aa[0],i})==0){
				aa.pb(i);
			}
			else{
				bb.pb(i);
			}
			continue;
		}
		int x=ask({aa[0],i,aa[1],i+1});
		if(x%2==0){
			aa.pb(i+1);
		}
		else{
			bb.pb(i+1);
		}
		x/=2;
		if(x%2==0){
			aa.pb(i);
		}
		else{
			bb.pb(i);
		}
	}
	if(st){
		swap(aa,bb);
	}
	st=0;
	int ans=aa.size();
	if(bb.size()>=aa.size()){
		st=1;
		swap(aa,bb);
	}
	int ind=yy;
	aa.pb(-1);
	while(ind<n){
		vector<int> ss;
		ss.pb(aa[0]);
		int xx=1;
		while(xx<aa.size() and ind<n){
			ss.pb(ind);
			ss.pb(aa[xx]);
			xx++;
			ind++;
		}
		ss.pop_back();
		int aa=ask(ss);
		if(aa%2==1){
			if(st==0){

			}
			else{
				ans++;
			}
		}
		else{
			if(st==0){
				ans++;
			}
		}
		aa/=2;
		ss.pop_back();
		if(st==0){
			ans+=(ss.size()/2)-aa;
		}
		else{
			ans+=aa;
		}
	}



	if(st){
		swap(aa,bb);
	}
	return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:104:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |   while(xx<aa.size() and ind<n){
      |         ~~^~~~~~~~~~

Subtask #1

80.427 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	200 KB	Output is correct
2	Correct	1 ms	200 KB	Output is correct
3	Correct	1 ms	200 KB	Output is correct
4	Correct	1 ms	200 KB	Output is correct
5	Correct	3 ms	200 KB	Output is correct
6	Correct	3 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	8 ms	200 KB	Output is correct
10	Partially correct	8 ms	200 KB	Output is partially correct
11	Partially correct	8 ms	200 KB	Output is partially correct
12	Partially correct	10 ms	324 KB	Output is partially correct
13	Correct	8 ms	200 KB	Output is correct
14	Correct	6 ms	200 KB	Output is correct
15	Partially correct	9 ms	200 KB	Output is partially correct
16	Partially correct	8 ms	200 KB	Output is partially correct
17	Correct	6 ms	200 KB	Output is correct
18	Correct	8 ms	200 KB	Output is correct
19	Partially correct	10 ms	328 KB	Output is partially correct
20	Partially correct	10 ms	200 KB	Output is partially correct
21	Partially correct	9 ms	200 KB	Output is partially correct
22	Partially correct	8 ms	304 KB	Output is partially correct
23	Partially correct	9 ms	200 KB	Output is partially correct
24	Correct	6 ms	200 KB	Output is correct
25	Partially correct	10 ms	200 KB	Output is partially correct
26	Partially correct	9 ms	296 KB	Output is partially correct
27	Partially correct	10 ms	200 KB	Output is partially correct
28	Partially correct	9 ms	200 KB	Output is partially correct
29	Partially correct	7 ms	304 KB	Output is partially correct
30	Partially correct	8 ms	200 KB	Output is partially correct
31	Partially correct	7 ms	200 KB	Output is partially correct
32	Partially correct	9 ms	200 KB	Output is partially correct
33	Partially correct	11 ms	200 KB	Output is partially correct
34	Partially correct	8 ms	200 KB	Output is partially correct
35	Partially correct	9 ms	200 KB	Output is partially correct
36	Partially correct	10 ms	200 KB	Output is partially correct
37	Partially correct	9 ms	200 KB	Output is partially correct
38	Partially correct	13 ms	200 KB	Output is partially correct
39	Partially correct	9 ms	200 KB	Output is partially correct
40	Partially correct	9 ms	200 KB	Output is partially correct
41	Partially correct	9 ms	304 KB	Output is partially correct
42	Partially correct	10 ms	200 KB	Output is partially correct
43	Partially correct	8 ms	200 KB	Output is partially correct
44	Partially correct	8 ms	200 KB	Output is partially correct
45	Partially correct	8 ms	200 KB	Output is partially correct
46	Partially correct	9 ms	200 KB	Output is partially correct
47	Partially correct	10 ms	200 KB	Output is partially correct
48	Partially correct	9 ms	200 KB	Output is partially correct
49	Partially correct	13 ms	200 KB	Output is partially correct
50	Partially correct	10 ms	200 KB	Output is partially correct
51	Partially correct	11 ms	200 KB	Output is partially correct
52	Partially correct	13 ms	200 KB	Output is partially correct
53	Partially correct	10 ms	200 KB	Output is partially correct
54	Partially correct	11 ms	200 KB	Output is partially correct
55	Partially correct	8 ms	200 KB	Output is partially correct
56	Partially correct	9 ms	304 KB	Output is partially correct
57	Partially correct	10 ms	200 KB	Output is partially correct
58	Partially correct	9 ms	200 KB	Output is partially correct
59	Partially correct	8 ms	200 KB	Output is partially correct
60	Partially correct	13 ms	200 KB	Output is partially correct
61	Partially correct	11 ms	200 KB	Output is partially correct
62	Correct	1 ms	200 KB	Output is correct
63	Correct	1 ms	200 KB	Output is correct
64	Correct	1 ms	200 KB	Output is correct
65	Correct	1 ms	200 KB	Output is correct
66	Correct	1 ms	200 KB	Output is correct
67	Correct	1 ms	200 KB	Output is correct
68	Correct	1 ms	200 KB	Output is correct
69	Correct	1 ms	200 KB	Output is correct
70	Correct	1 ms	200 KB	Output is correct
71	Correct	1 ms	200 KB	Output is correct
72	Correct	1 ms	200 KB	Output is correct
73	Correct	1 ms	200 KB	Output is correct
74	Correct	1 ms	200 KB	Output is correct
75	Correct	1 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	2 ms	200 KB	Output is correct
79	Correct	1 ms	200 KB	Output is correct
80	Correct	1 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	1 ms	200 KB	Output is correct
86	Correct	1 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	2 ms	200 KB	Output is correct
91	Correct	1 ms	200 KB	Output is correct