oj.uz

답안 #834799

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
834799 2023-08-22T19:44:11 Z Johann 버섯 세기 (IOI20_mushrooms) C++14
92.623 / 100
 7 ms 336 KB 
#include "mushrooms.h"
#include "bits/stdc++.h"
using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

int count_mushrooms(int n)
{
	vi m;
	// 0 for a and 1 for b
	vvi sure(2);
	vi cnt(2, 0);
	sure[0].push_back(0);
	cnt[0] = 1;
	int idx = 1;
	while (idx < n && max(sz(sure[0]), sz(sure[1])) < 2)
	{
		assert(sz(sure[0]) > 0);
		m.clear();
		m.push_back(sure[0].front());
		m.push_back(idx++);
		int c1 = use_machine(m);
		++cnt[c1], sure[c1].push_back(m.back());
	}
	while (idx < n && max(sz(sure[0]), sz(sure[1])) < sqrt(n) / 2 + 10)
	{
		int i = (sz(sure[0]) < sz(sure[1]));
		m.clear();
		for (int j = 0; j < 2; ++j)
		{
			m.push_back(sure[i][j]);
			if (idx < n)
				m.push_back(idx++);
		}
		int c2 = use_machine(m);
		++cnt[i ^ (c2 / 2)], sure[i ^ (c2 / 2)].push_back(m[1]);
		if (sz(m) > 3)
			++cnt[i ^ (c2 & 1)], sure[i ^ (c2 & 1)].push_back(m[3]);
	}

	while (idx < n)
	{
		int i = (sz(sure[0]) < sz(sure[1]));
		m.clear();
		for (int j = 0; j < sz(sure[i]) && idx < n; ++j)
		{
			m.push_back(sure[i][j]);
			m.push_back(idx++);
		}
		int c3 = use_machine(m);
		int lenCnt = (sz(m) - 2) / 2;
		cnt[i] += lenCnt - (c3 / 2);
		cnt[i ^ 1] += c3 / 2;

		++cnt[i ^ (c3 & 1)], sure[i ^ (c3 & 1)].push_back(m.back());
	}

	return cnt[0];
}

Subtask #1
92.623 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 1 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 1 ms 208 KB Output is correct
7 Correct 5 ms 208 KB Output is correct
8 Correct 5 ms 336 KB Output is correct
9 Correct 5 ms 208 KB Output is correct
10 Correct 6 ms 336 KB Output is correct
11 Partially correct 6 ms 336 KB Output is partially correct
12 Correct 6 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 5 ms 208 KB Output is partially correct
16 Partially correct 6 ms 308 KB Output is partially correct
17 Correct 3 ms 336 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 5 ms 336 KB Output is correct
21 Correct 5 ms 336 KB Output is correct
22 Partially correct 7 ms 324 KB Output is partially correct
23 Correct 5 ms 208 KB Output is correct
24 Correct 3 ms 208 KB Output is correct
25 Partially correct 5 ms 336 KB Output is partially correct
26 Partially correct 5 ms 332 KB Output is partially correct
27 Correct 5 ms 208 KB Output is correct
28 Partially correct 5 ms 324 KB Output is partially correct
29 Partially correct 5 ms 208 KB Output is partially correct
30 Partially correct 7 ms 336 KB Output is partially correct
31 Partially correct 7 ms 208 KB Output is partially correct
32 Partially correct 5 ms 208 KB Output is partially correct
33 Partially correct 6 ms 208 KB Output is partially correct
34 Partially correct 5 ms 336 KB Output is partially correct
35 Partially correct 7 ms 308 KB Output is partially correct
36 Partially correct 5 ms 220 KB Output is partially correct
37 Partially correct 5 ms 208 KB Output is partially correct
38 Partially correct 6 ms 336 KB Output is partially correct
39 Partially correct 4 ms 336 KB Output is partially correct
40 Partially correct 6 ms 208 KB Output is partially correct
41 Partially correct 5 ms 336 KB Output is partially correct
42 Partially correct 5 ms 324 KB Output is partially correct
43 Partially correct 7 ms 208 KB Output is partially correct
44 Partially correct 6 ms 336 KB Output is partially correct
45 Partially correct 7 ms 208 KB Output is partially correct
46 Partially correct 7 ms 336 KB Output is partially correct
47 Partially correct 6 ms 336 KB Output is partially correct
48 Partially correct 6 ms 208 KB Output is partially correct
49 Partially correct 6 ms 208 KB Output is partially correct
50 Partially correct 5 ms 336 KB Output is partially correct
51 Partially correct 7 ms 328 KB Output is partially correct
52 Partially correct 5 ms 336 KB Output is partially correct
53 Partially correct 7 ms 336 KB Output is partially correct
54 Partially correct 5 ms 208 KB Output is partially correct
55 Partially correct 6 ms 320 KB Output is partially correct
56 Partially correct 5 ms 208 KB Output is partially correct
57 Partially correct 6 ms 336 KB Output is partially correct
58 Partially correct 5 ms 208 KB Output is partially correct
59 Partially correct 5 ms 208 KB Output is partially correct
60 Partially correct 5 ms 336 KB Output is partially correct
61 Partially correct 5 ms 324 KB Output is partially correct
62 Correct 0 ms 208 KB Output is correct
63 Correct 0 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 0 ms 208 KB Output is correct
70 Correct 1 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 0 ms 208 KB Output is correct
75 Correct 0 ms 208 KB Output is correct
76 Correct 1 ms 208 KB Output is correct
77 Correct 1 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 0 ms 208 KB Output is correct
81 Correct 0 ms 208 KB Output is correct
82 Correct 0 ms 208 KB Output is correct
83 Correct 0 ms 208 KB Output is correct
84 Correct 0 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 0 ms 208 KB Output is correct
88 Correct 0 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