oj.uz

Submission #1052610

# Submission time Handle Problem Language Result Execution time Memory
1052610 2024-08-10T17:24:36 Z aykhn Counting Mushrooms (IOI20_mushrooms) C++17
92.2449 / 100
 6 ms 800 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
 
using namespace std;
 
int B = 70;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
int count_mushrooms(int n) 
{
	vector<int> v[2];
	vector<int> o(n);
	iota(o.begin(), o.end(), 0);
	shuffle(o.begin() + 1, o.end(), rng);
	v[0] = {0};
	int i = 1;
	while (i < n && max(v[0].size(), v[1].size()) < 2) v[use_machine({0, o[i]})].push_back(o[i]), i++;
	for (; i < n && max(v[0].size(), v[1].size()) < B; i += 2) 
	{
		if (i + 1 < n)
		{
			if (v[0].size() >= 2)
			{
				int x = use_machine({v[0][0], o[i], v[0][1], o[i + 1]});
				v[x >> 1 & 1].push_back(o[i]);
				v[x & 1].push_back(o[i + 1]);
			}
			else
			{
				int x = use_machine({v[1][0], o[i], v[1][1], o[i + 1]});
				v[1 ^ (x >> 1 & 1)].push_back(o[i]);
				v[1 ^ (x & 1)].push_back(o[i + 1]);
			}
		}
		else v[use_machine({0, o[i]})].push_back(o[i]);
	}
	int res = 0;
	for (int j = i; j < n;)
	{
		vector<int> q;
		int l = j, r = min(n, j + (int)max(v[0].size(), v[1].size()));
		int sz = r - l;
		for (int k = l; k < r; k++)
		{
			if (v[0].size() > v[1].size())
			{
				q.push_back(v[0][k - l]);
				q.push_back(o[k]);
			}
			else
			{
				q.push_back(v[1][k - l]);
				q.push_back(o[k]);
			}
		}
		if (v[0].size() > v[1].size())
		{
			int x = use_machine(q);
			res += sz - ((x + 1) / 2);
			if (x & 1) v[1].push_back(o[r - 1]);
			else v[0].push_back(o[r - 1]), res--;
		}
		else
		{
			int x = use_machine(q);
			res += (x + 1) / 2;
			if (x & 1) v[0].push_back(o[r - 1]), res--;
			else v[1].push_back(o[r - 1]);
		}
		j = r;
	}
	return res + v[0].size();
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:19:48: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   19 |  for (; i < n && max(v[0].size(), v[1].size()) < B; i += 2)
      |                  ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~

Subtask #1
92.2449 / 100.0

# Verdict Execution time Memory 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 1 ms 340 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 5 ms 544 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 5 ms 788 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Partially correct 6 ms 544 KB Output is partially correct
12 Correct 4 ms 524 KB Output is correct
13 Correct 5 ms 504 KB Output is correct
14 Correct 3 ms 500 KB Output is correct
15 Partially correct 5 ms 600 KB Output is partially correct
16 Partially correct 6 ms 344 KB Output is partially correct
17 Correct 2 ms 500 KB Output is correct
18 Correct 4 ms 788 KB Output is correct
19 Partially correct 3 ms 344 KB Output is partially correct
20 Correct 4 ms 792 KB Output is correct
21 Correct 4 ms 344 KB Output is correct
22 Partially correct 5 ms 344 KB Output is partially correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 3 ms 496 KB Output is correct
25 Partially correct 6 ms 788 KB Output is partially correct
26 Partially correct 5 ms 344 KB Output is partially correct
27 Partially correct 5 ms 532 KB Output is partially correct
28 Partially correct 5 ms 532 KB Output is partially correct
29 Partially correct 5 ms 528 KB Output is partially correct
30 Partially correct 5 ms 600 KB Output is partially correct
31 Partially correct 5 ms 600 KB Output is partially correct
32 Partially correct 5 ms 540 KB Output is partially correct
33 Partially correct 5 ms 548 KB Output is partially correct
34 Partially correct 5 ms 528 KB Output is partially correct
35 Partially correct 4 ms 532 KB Output is partially correct
36 Partially correct 6 ms 784 KB Output is partially correct
37 Partially correct 5 ms 540 KB Output is partially correct
38 Partially correct 4 ms 532 KB Output is partially correct
39 Partially correct 3 ms 552 KB Output is partially correct
40 Partially correct 5 ms 532 KB Output is partially correct
41 Partially correct 4 ms 344 KB Output is partially correct
42 Partially correct 5 ms 544 KB Output is partially correct
43 Partially correct 4 ms 544 KB Output is partially correct
44 Partially correct 4 ms 780 KB Output is partially correct
45 Partially correct 5 ms 344 KB Output is partially correct
46 Partially correct 5 ms 524 KB Output is partially correct
47 Partially correct 5 ms 600 KB Output is partially correct
48 Partially correct 4 ms 552 KB Output is partially correct
49 Partially correct 4 ms 800 KB Output is partially correct
50 Partially correct 6 ms 344 KB Output is partially correct
51 Partially correct 6 ms 548 KB Output is partially correct
52 Partially correct 5 ms 548 KB Output is partially correct
53 Partially correct 6 ms 788 KB Output is partially correct
54 Partially correct 5 ms 528 KB Output is partially correct
55 Partially correct 5 ms 544 KB Output is partially correct
56 Partially correct 4 ms 600 KB Output is partially correct
57 Partially correct 5 ms 344 KB Output is partially correct
58 Partially correct 4 ms 344 KB Output is partially correct
59 Partially correct 3 ms 344 KB Output is partially correct
60 Partially correct 5 ms 792 KB Output is partially correct
61 Partially correct 4 ms 344 KB Output is partially correct
62 Correct 1 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 1 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 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct