Submission #825496

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
825496	2023-08-14T23:25:08 Z	benjaminkleyn	Counting Mushrooms (IOI20_mushrooms)	C++17	92.623 / 100	7 ms	348 KB

mushrooms

#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;

int count_mushrooms(int n)
{
    vector<int> A(1, 0), B;

    int i = 1;
    for (; i < 3 && i < n; i++)
        if (use_machine({0, i}))
            B.push_back(i);
        else
            A.push_back(i);

    int k = 80;
    if (A.size() >= B.size())
    {
        for (; i + 1 < n && A.size() < k && B.size() < k; i += 2)
        {
            int x = use_machine({A[0], i, A[1], i+1});

            if (x & 1)
                B.push_back(i+1);
            else
                A.push_back(i+1);

            if (x & 2)
                B.push_back(i);
            else
                A.push_back(i);
        }
    }
    else
    {
        for (; i + 1 < n && A.size() < k && B.size() < k; i += 2)
        {
            int x = use_machine({B[0], i, B[1], i+1});

            if (x & 1)
                A.push_back(i+1);
            else
                B.push_back(i+1);

            if (x & 2)
                A.push_back(i);
            else
                B.push_back(i);
        }
    }

    int cnt = A.size();
    while (i < n)
    {
        vector<int> query;
        if (A.size() >= B.size())
        {
            for (int j : A)
            {
                query.push_back(j);
                query.push_back(i++);
                if (i >= n)
                    break;
            }
            int x = use_machine(query);
            cnt += query.size() / 2 - (x + 1) / 2;
            if (x % 2)
                B.push_back(query.back());
            else
                A.push_back(query.back());
        }
        else
        {
            for (int j : B)
            {
                query.push_back(j);
                query.push_back(i++);
                if (i >= n)
                    break;
            }
            int x = use_machine(query);
            cnt += (x + 1) / 2;
            if (x % 2)
                A.push_back(query.back());
            else
                B.push_back(query.back());
        }
    }
    return cnt;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:19:38: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |         for (; i + 1 < n && A.size() < k && B.size() < k; i += 2)
      |                             ~~~~~~~~~^~~
mushrooms.cpp:19:54: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   19 |         for (; i + 1 < n && A.size() < k && B.size() < k; i += 2)
      |                                             ~~~~~~~~~^~~
mushrooms.cpp:36:38: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |         for (; i + 1 < n && A.size() < k && B.size() < k; i += 2)
      |                             ~~~~~~~~~^~~
mushrooms.cpp:36:54: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   36 |         for (; i + 1 < n && A.size() < k && B.size() < k; i += 2)
      |                                             ~~~~~~~~~^~~

Subtask #1

92.623 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 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	2 ms	208 KB	Output is correct
7	Correct	5 ms	316 KB	Output is correct
8	Correct	6 ms	324 KB	Output is correct
9	Correct	4 ms	208 KB	Output is correct
10	Correct	6 ms	208 KB	Output is correct
11	Partially correct	6 ms	308 KB	Output is partially correct
12	Correct	6 ms	328 KB	Output is correct
13	Correct	5 ms	208 KB	Output is correct
14	Correct	3 ms	308 KB	Output is correct
15	Partially correct	5 ms	328 KB	Output is partially correct
16	Partially correct	6 ms	320 KB	Output is partially correct
17	Correct	3 ms	208 KB	Output is correct
18	Correct	4 ms	332 KB	Output is correct
19	Partially correct	5 ms	208 KB	Output is partially correct
20	Correct	6 ms	208 KB	Output is correct
21	Correct	5 ms	332 KB	Output is correct
22	Partially correct	6 ms	324 KB	Output is partially correct
23	Correct	4 ms	324 KB	Output is correct
24	Correct	3 ms	320 KB	Output is correct
25	Partially correct	4 ms	328 KB	Output is partially correct
26	Partially correct	6 ms	328 KB	Output is partially correct
27	Partially correct	5 ms	336 KB	Output is partially correct
28	Partially correct	5 ms	332 KB	Output is partially correct
29	Partially correct	5 ms	328 KB	Output is partially correct
30	Partially correct	5 ms	308 KB	Output is partially correct
31	Partially correct	5 ms	320 KB	Output is partially correct
32	Partially correct	5 ms	320 KB	Output is partially correct
33	Partially correct	5 ms	336 KB	Output is partially correct
34	Partially correct	5 ms	336 KB	Output is partially correct
35	Partially correct	7 ms	336 KB	Output is partially correct
36	Partially correct	7 ms	324 KB	Output is partially correct
37	Partially correct	4 ms	324 KB	Output is partially correct
38	Partially correct	5 ms	208 KB	Output is partially correct
39	Partially correct	4 ms	328 KB	Output is partially correct
40	Partially correct	6 ms	320 KB	Output is partially correct
41	Partially correct	5 ms	208 KB	Output is partially correct
42	Partially correct	7 ms	320 KB	Output is partially correct
43	Partially correct	6 ms	312 KB	Output is partially correct
44	Partially correct	6 ms	348 KB	Output is partially correct
45	Partially correct	5 ms	208 KB	Output is partially correct
46	Partially correct	5 ms	208 KB	Output is partially correct
47	Partially correct	5 ms	312 KB	Output is partially correct
48	Partially correct	5 ms	316 KB	Output is partially correct
49	Partially correct	5 ms	208 KB	Output is partially correct
50	Partially correct	6 ms	324 KB	Output is partially correct
51	Partially correct	5 ms	316 KB	Output is partially correct
52	Partially correct	6 ms	316 KB	Output is partially correct
53	Partially correct	5 ms	208 KB	Output is partially correct
54	Partially correct	5 ms	208 KB	Output is partially correct
55	Partially correct	5 ms	308 KB	Output is partially correct
56	Partially correct	4 ms	208 KB	Output is partially correct
57	Partially correct	5 ms	208 KB	Output is partially correct
58	Partially correct	5 ms	324 KB	Output is partially correct
59	Partially correct	5 ms	208 KB	Output is partially correct
60	Partially correct	5 ms	304 KB	Output is partially correct
61	Partially correct	5 ms	208 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	0 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	0 ms	208 KB	Output is correct
77	Correct	0 ms	208 KB	Output is correct
78	Correct	0 ms	208 KB	Output is correct
79	Correct	1 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	0 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	0 ms	208 KB	Output is correct