oj.uz

Submission #1018862

# Submission time Handle Problem Language Result Execution time Memory
1018862 2024-07-10T10:18:26 Z Boas Counting Mushrooms (IOI20_mushrooms) C++17
80.427 / 100
 6 ms 444 KB 
#include <bits/stdc++.h>
using namespace std;
#include "mushrooms.h"
 
#define loop(x, i) for (int i = 0; i < x; i++)
#define pb push_back
#define ALL(x) (x).begin(), (x).end()
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef set<int> si;
typedef vector<vi> vvi;
 
int count_mushrooms(int n)
{
	vi A = {0}, B;
	int c1 = use_machine({0, 1});
	int i = 2;
	if (c1 == 1)
	{
		if (n == 2)
			return 1;
		B.pb(1);
		int c2 = use_machine({1, 2});
		i++;
		if (c2 == 1)
			A.pb(2);
		else
			B.pb(2);
	}
	else
	{
		A.pb(1);
	}
    int x = sqrt(n);
	while (max(A.size(), B.size()) < x)
	{
		if (A.size() >= 2)
		{
				if (i + 1 >= n)
					break;
				int res = use_machine({A[0], i, A[1], i + 1});
				if (res == 0)
				{
					A.pb(i);
					A.pb(i + 1);
				}
				else if (res == 1)
				{
					A.pb(i);
                    B.pb(i+1);
				}
				else if (res == 2)
				{
					A.pb(i + 1);
                    B.pb(i);
				}
                else 
                {
                    B.pb(i);
                    B.pb(i+1);
                }
				i += 2;
		}
		else
		{
				if (i + 1 >= n)
					break;
				int res = use_machine({B[0], i, B[1], i + 1});
				if (res == 3)
				{
					A.pb(i);
					A.pb(i + 1);
				}
				else if (res == 2)
				{
					A.pb(i);
                    B.pb(i+1);
				}
				else if (res == 1)
				{
					A.pb(i + 1);
                    B.pb(i);
				}
                else
                {
                    B.pb(i+1);
                    B.pb(i);
                }
				i += 2;
		}
	}
	if (i == n - 1)
	{
		if (use_machine({0, i}) == 0)
			A.pb(i);
        i++;
	}
    int res = A.size();
    for (; i < n; i += x)
    {
        vi q;
        if (A.size() >= x)
        {
            int l = min(x, n - i);
            loop(l, j)
            {
                q.pb(A.at(j));
                q.pb(i + j);
            }
            int c3 = use_machine(q);
            if (c3 % 2 == 1) c3++;
            res += l - (c3 / 2);
            q.clear();
        }
        else
        {
            int l = min(x, n - i);
            loop(l, j)
            {
                q.pb(B.at(j));
                q.pb(i + j);
            }
            int c3 = use_machine(q);
            if (c3 % 2 == 1) c3++;
            res += (c3 / 2);
            q.clear();
        }
    }
	return res;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:35:33: warning: comparison of integer expressions of different signedness: 'const long unsigned int' and 'int' [-Wsign-compare]
   35 |  while (max(A.size(), B.size()) < x)
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~
mushrooms.cpp:102:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  102 |         if (A.size() >= x)
      |             ~~~~~~~~~^~~~

Subtask #1
80.427 / 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 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Partially correct 6 ms 344 KB Output is partially correct
11 Partially correct 4 ms 344 KB Output is partially correct
12 Partially correct 5 ms 344 KB Output is partially correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Partially correct 3 ms 344 KB Output is partially correct
16 Partially correct 4 ms 344 KB Output is partially correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Partially correct 4 ms 344 KB Output is partially correct
20 Partially correct 6 ms 344 KB Output is partially correct
21 Partially correct 3 ms 344 KB Output is partially correct
22 Partially correct 3 ms 344 KB Output is partially correct
23 Partially correct 3 ms 344 KB Output is partially correct
24 Correct 2 ms 344 KB Output is correct
25 Partially correct 4 ms 344 KB Output is partially correct
26 Partially correct 4 ms 344 KB Output is partially correct
27 Partially correct 5 ms 344 KB Output is partially correct
28 Partially correct 6 ms 340 KB Output is partially correct
29 Partially correct 4 ms 344 KB Output is partially correct
30 Partially correct 3 ms 444 KB Output is partially correct
31 Partially correct 4 ms 344 KB Output is partially correct
32 Partially correct 3 ms 344 KB Output is partially correct
33 Partially correct 4 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 3 ms 344 KB Output is partially correct
37 Partially correct 3 ms 344 KB Output is partially correct
38 Partially correct 3 ms 344 KB Output is partially correct
39 Partially correct 3 ms 340 KB Output is partially correct
40 Partially correct 3 ms 344 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 344 KB Output is partially correct
44 Partially correct 4 ms 344 KB Output is partially correct
45 Partially correct 4 ms 344 KB Output is partially correct
46 Partially correct 6 ms 344 KB Output is partially correct
47 Partially correct 3 ms 344 KB Output is partially correct
48 Partially correct 6 ms 344 KB Output is partially correct
49 Partially correct 3 ms 344 KB Output is partially correct
50 Partially correct 3 ms 344 KB Output is partially correct
51 Partially correct 6 ms 344 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 4 ms 344 KB Output is partially correct
55 Partially correct 3 ms 344 KB Output is partially correct
56 Partially correct 5 ms 344 KB Output is partially correct
57 Partially correct 3 ms 344 KB Output is partially correct
58 Partially correct 3 ms 440 KB Output is partially correct
59 Partially correct 3 ms 344 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 1 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