제출 #547720

#제출 시각아이디문제언어결과실행 시간메모리
547720LucaDantas버섯 세기 (IOI20_mushrooms)C++17
0 / 100
3087 ms208 KiB
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

constexpr int repeticoes = 80;
int qtd_min = 180;

vector<int> color[2];

int count_mushrooms(int N) {
	// qtd_min = min(qtd_min, N-1);
	qtd_min = 1;
	int cnt[2]{};
	color[0] = {0};
	
	vector<int> unknown(N-1);
	iota(unknown.begin(), unknown.end(), 1);
	
	while(unknown.size()) {
		int usar = color[1].size() > color[0].size(); // escolho o grupo que tem mais gente pra usar
		int sz = color[usar].size();

		if(sz == 2) {
			for(; (max(color[0].size(), color[1].size()) < 3 || min(color[0].size(), color[1].size()) < 2)
					&& color[0].size() + color[1].size() < qtd_min && unknown.size() > 2;) {
				vector<int> qr;
				for(int i = 0; i < 2; i++, unknown.pop_back())
					qr.push_back(color[usar][i]), qr.push_back(unknown.back());

				int resp = use_machine(qr);

				color[usar ^ (resp&1)].push_back(qr.back());
				resp >>= 1;
				color[usar ^ (resp&1)].push_back(qr[1]);
			}

			continue;
		}

		vector<int> qr;
		for(int i = 0; i < sz && unknown.size(); i++, unknown.pop_back())
			qr.push_back(color[usar][i]), qr.push_back(unknown.back());

		int resp = use_machine(qr);

		color[usar ^ (resp&1)].push_back(qr.back());

		cnt[usar^1] += resp/2;
		cnt[usar] += (qr.size() / 2 - 1) - resp/2;
	}

	return cnt[0] + color[0].size();
}

컴파일 시 표준 에러 (stderr) 메시지

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:25:43: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   25 |      && color[0].size() + color[1].size() < qtd_min && unknown.size() > 2;) {
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...