oj.uz

Submission #1073038

# Submission time Handle Problem Language Result Execution time Memory
1073038 2024-08-24T08:52:22 Z Ignut Counting Mushrooms (IOI20_mushrooms) C++17
25 / 100
 74 ms 1104 KB 
// Ignut

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;

mt19937 rnd(11223344);

int use_machine(vector<int> x);

int count_mushrooms(int n) {
    int res = 1;
    vector<int> A = {0}, B = {};
    vector<int> vec;
    for (int i = 1; i < n; i ++) vec.push_back(i);
    shuffle(vec.begin(), vec.end(), rnd);

    int firstA = 0, secondA = -1;
    // vector<int> vec;
    // for (int i = 1; i < n; i ++) vec.push_back(i);
    while (vec.size() > 1) {
        // if (max(A.size(), B.size()) >= 150) break;

        int u = vec.back(); vec.pop_back();
        int v = vec.back(); vec.pop_back();
        if (secondA != -1) {
            int val = use_machine({firstA, u, secondA, v});
            if (val == 0) {
                res += 2;
                A.push_back(u); A.push_back(v);
            }
            else if (val == 1) {
                res ++;
                A.push_back(u); B.push_back(v);
            }
            else if (val == 2) {
                res ++;
                A.push_back(v); B.push_back(u);
            }
            else {
                B.push_back(u), B.push_back(v);
            }
            continue; 
        }
        int val = use_machine({u, firstA, v});
        if (val == 0) {
            secondA = u;
            res += 2;
            A.push_back(u), A.push_back(v);
        }
        else if (val == 1) {
            res ++;
            val = use_machine({firstA, u});
            if (val == 0) {
                secondA = u;
                A.push_back(u), B.push_back(v);
            }
            else {
                secondA = v;
                A.push_back(v), B.push_back(u);
            }
        }
        else {
            B.push_back(u), B.push_back(v);
        }
    }

    if (vec.size() == 1) {
        int val = use_machine({firstA, vec.back()});
        if (val == 0) {
            res ++;
            A.push_back(vec.back());
        }
        else {
            B.push_back(vec.back());
        }
        vec.pop_back();
    }

    // ============================================================= //

    // int Q = 200;
    // for (int i = 0; i < Q; i ++) {
    //     if (vec.empty()) {
    //         return res;
    //     }
    //     int v = vec.back(); vec.pop_back();
    //     if (use_machine({0, v}) == 0) {
    //         res ++;
    //         A.push_back(v);
    //     }
    //     else {
    //         B.push_back(v);
    //     }
    //     if (max(A.size(), B.size()) >= 130)
    //         break;
    // }
    
    
    while (!vec.empty()) {
        int ind = 1;
        vector<int> ask = {(A.size() >= B.size() ? A[0] : B[0])};
        while (ind < max(A.size(), B.size()) && !vec.empty()) {
            int v = vec.back(); vec.pop_back();
            ask.push_back(v);
            ask.push_back(A.size() >= B.size() ? A[ind] : B[ind]);
            ind ++;
        }
        int val = use_machine(ask);
        int cnt = ind - 1;
        if (A.size() >= B.size())
            res += cnt - val / 2;
        else
            res += val / 2;
    }
    return res;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:105:20: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
  105 |         while (ind < max(A.size(), B.size()) && !vec.empty()) {
      |                ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
25.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 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 5 ms 464 KB Output is partially correct
7 Partially correct 65 ms 648 KB Output is partially correct
8 Partially correct 60 ms 848 KB Output is partially correct
9 Partially correct 60 ms 636 KB Output is partially correct
10 Partially correct 64 ms 640 KB Output is partially correct
11 Partially correct 74 ms 888 KB Output is partially correct
12 Partially correct 67 ms 632 KB Output is partially correct
13 Partially correct 56 ms 632 KB Output is partially correct
14 Partially correct 31 ms 540 KB Output is partially correct
15 Partially correct 40 ms 600 KB Output is partially correct
16 Partially correct 63 ms 636 KB Output is partially correct
17 Partially correct 32 ms 592 KB Output is partially correct
18 Partially correct 44 ms 892 KB Output is partially correct
19 Partially correct 62 ms 896 KB Output is partially correct
20 Partially correct 68 ms 848 KB Output is partially correct
21 Partially correct 63 ms 644 KB Output is partially correct
22 Partially correct 62 ms 632 KB Output is partially correct
23 Partially correct 47 ms 640 KB Output is partially correct
24 Partially correct 25 ms 536 KB Output is partially correct
25 Partially correct 53 ms 632 KB Output is partially correct
26 Partially correct 46 ms 640 KB Output is partially correct
27 Partially correct 48 ms 1104 KB Output is partially correct
28 Partially correct 58 ms 636 KB Output is partially correct
29 Partially correct 51 ms 680 KB Output is partially correct
30 Partially correct 61 ms 892 KB Output is partially correct
31 Partially correct 50 ms 652 KB Output is partially correct
32 Partially correct 50 ms 600 KB Output is partially correct
33 Partially correct 67 ms 888 KB Output is partially correct
34 Partially correct 58 ms 848 KB Output is partially correct
35 Partially correct 55 ms 848 KB Output is partially correct
36 Partially correct 59 ms 632 KB Output is partially correct
37 Partially correct 63 ms 896 KB Output is partially correct
38 Partially correct 61 ms 636 KB Output is partially correct
39 Partially correct 74 ms 600 KB Output is partially correct
40 Partially correct 47 ms 636 KB Output is partially correct
41 Partially correct 65 ms 888 KB Output is partially correct
42 Partially correct 63 ms 636 KB Output is partially correct
43 Partially correct 45 ms 636 KB Output is partially correct
44 Partially correct 58 ms 640 KB Output is partially correct
45 Partially correct 66 ms 848 KB Output is partially correct
46 Partially correct 50 ms 600 KB Output is partially correct
47 Partially correct 62 ms 848 KB Output is partially correct
48 Partially correct 52 ms 632 KB Output is partially correct
49 Partially correct 58 ms 632 KB Output is partially correct
50 Partially correct 47 ms 636 KB Output is partially correct
51 Partially correct 66 ms 640 KB Output is partially correct
52 Partially correct 63 ms 896 KB Output is partially correct
53 Partially correct 52 ms 676 KB Output is partially correct
54 Partially correct 46 ms 632 KB Output is partially correct
55 Partially correct 53 ms 848 KB Output is partially correct
56 Partially correct 68 ms 1104 KB Output is partially correct
57 Partially correct 40 ms 888 KB Output is partially correct
58 Partially correct 56 ms 892 KB Output is partially correct
59 Partially correct 55 ms 652 KB Output is partially correct
60 Partially correct 50 ms 848 KB Output is partially correct
61 Partially correct 55 ms 888 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 1 ms 344 KB Output is correct
67 Correct 1 ms 340 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 1 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 1 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct