oj.uz

답안 #1023011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1023011 2024-07-14T08:40:46 Z TheWilp 버섯 세기 (IOI20_mushrooms) C++14
92.623 / 100
 6 ms 600 KB 
#include "mushrooms.h"

int count_mushrooms(int n) {
	if(n == 1) return 1;
	std::vector<int> A;
	std::vector<int> B;
	A.push_back(0);
	int ans = 0;

	int i = 1;
	while(i < n) {
		bool Abase = B.size() <= A.size();
		std::vector<int>* in = Abase ? &A : &B;
		std::vector<int> v;

		if(in->size() >= 2 && in->size() < 80) {
			v.push_back((*in)[0]);
			v.push_back(i++);
			v.push_back((*in)[1]);
			bool back_push = i < n;
			if(back_push) v.push_back(i++);

			int count = use_machine(v);
			if(Abase) {
				if(back_push) {
					if(count%2) B.push_back(v.back());
					else A.push_back(v.back());
				}
				if(count > 1) B.push_back(v[1]);
				else A.push_back(v[1]);
			}
			else {
				if(back_push) {
					if(count%2) A.push_back(v.back());
					else B.push_back(v.back());
				}
				if(count > 1) A.push_back(v[1]);
				else B.push_back(v[1]);
			}
		}
		else {
			int c = 1;
			v.push_back((*in)[0]);
			while(i < n) {
				if(c < in->size()) {
					v.push_back(i++);
					v.push_back((*in)[c++]);
				}
				else {
					break;
				}
			}
			bool pos_push = false;
			if(i < n) v.push_back(i++),pos_push = true;
			int count = use_machine(v);
			if(Abase) {
				ans += (v.size() + 1) / 2 - 1 - count / 2;
				if(pos_push) 
					if(count%2) B.push_back(v.back());
					else A.push_back(v.back());
			}
			else {
				ans += count / 2;
				if(pos_push) 
					if(count%2) A.push_back(v.back());
					else B.push_back(v.back());
			}
		}
	}
	return ans + A.size();
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:45:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     if(c < in->size()) {
      |        ~~^~~~~~~~~~~~
mushrooms.cpp:58:7: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   58 |     if(pos_push)
      |       ^
mushrooms.cpp:64:7: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   64 |     if(pos_push)
      |       ^

Subtask #1
92.623 / 100.0

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