답안 #589333

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
589333	2022-07-04T13:17:07 Z	LIF	버섯 세기 (IOI20_mushrooms)	C++14	80.7143 / 100	8 ms	344 KB

mushrooms

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

int count_mushrooms(int n) {
	std::vector <int> m;
	vector<int> a;
	vector<int> b; 
	int aans = 1;
	int bans = 0;
	a.push_back(0);	
	
	bool check[200005];
	
	int pointer = 1;
	
	while(pointer<n)
	{
		m.clear();
		if(a.size() >= b.size())
		{
			if(a.size()==1)
			{
				m.push_back(0);
				m.push_back(pointer);
				if(use_machine(m) == 1) //that means 1 is b
				{
					bans++;
					b.push_back(pointer);
				}
				else //that means pointer is a
				{
					aans++;
					a.push_back(pointer);
				}
				check[pointer] = true;
				pointer++;
			}
			else
			{
				int fir = pointer;
				for(int i=0;i<a.size()*2;i++)
				{
					if(i==0)
					{
						m.push_back(fir);
						check[fir] = true;
						pointer++;
					}
					else
					{
						if(i%2==1)
						{
							m.push_back(a[i/2]);
						}
						else
						{
							if(pointer>=n)break; //that means we can confirm the count of m's element is even.
							m.push_back(pointer);
							check[pointer] = true;
							pointer++;
						}
					}
				}
				int kk = use_machine(m);
				if(kk%2 == 1)//that means the first is b;
				{
					b.push_back(fir);
					bans++;
					kk+=1; //that means we can ignore the first element.
				} //that means the first is A
				else
				{
					a.push_back(fir);
				}
				kk/=2; //it is the count of kk;
				aans += (m.size() - (m.size()/2) - kk);
			}
		}
		else
		{
			int fir = pointer;
			for(int i=0;i<b.size()*2;i++)
			{
				if(i==0)
				{
					m.push_back(fir);
					check[fir] = true;
					pointer++;
				}
				else
				{
					if(i%2==1)
					{
						m.push_back(b[i/2]);
					}
					else
					{
						if(pointer >=n)break;
						m.push_back(pointer);
						check[pointer] = true;
						pointer++;
					}
				}
			}
			int kk = use_machine(m);
			if(kk%2==1) //the first is A
			{
				a.push_back(fir);
				kk+=1;
			}
			else
			{
				b.push_back(fir);
				bans++;
			}
			kk/=2;
			aans += kk;
		}
	}
	
	return aans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:42:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for(int i=0;i<a.size()*2;i++)
      |                 ~^~~~~~~~~~~
mushrooms.cpp:83:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |    for(int i=0;i<b.size()*2;i++)
      |                ~^~~~~~~~~~~
mushrooms.cpp:13:7: warning: variable 'check' set but not used [-Wunused-but-set-variable]
   13 |  bool check[200005];
      |       ^~~~~

Subtask #1

80.7143 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	1 ms	308 KB	Output is correct
7	Correct	7 ms	340 KB	Output is correct
8	Correct	7 ms	336 KB	Output is correct
9	Correct	6 ms	340 KB	Output is correct
10	Partially correct	6 ms	336 KB	Output is partially correct
11	Partially correct	8 ms	316 KB	Output is partially correct
12	Partially correct	7 ms	304 KB	Output is partially correct
13	Correct	5 ms	336 KB	Output is correct
14	Correct	3 ms	208 KB	Output is correct
15	Partially correct	6 ms	320 KB	Output is partially correct
16	Partially correct	8 ms	336 KB	Output is partially correct
17	Correct	4 ms	332 KB	Output is correct
18	Correct	5 ms	336 KB	Output is correct
19	Partially correct	7 ms	336 KB	Output is partially correct
20	Partially correct	6 ms	308 KB	Output is partially correct
21	Partially correct	8 ms	308 KB	Output is partially correct
22	Partially correct	6 ms	332 KB	Output is partially correct
23	Correct	6 ms	308 KB	Output is correct
24	Correct	3 ms	312 KB	Output is correct
25	Partially correct	6 ms	316 KB	Output is partially correct
26	Partially correct	6 ms	208 KB	Output is partially correct
27	Partially correct	6 ms	208 KB	Output is partially correct
28	Partially correct	7 ms	316 KB	Output is partially correct
29	Partially correct	5 ms	340 KB	Output is partially correct
30	Partially correct	6 ms	328 KB	Output is partially correct
31	Partially correct	6 ms	332 KB	Output is partially correct
32	Partially correct	6 ms	324 KB	Output is partially correct
33	Partially correct	6 ms	336 KB	Output is partially correct
34	Partially correct	7 ms	208 KB	Output is partially correct
35	Partially correct	7 ms	344 KB	Output is partially correct
36	Partially correct	7 ms	332 KB	Output is partially correct
37	Partially correct	8 ms	320 KB	Output is partially correct
38	Partially correct	6 ms	316 KB	Output is partially correct
39	Partially correct	6 ms	336 KB	Output is partially correct
40	Partially correct	6 ms	304 KB	Output is partially correct
41	Partially correct	5 ms	344 KB	Output is partially correct
42	Partially correct	7 ms	336 KB	Output is partially correct
43	Partially correct	6 ms	332 KB	Output is partially correct
44	Partially correct	6 ms	320 KB	Output is partially correct
45	Partially correct	6 ms	320 KB	Output is partially correct
46	Partially correct	7 ms	316 KB	Output is partially correct
47	Partially correct	6 ms	336 KB	Output is partially correct
48	Partially correct	8 ms	320 KB	Output is partially correct
49	Partially correct	8 ms	324 KB	Output is partially correct
50	Partially correct	8 ms	336 KB	Output is partially correct
51	Partially correct	8 ms	328 KB	Output is partially correct
52	Partially correct	8 ms	336 KB	Output is partially correct
53	Partially correct	6 ms	312 KB	Output is partially correct
54	Partially correct	6 ms	208 KB	Output is partially correct
55	Partially correct	6 ms	336 KB	Output is partially correct
56	Partially correct	6 ms	324 KB	Output is partially correct
57	Partially correct	6 ms	336 KB	Output is partially correct
58	Partially correct	6 ms	332 KB	Output is partially correct
59	Partially correct	6 ms	340 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	0 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	0 ms	208 KB	Output is correct
66	Correct	0 ms	208 KB	Output is correct
67	Correct	0 ms	208 KB	Output is correct
68	Correct	0 ms	208 KB	Output is correct
69	Correct	0 ms	208 KB	Output is correct
70	Correct	0 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	0 ms	208 KB	Output is correct
74	Correct	0 ms	208 KB	Output is correct
75	Correct	0 ms	208 KB	Output is correct
76	Correct	0 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	0 ms	208 KB	Output is correct
80	Correct	0 ms	208 KB	Output is correct
81	Correct	0 ms	208 KB	Output is correct
82	Correct	0 ms	208 KB	Output is correct
83	Correct	0 ms	208 KB	Output is correct
84	Correct	0 ms	208 KB	Output is correct
85	Correct	0 ms	208 KB	Output is correct
86	Correct	0 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	0 ms	208 KB	Output is correct
90	Correct	0 ms	208 KB	Output is correct
91	Correct	0 ms	208 KB	Output is correct