답안 #610377

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
610377	2022-07-28T07:08:38 Z	Jomnoi	버섯 세기 (IOI20_mushrooms)	C++17	87.9377 / 100	10 ms	336 KB

mushrooms

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

int result;
vector <int> x;
vector <int> typeA, typeB;

int count_mushrooms(int N) {
	typeA.push_back(0);
	int i = 1;
	while(typeA.size() < 2 and typeB.size() < 2 and i < N) {
		result = use_machine({0, i});
		if(result == 1) {
			typeB.push_back(i);
		}
		else {
			typeA.push_back(i);
		}
		i++;
	}
	while(typeA.size() < 140 and typeB.size() < 140 and i + 1 < N) {
		if(typeA.size() >= 2) {
			result = use_machine({typeA[0], i, typeA[1], i + 1});
			if(result == 0) {
				typeA.push_back(i);
				typeA.push_back(i + 1);
			}
			else if(result == 1) {
				typeA.push_back(i);
				typeB.push_back(i + 1);
			}
			else if(result == 2) {
				typeB.push_back(i);
				typeA.push_back(i + 1);
			}
			else {
				typeB.push_back(i);
				typeB.push_back(i + 1);
			}
		}
		else {
			result = use_machine({typeB[0], i, typeB[1], i + 1});
			if(result == 0) {
				typeB.push_back(i);
				typeB.push_back(i + 1);
			}
			else if(result == 1) {
				typeB.push_back(i);
				typeA.push_back(i + 1);
			}
			else if(result == 2) {
				typeA.push_back(i);
				typeB.push_back(i + 1);
			}
			else {
				typeA.push_back(i);
				typeA.push_back(i + 1);
			}
		}
		i += 2;
	}

	int numberofA = 0, cnt;
	while(i < N) {
		if(typeA.size() > typeB.size()) {
			x.clear();
			cnt = -1;
			for(int j = 0; j < typeA.size() and i < N; j++) {
				x.push_back(typeA[j]);
				x.push_back(i++);
				cnt++;
			}

			result = use_machine(x);

			numberofA += cnt - result / 2;
			if(result % 2 == 0) {
				typeA.push_back(i - 1);
			}
			else {
				typeB.push_back(i - 1);
			}
		}
		else {
			x.clear();
			for(int j = 0; j < typeB.size() and i < N; j++) {
				x.push_back(typeB[j]);
				x.push_back(i++);
			}

			result = use_machine(x);

			numberofA += result / 2;
			if(result % 2 == 1) {
				typeA.push_back(i - 1);
			}
			else {
				typeB.push_back(i - 1);
			}
		}
	}
	return numberofA + typeA.size();
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:69:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |    for(int j = 0; j < typeA.size() and i < N; j++) {
      |                   ~~^~~~~~~~~~~~~~
mushrooms.cpp:87:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   87 |    for(int j = 0; j < typeB.size() and i < N; j++) {
      |                   ~~^~~~~~~~~~~~~~

Subtask #1

87.9377 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	1 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	2 ms	208 KB	Output is correct
6	Correct	3 ms	208 KB	Output is correct
7	Correct	6 ms	208 KB	Output is correct
8	Correct	8 ms	208 KB	Output is correct
9	Correct	5 ms	208 KB	Output is correct
10	Correct	6 ms	208 KB	Output is correct
11	Partially correct	6 ms	208 KB	Output is partially correct
12	Correct	8 ms	208 KB	Output is correct
13	Correct	5 ms	208 KB	Output is correct
14	Correct	6 ms	208 KB	Output is correct
15	Partially correct	10 ms	336 KB	Output is partially correct
16	Partially correct	7 ms	312 KB	Output is partially correct
17	Correct	3 ms	308 KB	Output is correct
18	Correct	8 ms	208 KB	Output is correct
19	Partially correct	6 ms	208 KB	Output is partially correct
20	Correct	6 ms	208 KB	Output is correct
21	Correct	7 ms	208 KB	Output is correct
22	Partially correct	7 ms	296 KB	Output is partially correct
23	Correct	6 ms	208 KB	Output is correct
24	Correct	4 ms	208 KB	Output is correct
25	Partially correct	7 ms	208 KB	Output is partially correct
26	Partially correct	8 ms	208 KB	Output is partially correct
27	Partially correct	8 ms	208 KB	Output is partially correct
28	Partially correct	9 ms	208 KB	Output is partially correct
29	Partially correct	6 ms	208 KB	Output is partially correct
30	Partially correct	8 ms	208 KB	Output is partially correct
31	Partially correct	5 ms	208 KB	Output is partially correct
32	Partially correct	6 ms	208 KB	Output is partially correct
33	Partially correct	6 ms	208 KB	Output is partially correct
34	Partially correct	6 ms	208 KB	Output is partially correct
35	Partially correct	8 ms	208 KB	Output is partially correct
36	Partially correct	6 ms	208 KB	Output is partially correct
37	Partially correct	6 ms	208 KB	Output is partially correct
38	Partially correct	6 ms	208 KB	Output is partially correct
39	Partially correct	6 ms	304 KB	Output is partially correct
40	Partially correct	7 ms	208 KB	Output is partially correct
41	Partially correct	6 ms	208 KB	Output is partially correct
42	Partially correct	8 ms	208 KB	Output is partially correct
43	Partially correct	8 ms	208 KB	Output is partially correct
44	Partially correct	7 ms	208 KB	Output is partially correct
45	Partially correct	8 ms	208 KB	Output is partially correct
46	Partially correct	6 ms	208 KB	Output is partially correct
47	Partially correct	6 ms	208 KB	Output is partially correct
48	Partially correct	6 ms	208 KB	Output is partially correct
49	Partially correct	7 ms	208 KB	Output is partially correct
50	Partially correct	7 ms	208 KB	Output is partially correct
51	Partially correct	6 ms	208 KB	Output is partially correct
52	Partially correct	6 ms	312 KB	Output is partially correct
53	Partially correct	6 ms	304 KB	Output is partially correct
54	Partially correct	7 ms	308 KB	Output is partially correct
55	Partially correct	8 ms	208 KB	Output is partially correct
56	Partially correct	6 ms	208 KB	Output is partially correct
57	Partially correct	7 ms	208 KB	Output is partially correct
58	Partially correct	7 ms	208 KB	Output is partially correct
59	Partially correct	6 ms	208 KB	Output is partially correct
60	Partially correct	5 ms	308 KB	Output is partially correct
61	Partially correct	10 ms	208 KB	Output is partially correct
62	Correct	1 ms	256 KB	Output is correct
63	Correct	1 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	0 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	1 ms	208 KB	Output is correct
76	Correct	1 ms	208 KB	Output is correct
77	Correct	1 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	0 ms	208 KB	Output is correct
81	Correct	0 ms	208 KB	Output is correct
82	Correct	1 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	1 ms	208 KB	Output is correct