oj.uz

Submission #834338

# Submission time Handle Problem Language Result Execution time Memory
834338 2023-08-22T13:13:07 Z finn__ Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 13 ms 356 KB 
#include <bits/stdc++.h>

#include "mushrooms.h"

using namespace std;

constexpr size_t M = 80;

int count_mushrooms(int n)
{
    vector<int> a_indices = {0}, b_indices;

    (use_machine({0, 1}) ? b_indices : a_indices).push_back(1);
    if (n == 2)
        return a_indices.size();
    (use_machine({0, 2}) ? b_indices : a_indices).push_back(2);

    int last_known = 2;

    // Search for at least M A or B.
    for (int i = last_known + 1; i + 1 < n; i += 2)
    {
        bool flag = a_indices.size() >= 2;
        int x = use_machine({flag ? a_indices[0] : b_indices[0], i,
                             flag ? a_indices[1] : b_indices[1], i + 1});
        last_known = i + 1;
        if ((bool)(x & 2) ^ !flag)
            b_indices.push_back(i);
        else
            a_indices.push_back(i);

        if ((bool)(x & 1) ^ !flag)
            b_indices.push_back(i + 1);
        else
            a_indices.push_back(i + 1);

        if (a_indices.size() >= M || b_indices.size() >= M)
            break;
    }

    int num_a = a_indices.size();

    for (int i = last_known + 1; i < n;)
    {
        vector<int> &r = a_indices.size() > b_indices.size() ? a_indices : b_indices;
        size_t m = r.size();
        bool flag = a_indices.size() > b_indices.size();
        vector<int> v;
        for (int j = 0; j < m && i + j < n; ++j)
        {
            v.push_back(r[j]);
            v.push_back(i + j);
        }

        int x = use_machine(v);
        num_a += flag ? v.size() / 2 - (x + 1) / 2 : (x + 1) / 2;
        (((x & 1) ^ flag) ? a_indices : b_indices).push_back(i + m - 1);
        i += m;
    }

    return num_a;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:49:27: warning: comparison of integer expressions of different signedness: 'int' and 'size_t' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         for (int j = 0; j < m && i + j < n; ++j)
      |                         ~~^~~

Subtask #1
92.623 / 100.0

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