oj.uz

답안 #304617

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
304617 2020-09-21T15:26:47 Z galca 버섯 세기 (IOI20_mushrooms) C++14
91.8699 / 100
 14 ms 416 KB 
#include "mushrooms.h"
#include "iostream"

using namespace std;

vector<int> knownZeros;
vector<int> knownOnes;
vector<int> alternating;

void resolveAlternating(int lastVal) {
	if (alternating.size() > 0) {
		if (lastVal == -1) {
			lastVal = use_machine({ 0, alternating[alternating.size()-1] });
		}
		else {
			alternating.pop_back();
			lastVal ^= 1;
		}

		while (alternating.size() > 0) {
			if (lastVal) {
				knownOnes.push_back(alternating[alternating.size() - 1]);
			}
			else {
				knownZeros.push_back(alternating[alternating.size() - 1]);
			}
			lastVal ^= 1;
			alternating.pop_back();
		}
	}
}

int count_mushrooms(int n) {
	knownZeros.push_back(0);
	// find one more, or two 1s
	int i = 1;
	while ((knownZeros.size() < 2) && (knownOnes.size() < 2)) {
		int c = use_machine({ 0, i });
		if (c) {
			knownOnes.push_back(i);
		}
		else {
			knownZeros.push_back(i);
		}
		++i;
		if (i == n) {
			return knownZeros.size();
		}
	}

	vector<int> fives;
	bool isZero = false;

	if (knownZeros.size() == 2) {
		fives.push_back(0);
		fives.push_back(knownZeros[0]);
		fives.push_back(0);
		fives.push_back(knownZeros[1]);
		fives.push_back(0);
		isZero = true;
	}
	else {
		fives.push_back(0);
		fives.push_back(knownOnes[0]);
		fives.push_back(0);
		fives.push_back(knownOnes[1]);
		fives.push_back(0);
	}

	while (((knownZeros.size() + (alternating.size() / 2)) < 100) && 
		((knownOnes.size() + (alternating.size() / 2)) < 100)) {
		if (i == n) {
			resolveAlternating(-1);
			return knownZeros.size();
		}
		if (i == (n - 1)) {
			int c = 1;
			if (alternating.size() == 0) {
				c = use_machine({ 0, n - 1 });
			}
			resolveAlternating(-1);
			return knownZeros.size() + 1 - c;
		}
		if (i == (n - 2)) {
			int c = 1;
			if (alternating.size() == 0) {
				c = use_machine({ 0, n - 1 });
			}
			resolveAlternating(-1);
			int c1 = use_machine({ 0, n - 2 });;
			return knownZeros.size() + 2 - c1 - c;
		}

		fives[0] = i;
		fives[2] = i + 1;
		fives[4] = i + 2;
		int c = use_machine(fives);

		switch (c) {
			case 0:
				if (isZero) {
					knownZeros.push_back(i);
					knownZeros.push_back(i+1);
					knownZeros.push_back(i+2);
					resolveAlternating(0);
				}
				else {
					knownOnes.push_back(i);
					knownOnes.push_back(i + 1);
					knownOnes.push_back(i + 2);
					resolveAlternating(1);
				}
				i += 3;
				break;
			case 1:
				if (isZero) {
					knownZeros.push_back(i+1);
					if (alternating.size() == 0) {
						alternating.push_back(i);
					}
					alternating.push_back(i + 2);
				}
				else {
					knownOnes.push_back(i + 1);
					if (alternating.size() == 0) {
						alternating.push_back(i);
					}
					alternating.push_back(i + 2);
				}
				i += 2;
				break;
			case 2:
				if (isZero) {
					if (alternating.size() == 0) {
						alternating.push_back(i);
					}
					alternating.push_back(i + 1);
					alternating.push_back(i + 2);
				}
				else {
					if (alternating.size() == 0) {
						alternating.push_back(i);
					}
					alternating.push_back(i + 1);
					alternating.push_back(i + 2);
				}
				i += 2;
				break;
			case 3:
				if (isZero) {
					knownOnes.push_back(i+1);
					if (alternating.size() == 0) {
						alternating.push_back(i);
					}
					alternating.push_back(i + 2);
				}
				else {
					knownZeros.push_back(i + 1);
					if (alternating.size() == 0) {
						alternating.push_back(i);
					}
					alternating.push_back(i + 2);
				}
				i += 2;
				break;
			case 4:
				if (isZero) {
					knownOnes.push_back(i);
					knownOnes.push_back(i + 1);
					knownOnes.push_back(i + 2);
					resolveAlternating(1);
				}
				else {
					knownZeros.push_back(i);
					knownZeros.push_back(i + 1);
					knownZeros.push_back(i + 2);
					resolveAlternating(0);
				}
				i += 3;
				break;
		}
	}

	resolveAlternating(-1);
	i = knownZeros.size() + knownOnes.size();

	int totalZeros = knownZeros.size();

	while (i < n) {
		vector<int> m;
		if (knownOnes.size() >= knownZeros.size()) {
			
			for (int j = 0; j < knownOnes.size(); j++) {
				if ((i + j) < n) {
					m.push_back(knownOnes[j]);
					m.push_back(i + j);
				}
			}
			i += knownOnes.size();
			int c = use_machine(m);
			if (c & 1) {
				++totalZeros;
				--c;
				knownZeros.push_back(m[m.size() - 1]);
			}
			else {
				knownOnes.push_back(m[m.size() - 1]);
			}
			totalZeros += c / 2;
			
		}
		else {
			for (int j = 0; j < knownZeros.size(); j++) {
				if ((i + j) < n) {
					m.push_back(knownZeros[j]);
					m.push_back(i + j);
				}
			}
			i += knownZeros.size();
			int c = use_machine(m);
			if (c & 1) {
				++c;
				knownOnes.push_back(m[m.size() - 1]);
			}
			else {
				knownZeros.push_back(m[m.size() - 1]);
			}
			totalZeros += (m.size() - c) / 2;
			
		}
	}
	return totalZeros;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:193:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  193 |    for (int j = 0; j < knownOnes.size(); j++) {
      |                    ~~^~~~~~~~~~~~~~~~~~
mushrooms.cpp:213:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  213 |    for (int j = 0; j < knownZeros.size(); j++) {
      |                    ~~^~~~~~~~~~~~~~~~~~~

Subtask #1
91.8699 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 416 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 3 ms 256 KB Output is correct
7 Correct 9 ms 256 KB Output is correct
8 Correct 8 ms 256 KB Output is correct
9 Correct 8 ms 256 KB Output is correct
10 Correct 7 ms 256 KB Output is correct
11 Correct 9 ms 288 KB Output is correct
12 Correct 7 ms 256 KB Output is correct
13 Correct 9 ms 256 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Partially correct 6 ms 388 KB Output is partially correct
16 Partially correct 10 ms 256 KB Output is partially correct
17 Correct 4 ms 256 KB Output is correct
18 Correct 8 ms 256 KB Output is correct
19 Partially correct 9 ms 288 KB Output is partially correct
20 Correct 7 ms 384 KB Output is correct
21 Correct 9 ms 384 KB Output is correct
22 Partially correct 7 ms 256 KB Output is partially correct
23 Correct 7 ms 256 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Partially correct 10 ms 256 KB Output is partially correct
26 Correct 10 ms 384 KB Output is correct
27 Partially correct 9 ms 256 KB Output is partially correct
28 Correct 9 ms 256 KB Output is correct
29 Partially correct 9 ms 256 KB Output is partially correct
30 Partially correct 12 ms 256 KB Output is partially correct
31 Partially correct 10 ms 368 KB Output is partially correct
32 Partially correct 13 ms 384 KB Output is partially correct
33 Partially correct 10 ms 384 KB Output is partially correct
34 Partially correct 14 ms 256 KB Output is partially correct
35 Partially correct 8 ms 308 KB Output is partially correct
36 Partially correct 9 ms 384 KB Output is partially correct
37 Partially correct 9 ms 256 KB Output is partially correct
38 Partially correct 10 ms 376 KB Output is partially correct
39 Partially correct 8 ms 376 KB Output is partially correct
40 Partially correct 10 ms 256 KB Output is partially correct
41 Partially correct 10 ms 256 KB Output is partially correct
42 Partially correct 7 ms 256 KB Output is partially correct
43 Partially correct 8 ms 380 KB Output is partially correct
44 Partially correct 8 ms 256 KB Output is partially correct
45 Partially correct 9 ms 360 KB Output is partially correct
46 Partially correct 8 ms 256 KB Output is partially correct
47 Partially correct 8 ms 256 KB Output is partially correct
48 Partially correct 7 ms 384 KB Output is partially correct
49 Partially correct 7 ms 256 KB Output is partially correct
50 Partially correct 8 ms 256 KB Output is partially correct
51 Partially correct 8 ms 256 KB Output is partially correct
52 Partially correct 7 ms 256 KB Output is partially correct
53 Partially correct 9 ms 288 KB Output is partially correct
54 Partially correct 8 ms 288 KB Output is partially correct
55 Partially correct 8 ms 384 KB Output is partially correct
56 Partially correct 9 ms 256 KB Output is partially correct
57 Partially correct 8 ms 256 KB Output is partially correct
58 Partially correct 7 ms 256 KB Output is partially correct
59 Partially correct 8 ms 384 KB Output is partially correct
60 Partially correct 7 ms 256 KB Output is partially correct
61 Partially correct 8 ms 376 KB Output is partially correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 1 ms 256 KB Output is correct
64 Correct 1 ms 288 KB Output is correct
65 Correct 0 ms 256 KB Output is correct
66 Correct 1 ms 256 KB Output is correct
67 Correct 1 ms 256 KB Output is correct
68 Correct 1 ms 256 KB Output is correct
69 Correct 1 ms 256 KB Output is correct
70 Correct 1 ms 256 KB Output is correct
71 Correct 1 ms 256 KB Output is correct
72 Correct 0 ms 256 KB Output is correct
73 Correct 1 ms 256 KB Output is correct
74 Correct 1 ms 256 KB Output is correct
75 Correct 0 ms 256 KB Output is correct
76 Correct 1 ms 256 KB Output is correct
77 Correct 1 ms 256 KB Output is correct
78 Correct 1 ms 288 KB Output is correct
79 Correct 0 ms 256 KB Output is correct
80 Correct 1 ms 256 KB Output is correct
81 Correct 1 ms 256 KB Output is correct
82 Correct 1 ms 256 KB Output is correct
83 Correct 1 ms 256 KB Output is correct
84 Correct 1 ms 256 KB Output is correct
85 Correct 0 ms 256 KB Output is correct
86 Correct 0 ms 256 KB Output is correct
87 Correct 0 ms 256 KB Output is correct
88 Correct 0 ms 256 KB Output is correct
89 Correct 1 ms 256 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 0 ms 256 KB Output is correct