Submission #604520

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
604520	2022-07-25T07:15:40 Z	gagik_2007	Counting Mushrooms (IOI20_mushrooms)	C++17	92.623 / 100	15 ms	340 KB

mushrooms

#include "mushrooms.h"
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <ctime>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <limits>
#include <iomanip>
#include <unordered_set>
#include <unordered_map>
#include <random>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef ll itn;

#define ff first
#define ss second

ll n;
vector<int>A, B;

int count_mushrooms(int N) {
	n = N;
	const int VAL = 6 * int(sqrt(n)) / 5;
	pair<int, int>sm;
	vector<int>ask = { 0,1 };
	int vl = use_machine(ask);
	int anh = -1;
	bool sma = true;
	ll ans = 0;
	A.push_back(0);
	if (vl == 0) {
		if (n == 2)return 2;
		sm = { 0,1 };
		anh = 2;
		ans = 2;
		A.push_back(1);
	}
	else {
		if (n == 2)return 1;
		B.push_back(1);
		ask = { 1,2 };
		vl = use_machine(ask);
		anh = 3;
		if (vl == 1) {
			if (n == 3)return 2;
			sm = { 0,2 };
			A.push_back(2);
			ans = 2;
		}
		else {
			if (n == 3)return 1;
			sm = { 1,2 };
			B.push_back(2);
			ans = 1;
			sma = false;
		}
	}
	for (int i = anh; i < VAL; i += 2) {
		if (i == VAL - 1) {
			ask = { 0,i };
			vl = use_machine(ask);
			if (!vl) {
				ans++;
				A.push_back(i);
			}
			else {
				B.push_back(i);
			}
			break;
		}
		ask = { sm.ff,i,sm.ss,i + 1 };
		vl = use_machine(ask);
		//cout << vl << " ";
		if (sma) {
			switch (vl)
			{
			case 0:
				A.push_back(i);
				A.push_back(i + 1);
				ans += 2;
				break;
			case 1:
				A.push_back(i);
				B.push_back(i + 1);
				ans += 1;
				break;
			case 2:
				B.push_back(i);
				A.push_back(i + 1);
				ans += 1;
				break;
			case 3:
				B.push_back(i);
				B.push_back(i + 1);
				break;
			}
		}
		else {
			switch (vl)
			{
			case 0:
				B.push_back(i);
				B.push_back(i + 1);
				break;
			case 1:
				B.push_back(i);
				A.push_back(i + 1);
				ans += 1;
				break;
			case 2:
				A.push_back(i);
				B.push_back(i + 1);
				ans += 1;
				break;
			case 3:
				A.push_back(i);
				A.push_back(i + 1);
				ans += 2;
				break;
			}
		}
	}
	int ind = max(anh, VAL);
	while (ind != n) {
		if (A.size() >= B.size()) {
			ask.clear();
			int cnt = 0;
			while (cnt != A.size() && ind != n) {
				ask.push_back(A[cnt]);
				ask.push_back(ind);
				cnt++;
				ind++;
			}
			vl = use_machine(ask);
			/*for (int x : ask) {
				cout << x << " ";
			}*/
			//cout << "-> " << vl << endl;
			ans += cnt;
			if (vl % 2 != 0) {
				ans--;
				vl--;
				B.push_back(ind - 1);
			}
			else {
				A.push_back(ind - 1);
			}
			ans -= vl / 2;
			//cout << ans << endl;
		}
		else {
			ask.clear();
			int cnt = 0;
			while (cnt != B.size() && ind != n) {
				ask.push_back(B[cnt]);
				ask.push_back(ind);
				cnt++;
				ind++;
			}
			vl = use_machine(ask);
			if (vl % 2 != 0) {
				ans++;
				vl--;
				A.push_back(ind - 1);
			}
			else {
				B.push_back(ind - 1);
			}
			ans += vl / 2;
		}
	}
	
	return ans;
}

