답안 #550755

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
550755	2022-04-19T03:32:51 Z	tinjyu	버섯 세기 (IOI20_mushrooms)	C++14	91.8699 / 100	11 ms	460 KB

mushrooms

#include "mushrooms.h"
#include <iostream>
using namespace std;
long long int red[100005],blue[100005],rp,bp;
int r(int x)
{
	rp++;
	red[rp]=x;
	return 0;
}
int b(int x)
{
	bp++;
	blue[bp]=x;
	return 0;
}
int count_mushrooms(int n) {
	if(n<=226)
	{
		long long int ans=1;
		for(int i=1;i<n;i++)
		{
			vector<int> m;
			m={0,i};
			int tmp=use_machine(m);
			if(tmp==0)ans++;
		}
		return ans;
	}
	rp=0,bp=-1;
	red[rp]=0;
	for(int i=1;i<=min(3,n);i++)
	{
		vector<int>m;
		m.push_back(0);
		m.push_back(i);
		int tmp=use_machine(m);
		if(tmp==1)
		{
			bp++;
			blue[bp]=i;
		}
		else
		{
			rp++;
			red[rp]=i;
		}
	}
	if(rp>=1)
	{
		for(int i=2;i<=min(80,n);i++)
		{
			vector<int>m;
			m.push_back(i*2);
			m.push_back(red[0]);
			m.push_back(i*2+1);
			m.push_back(red[1]);
			int tmp=use_machine(m);
			//cout<<tmp<<endl;
			if(tmp==0)
			{
				r(i*2);
				r(i*2+1);	
			}
			if(tmp==1)
			{
				b(i*2);
				r(i*2+1);
			}
			if(tmp==2)
			{
				r(i*2);
				b(i*2+1);
			}
			if(tmp==3)
			{
				b(i*2);
				b(i*2+1);
			}
		}
	}
	else
	{
		for(int i=2;i<=min(80,n);i++)
		{
			vector<int>m;
			m.push_back(i*2);
			m.push_back(blue[0]);
			m.push_back(i*2+1);
			m.push_back(blue[1]);
			int tmp=use_machine(m);
			if(tmp==0)
			{
				b(i*2);
				b(i*2+1);	
			}
			if(tmp==1)
			{
				r(i*2);
				b(i*2+1);
			}
			if(tmp==2)
			{
				b(i*2);
				r(i*2+1);
			}
			if(tmp==3)
			{
				r(i*2);
				r(i*2+1);
			}
		}
	}
	long long int p=162,ans=rp+1;
	while(p<n)
	{
		vector<int> m;
		if(rp<bp)
		{
			//m.push_back(p);
			//p++;
			long long int num=0;
			for(int i=0;i<bp;i++)
			{
				
				if(p<n)
				{
					m.push_back(blue[i]);
					m.push_back(p);
					num++;
				}
				else break;
				p++;
			}
			int tmp=use_machine(m);
			ans+=tmp/2;
			if(tmp%2==1)
			{
				ans++;
				r(p-1);
			}
			else
			{
				b(p-1);
			}
		}
		else
		{
			//m.push_back(p);
			//p++;
			long long int num=0;
			for(int i=0;i<rp;i++)
			{
				
				//cout<<red[i]<<" "<<p<<" ";
				if(p<n)
				{
					m.push_back(red[i]);
					m.push_back(p);
					num++;
				}
				else break;
				p++;
			}
			int tmp=use_machine(m);
			ans+=num-(long long int)(tmp/2);
			//cout<<num<<" "<<tmp<<endl;
			if(tmp%2==1)
			{
				ans--;
				b(p-1);
			}
			else
			{
				r(p-1);
			}
		}
	}
	return ans;
}

Subtask #1

