답안 #820110

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
820110	2023-08-10T19:32:12 Z	oscar1f	버섯 세기 (IOI20_mushrooms)	C++17	92.623 / 100	7 ms	440 KB

mushrooms

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

using namespace std;

int nbVal,idCour,nbA,ans,taille;
vector<int> listeA,listeB;
vector<int> quest;

int count_mushrooms(int n) {
	nbVal=n;
	idCour=1;
	nbA=1;
	listeA.push_back(0);
	while (idCour<nbVal) {
		quest.clear();
		if ((int)max(listeA.size(),listeB.size())>=80 or (int)max(listeA.size(),listeB.size())<=1 or idCour==nbVal-1) {
			if (listeA.size()>=listeB.size()) {
				for (int i=0;i<(int)listeA.size();i++) {
					if (idCour<nbVal) {
						quest.push_back(listeA[i]);
						quest.push_back(idCour);
						idCour++;
					}
				}
				ans=use_machine(quest);
				if (ans%2==0) {
					listeA.push_back(quest.back());
				}
				else {
					listeB.push_back(quest.back());
				}
				taille=quest.size()/2;
				ans=(ans+1)/2;
				nbA+=taille-ans;
			}
			else {
				for (int i=0;i<(int)listeB.size();i++) {
					if (idCour<nbVal) {
						quest.push_back(listeB[i]);
						quest.push_back(idCour);
						idCour++;
					}
				}
				ans=use_machine(quest);
				if (ans%2==1) {
					listeA.push_back(quest.back());
				}
				else {
					listeB.push_back(quest.back());
				}
				taille=quest.size()/2;
				ans=(ans+1)/2;
				nbA+=ans;
			}
		}
		else {
			if ((int)listeA.size()>=2) {
				quest={listeA[0],idCour,listeA[1],idCour+1};
				ans=use_machine(quest);
				if (ans==0) {
					listeA.push_back(idCour);
					listeA.push_back(idCour+1);
					nbA+=2;
				}
				if (ans==1) {
					listeA.push_back(idCour);
					listeB.push_back(idCour+1);
					nbA++;
				}
				if (ans==2) {
					listeB.push_back(idCour);
					listeA.push_back(idCour+1);
					nbA++;
				}
				if (ans==3) {
					listeB.push_back(idCour);
					listeB.push_back(idCour+1);
				}
				idCour+=2;
			}
			else {
				quest={listeB[0],idCour,listeB[1],idCour+1};
				ans=use_machine(quest);
				if (ans==0) {
					listeB.push_back(idCour);
					listeB.push_back(idCour+1);
				}
				if (ans==1) {
					listeB.push_back(idCour);
					listeA.push_back(idCour+1);
					nbA++;
				}
				if (ans==2) {
					listeA.push_back(idCour);
					listeB.push_back(idCour+1);
					nbA++;
				}
				if (ans==3) {
					listeA.push_back(idCour);
					listeA.push_back(idCour+1);
					nbA+=2;
				}
				idCour+=2;
			}
		}
	}
	return nbA;
}
 

Subtask #1

92.623 / 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	1 ms	312 KB	Output is correct
6	Correct	1 ms	252 KB	Output is correct
7	Correct	6 ms	320 KB	Output is correct
8	Correct	6 ms	208 KB	Output is correct
9	Correct	5 ms	208 KB	Output is correct
10	Correct	5 ms	208 KB	Output is correct
11	Partially correct	4 ms	328 KB	Output is partially correct
12	Correct	4 ms	328 KB	Output is correct
13	Correct	4 ms	208 KB	Output is correct
14	Correct	3 ms	208 KB	Output is correct
15	Partially correct	4 ms	324 KB	Output is partially correct
16	Partially correct	7 ms	316 KB	Output is partially correct
17	Correct	3 ms	328 KB	Output is correct
18	Correct	5 ms	336 KB	Output is correct
19	Partially correct	5 ms	324 KB	Output is partially correct
20	Correct	6 ms	208 KB	Output is correct
21	Correct	5 ms	324 KB	Output is correct
22	Partially correct	6 ms	328 KB	Output is partially correct
23	Correct	5 ms	208 KB	Output is correct
24	Correct	3 ms	208 KB	Output is correct
25	Partially correct	5 ms	320 KB	Output is partially correct
26	Partially correct	5 ms	332 KB	Output is partially correct
27	Partially correct	7 ms	208 KB	Output is partially correct
28	Partially correct	6 ms	432 KB	Output is partially correct
29	Partially correct	5 ms	324 KB	Output is partially correct
30	Partially correct	4 ms	332 KB	Output is partially correct
31	Partially correct	6 ms	332 KB	Output is partially correct
32	Partially correct	5 ms	324 KB	Output is partially correct
33	Partially correct	4 ms	208 KB	Output is partially correct
34	Partially correct	6 ms	208 KB	Output is partially correct
35	Partially correct	5 ms	312 KB	Output is partially correct
36	Partially correct	5 ms	308 KB	Output is partially correct
37	Partially correct	7 ms	208 KB	Output is partially correct
38	Partially correct	5 ms	336 KB	Output is partially correct
39	Partially correct	6 ms	336 KB	Output is partially correct
40	Partially correct	5 ms	424 KB	Output is partially correct
41	Partially correct	6 ms	208 KB	Output is partially correct
42	Partially correct	5 ms	360 KB	Output is partially correct
43	Partially correct	7 ms	328 KB	Output is partially correct
44	Partially correct	5 ms	328 KB	Output is partially correct
45	Partially correct	5 ms	308 KB	Output is partially correct
46	Partially correct	5 ms	208 KB	Output is partially correct
47	Partially correct	5 ms	208 KB	Output is partially correct
48	Partially correct	5 ms	316 KB	Output is partially correct
49	Partially correct	5 ms	328 KB	Output is partially correct
50	Partially correct	7 ms	324 KB	Output is partially correct
51	Partially correct	5 ms	312 KB	Output is partially correct
52	Partially correct	5 ms	208 KB	Output is partially correct
53	Partially correct	5 ms	316 KB	Output is partially correct
54	Partially correct	4 ms	208 KB	Output is partially correct
55	Partially correct	6 ms	440 KB	Output is partially correct
56	Partially correct	6 ms	208 KB	Output is partially correct
57	Partially correct	5 ms	336 KB	Output is partially correct
58	Partially correct	5 ms	324 KB	Output is partially correct
59	Partially correct	5 ms	304 KB	Output is partially correct
60	Partially correct	5 ms	312 KB	Output is partially correct
61	Partially correct	5 ms	324 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	1 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	0 ms	208 KB	Output is correct
73	Correct	0 ms	208 KB	Output is correct
74	Correct	1 ms	208 KB	Output is correct
75	Correct	0 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	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	1 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