/*
7
0 0 1 0 0 1 1
8
0 0 0 0 0 0 0 0
20 
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
20 
0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1
*/

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:137:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  137 |    while (cnt != A.size() && ind != n) {
      |           ~~~~^~~~~~~~~~~
mushrooms.cpp:163:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  163 |    while (cnt != B.size() && ind != n) {
      |           ~~~~^~~~~~~~~~~

Subtask #1

92.623 / 100.0

#	Verdict	Execution time	Memory	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	208 KB	Output is correct
6	Correct	2 ms	208 KB	Output is correct
7	Correct	5 ms	208 KB	Output is correct
8	Correct	7 ms	308 KB	Output is correct
9	Correct	6 ms	208 KB	Output is correct
10	Correct	6 ms	308 KB	Output is correct
11	Partially correct	6 ms	312 KB	Output is partially correct
12	Correct	7 ms	208 KB	Output is correct
13	Correct	6 ms	208 KB	Output is correct
14	Correct	3 ms	208 KB	Output is correct
15	Partially correct	6 ms	332 KB	Output is partially correct
16	Partially correct	6 ms	208 KB	Output is partially correct
17	Correct	4 ms	208 KB	Output is correct
18	Correct	5 ms	208 KB	Output is correct
19	Partially correct	5 ms	208 KB	Output is partially correct
20	Correct	7 ms	304 KB	Output is correct
21	Correct	6 ms	208 KB	Output is correct
22	Partially correct	7 ms	316 KB	Output is partially correct
23	Correct	6 ms	208 KB	Output is correct
24	Correct	5 ms	208 KB	Output is correct
25	Partially correct	6 ms	208 KB	Output is partially correct
26	Partially correct	6 ms	208 KB	Output is partially correct
27	Partially correct	8 ms	316 KB	Output is partially correct
28	Partially correct	8 ms	328 KB	Output is partially correct
29	Partially correct	6 ms	208 KB	Output is partially correct
30	Partially correct	5 ms	332 KB	Output is partially correct
31	Partially correct	8 ms	320 KB	Output is partially correct
32	Partially correct	6 ms	208 KB	Output is partially correct
33	Partially correct	11 ms	208 KB	Output is partially correct
34	Partially correct	9 ms	208 KB	Output is partially correct
35	Partially correct	9 ms	208 KB	Output is partially correct
36	Partially correct	6 ms	332 KB	Output is partially correct
37	Partially correct	6 ms	208 KB	Output is partially correct
38	Partially correct	6 ms	316 KB	Output is partially correct
39	Partially correct	6 ms	320 KB	Output is partially correct
40	Partially correct	10 ms	336 KB	Output is partially correct
41	Partially correct	8 ms	312 KB	Output is partially correct
42	Partially correct	9 ms	320 KB	Output is partially correct
43	Partially correct	15 ms	208 KB	Output is partially correct
44	Partially correct	6 ms	208 KB	Output is partially correct
45	Partially correct	7 ms	308 KB	Output is partially correct
46	Partially correct	6 ms	336 KB	Output is partially correct
47	Partially correct	6 ms	208 KB	Output is partially correct
48	Partially correct	11 ms	336 KB	Output is partially correct
49	Partially correct	7 ms	312 KB	Output is partially correct
50	Partially correct	6 ms	320 KB	Output is partially correct
51	Partially correct	6 ms	336 KB	Output is partially correct
52	Partially correct	8 ms	316 KB	Output is partially correct
53	Partially correct	7 ms	332 KB	Output is partially correct
54	Partially correct	7 ms	324 KB	Output is partially correct
55	Partially correct	6 ms	336 KB	Output is partially correct
56	Partially correct	6 ms	340 KB	Output is partially correct
57	Partially correct	6 ms	208 KB	Output is partially correct
58	Partially correct	5 ms	328 KB	Output is partially correct
59	Partially correct	5 ms	328 KB	Output is partially correct
60	Partially correct	6 ms	320 KB	Output is partially correct
61	Partially correct	6 ms	316 KB	Output is partially correct
62	Correct	1 ms	208 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	1 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	1 ms	208 KB	Output is correct
76	Correct	0 ms	208 KB	Output is correct
77	Correct	2 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	1 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	1 ms	208 KB	Output is correct
85	Correct	1 ms	208 KB	Output is correct
86	Correct	0 ms	208 KB	Output is correct
87	Correct	1 ms	208 KB	Output is correct
88	Correct	1 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