Submission #1018792

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1018792	2024-07-10T09:49:00 Z	Boas	Counting Mushrooms (IOI20_mushrooms)	C++17	25 / 100	73 ms	1008 KB

mushrooms

#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 = 141;
	while (min(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);
				}
				else if (res == 2)
				{
					A.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);
				}
				else if (res == 1)
				{
					A.pb(i + 1);
				}
				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)
        {
            q.pb(A[0]);
            int l = min(x, n - 1 - i);
            loop(l, j)
            {
                q.pb(i + j);
                q.pb(A[j + 1]);
            }
            res += (l - use_machine(q) / 2);
            q.clear();
        }
        else
        {
            q.pb(B[0]);
            int l = min(x, n - 1 - i);
            loop(l, j)
            {
                q.pb(i + j);
                q.pb(B[j + 1]);
            }
            res += use_machine(q) / 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 (min(A.size(), B.size()) < x)
      |         ~~~~~~~~~~~~~~~~~~~~~~~~^~~
mushrooms.cpp:88:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   88 |         if (A.size() >= x)
      |             ~~~~~~~~~^~~~

Subtask #1

25.0 / 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	344 KB	Output is correct
6	Partially correct	6 ms	452 KB	Output is partially correct
7	Partially correct	55 ms	804 KB	Output is partially correct
8	Partially correct	50 ms	884 KB	Output is partially correct
9	Partially correct	40 ms	896 KB	Output is partially correct
10	Partially correct	50 ms	780 KB	Output is partially correct
11	Partially correct	73 ms	848 KB	Output is partially correct
12	Partially correct	53 ms	712 KB	Output is partially correct
13	Partially correct	61 ms	448 KB	Output is partially correct
14	Partially correct	25 ms	456 KB	Output is partially correct
15	Partially correct	54 ms	448 KB	Output is partially correct
16	Partially correct	54 ms	592 KB	Output is partially correct
17	Partially correct	15 ms	596 KB	Output is partially correct
18	Partially correct	51 ms	344 KB	Output is partially correct
19	Partially correct	50 ms	728 KB	Output is partially correct
20	Partially correct	51 ms	476 KB	Output is partially correct
21	Partially correct	53 ms	480 KB	Output is partially correct
22	Partially correct	46 ms	724 KB	Output is partially correct
23	Partially correct	62 ms	856 KB	Output is partially correct
24	Partially correct	19 ms	708 KB	Output is partially correct
25	Partially correct	36 ms	592 KB	Output is partially correct
26	Partially correct	58 ms	616 KB	Output is partially correct
27	Partially correct	59 ms	592 KB	Output is partially correct
28	Partially correct	43 ms	344 KB	Output is partially correct
29	Partially correct	52 ms	768 KB	Output is partially correct
30	Partially correct	55 ms	696 KB	Output is partially correct
31	Partially correct	63 ms	600 KB	Output is partially correct
32	Partially correct	51 ms	688 KB	Output is partially correct
33	Partially correct	55 ms	704 KB	Output is partially correct
34	Partially correct	55 ms	344 KB	Output is partially correct
35	Partially correct	50 ms	592 KB	Output is partially correct
36	Partially correct	48 ms	708 KB	Output is partially correct
37	Partially correct	45 ms	340 KB	Output is partially correct
38	Partially correct	48 ms	592 KB	Output is partially correct
39	Partially correct	58 ms	732 KB	Output is partially correct
40	Partially correct	61 ms	712 KB	Output is partially correct
41	Partially correct	56 ms	592 KB	Output is partially correct
42	Partially correct	62 ms	728 KB	Output is partially correct
43	Partially correct	47 ms	464 KB	Output is partially correct
44	Partially correct	59 ms	1008 KB	Output is partially correct
45	Partially correct	54 ms	344 KB	Output is partially correct
46	Partially correct	60 ms	600 KB	Output is partially correct
47	Partially correct	60 ms	736 KB	Output is partially correct
48	Partially correct	47 ms	592 KB	Output is partially correct
49	Partially correct	64 ms	468 KB	Output is partially correct
50	Partially correct	52 ms	492 KB	Output is partially correct
51	Partially correct	45 ms	740 KB	Output is partially correct
52	Partially correct	47 ms	952 KB	Output is partially correct
53	Partially correct	57 ms	600 KB	Output is partially correct
54	Partially correct	54 ms	448 KB	Output is partially correct
55	Partially correct	51 ms	696 KB	Output is partially correct
56	Partially correct	49 ms	344 KB	Output is partially correct
57	Partially correct	59 ms	456 KB	Output is partially correct
58	Partially correct	62 ms	460 KB	Output is partially correct
59	Partially correct	63 ms	592 KB	Output is partially correct
60	Partially correct	55 ms	712 KB	Output is partially correct
61	Partially correct	64 ms	588 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	1 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	0 ms	344 KB	Output is correct
91	Correct	0 ms	344 KB	Output is correct