91.8699 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	304 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	1 ms	208 KB	Output is correct
4	Correct	1 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	7 ms	208 KB	Output is correct
8	Correct	6 ms	208 KB	Output is correct
9	Correct	5 ms	208 KB	Output is correct
10	Correct	6 ms	316 KB	Output is correct
11	Partially correct	6 ms	324 KB	Output is partially correct
12	Correct	6 ms	208 KB	Output is correct
13	Correct	8 ms	296 KB	Output is correct
14	Correct	4 ms	320 KB	Output is correct
15	Partially correct	10 ms	444 KB	Output is partially correct
16	Partially correct	8 ms	316 KB	Output is partially correct
17	Correct	3 ms	208 KB	Output is correct
18	Correct	8 ms	316 KB	Output is correct
19	Partially correct	7 ms	316 KB	Output is partially correct
20	Correct	7 ms	320 KB	Output is correct
21	Correct	6 ms	324 KB	Output is correct
22	Partially correct	6 ms	328 KB	Output is partially correct
23	Correct	6 ms	320 KB	Output is correct
24	Correct	5 ms	208 KB	Output is correct
25	Partially correct	11 ms	312 KB	Output is partially correct
26	Partially correct	8 ms	324 KB	Output is partially correct
27	Partially correct	6 ms	460 KB	Output is partially correct
28	Partially correct	8 ms	336 KB	Output is partially correct
29	Partially correct	6 ms	320 KB	Output is partially correct
30	Partially correct	7 ms	324 KB	Output is partially correct
31	Partially correct	6 ms	312 KB	Output is partially correct
32	Partially correct	6 ms	312 KB	Output is partially correct
33	Partially correct	6 ms	332 KB	Output is partially correct
34	Partially correct	9 ms	320 KB	Output is partially correct
35	Partially correct	6 ms	324 KB	Output is partially correct
36	Partially correct	9 ms	440 KB	Output is partially correct
37	Partially correct	6 ms	336 KB	Output is partially correct
38	Partially correct	6 ms	336 KB	Output is partially correct
39	Partially correct	7 ms	336 KB	Output is partially correct
40	Partially correct	6 ms	336 KB	Output is partially correct
41	Partially correct	9 ms	320 KB	Output is partially correct
42	Partially correct	6 ms	336 KB	Output is partially correct
43	Partially correct	10 ms	328 KB	Output is partially correct
44	Partially correct	6 ms	324 KB	Output is partially correct
45	Partially correct	6 ms	332 KB	Output is partially correct
46	Partially correct	8 ms	336 KB	Output is partially correct
47	Partially correct	6 ms	336 KB	Output is partially correct
48	Partially correct	6 ms	324 KB	Output is partially correct
49	Partially correct	5 ms	340 KB	Output is partially correct
50	Partially correct	9 ms	324 KB	Output is partially correct
51	Partially correct	6 ms	332 KB	Output is partially correct
52	Partially correct	6 ms	336 KB	Output is partially correct
53	Partially correct	7 ms	336 KB	Output is partially correct
54	Partially correct	6 ms	328 KB	Output is partially correct
55	Partially correct	7 ms	320 KB	Output is partially correct
56	Partially correct	8 ms	340 KB	Output is partially correct
57	Partially correct	6 ms	328 KB	Output is partially correct
58	Partially correct	6 ms	336 KB	Output is partially correct
59	Partially correct	6 ms	336 KB	Output is partially correct
60	Partially correct	6 ms	336 KB	Output is partially correct
61	Partially correct	7 ms	332 KB	Output is partially correct
62	Correct	1 ms	208 KB	Output is correct
63	Correct	0 ms	208 KB	Output is correct
64	Correct	0 ms	208 KB	Output is correct
65	Correct	1 ms	208 KB	Output is correct
66	Correct	1 ms	208 KB	Output is correct
67	Correct	0 ms	208 KB	Output is correct
68	Correct	1 ms	208 KB	Output is correct
69	Correct	0 ms	208 KB	Output is correct
70	Correct	1 ms	208 KB	Output is correct
71	Correct	0 ms	208 KB	Output is correct
72	Correct	1 ms	208 KB	Output is correct
73	Correct	1 ms	208 KB	Output is correct
74	Correct	0 ms	208 KB	Output is correct
75	Correct	1 ms	208 KB	Output is correct
76	Correct	1 ms	208 KB	Output is correct
77	Correct	0 ms	208 KB	Output is correct
78	Correct	0 ms	208 KB	Output is correct
79	Correct	1 ms	208 KB	Output is correct
80	Correct	1 ms	208 KB	Output is correct
81	Correct	1 ms	208 KB	Output is correct
82	Correct	1 ms	208 KB	Output is correct
83	Correct	1 ms	208 KB	Output is correct
84	Correct	0 ms	208 KB	Output is correct
85	Correct	2 ms	208 KB	Output is correct
86	Correct	1 ms	208 KB	Output is correct
87	Correct	0 ms	208 KB	Output is correct
88	Correct	0 ms	208 KB	Output is correct
89	Correct	1 ms	208 KB	Output is correct
90	Correct	1 ms	208 KB	Output is correct
91	Correct	1 ms	208 KB	Output is correct