Submission #331915

#TimeUsernameProblemLanguageResultExecution timeMemory
331915pggpCounting Mushrooms (IOI20_mushrooms)C++14
79.86 / 100
11 ms620 KiB
#include <bits/stdc++.h>
#include "mushrooms.h"

using namespace std;


vector < bool > mushrooms;

int use_machine(vector < int > x);

int c;

int count_mushrooms(int n){
	int num = 290;
	int ans = 1;
	if(n < num){
		for (int i = 1; i < n; ++i)
		{
			vector < int > v;
			v.push_back(0);
			v.push_back(i);
			ans += 1 - use_machine(v);
		}
		return ans;
	}

	vector < int > A_pos;
	vector < int > B_pos;

	for (int i = 1; i < 4; ++i)
	{
		vector < int > v;
		v.push_back(0);
		v.push_back(i);
		int t = use_machine(v);
		if(t){
			B_pos.push_back(i);
		}
		else{
			A_pos.push_back(i);
		}
	}

	if(A_pos.size() > 1){
		for (int i = 4; i < num; i += 2)
		{
			vector < int > v;
			v.push_back(0);
			v.push_back(i);
			v.push_back(A_pos[0]);
			v.push_back(i + 1);
			int t = use_machine(v);
			if(t == 0){
				A_pos.push_back(i);
				A_pos.push_back(i + 1);
			}
			if(t == 1){
				A_pos.push_back(i);
				B_pos.push_back(i + 1);
			}
			if(t == 2){
				A_pos.push_back(i + 1);
				B_pos.push_back(i);
			}

			if(t == 3){
				B_pos.push_back(i);
				B_pos.push_back(i + 1);
			}
		}
	}
	else{
		//cout << "xxx" << endl;
		for (int i = 4; i < num; i += 2)
		{
			vector < int > v;
			v.push_back(0);
			v.push_back(B_pos[0]);
			v.push_back(i);
			v.push_back(B_pos[1]);
			v.push_back(i + 1);
			int t = use_machine(v);
			if(t == 1){
				B_pos.push_back(i);
				B_pos.push_back(i + 1);
			}
			if(t == 2){
				B_pos.push_back(i);
				A_pos.push_back(i + 1);
			}
			if(t == 3){
				B_pos.push_back(i + 1);
				A_pos.push_back(i);
			}

			if(t == 4){
				A_pos.push_back(i);
				A_pos.push_back(i + 1);
			}
		}
	}

	/*cout << "A_pos " << endl;
	for (int i = 0; i < A_pos.size(); ++i)
	{
		cout << A_pos[i] << " ";
	}
	cout << endl;

	cout << "B_pos " << endl;
	for (int i = 0; i < A_pos.size(); ++i)
	{
		cout << B_pos[i] << " ";
	}
	cout << endl;*/

	int cur = num;
	if(A_pos.size() > B_pos.size()){
		while(cur < n){
			int in_heap = 0;
			vector < int > v;
			v.push_back(0);
			for(int i = 1; i < A_pos.size() - 1; i++){
				v.push_back(cur);
				in_heap++;
				v.push_back(A_pos[i]);
				cur++;	
				if(cur == n){
					break;
				}	
			}
			v.push_back(A_pos[A_pos.size() - 1]);

			int resp = use_machine(v);
			ans += in_heap - resp/2;
		}
	}
	else{
		while(cur < n){
			vector < int > v;
			v.push_back(0);
			v.push_back(B_pos[0]);
			for(int i = 1; i < B_pos.size(); i++){
				v.push_back(cur);
				v.push_back(B_pos[i]);
				cur++;	
				if(cur == n){
					break;
				}	
			}
			int resp = use_machine(v);
			ans += (resp-1)/2;
		}
	}
	
	return ans + A_pos.size();
}

Compilation message (stderr)

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:123:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |    for(int i = 1; i < A_pos.size() - 1; i++){
      |                   ~~^~~~~~~~~~~~~~~~~~
mushrooms.cpp:143:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  143 |    for(int i = 1; i < B_pos.size(); i++){
      |                   ~~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...