oj.uz

Submission #1073028

# Submission time Handle Problem Language Result Execution time Memory
1073028 2024-08-24T08:46:04 Z Ignut Counting Mushrooms (IOI20_mushrooms) C++17
0 / 100
 8 ms 600 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);
        }
    }

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

    // 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:93:20: warning: comparison of integer expressions of different signedness: 'int' and 'const long unsigned int' [-Wsign-compare]
   93 |         while (ind < max(A.size(), B.size()) && !vec.empty()) {
      |                ~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
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 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 Correct 1 ms 344 KB Output is correct
7 Correct 5 ms 600 KB Output is correct
8 Correct 4 ms 600 KB Output is correct
9 Correct 4 ms 600 KB Output is correct
10 Partially correct 6 ms 600 KB Output is partially correct
11 Partially correct 4 ms 600 KB Output is partially correct
12 Partially correct 4 ms 600 KB Output is partially correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Partially correct 4 ms 600 KB Output is partially correct
16 Partially correct 4 ms 600 KB Output is partially correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Partially correct 8 ms 600 KB Output is partially correct
20 Partially correct 4 ms 600 KB Output is partially correct
21 Partially correct 4 ms 600 KB Output is partially correct
22 Partially correct 4 ms 600 KB Output is partially correct
23 Partially correct 4 ms 600 KB Output is partially correct
24 Correct 3 ms 344 KB Output is correct
25 Partially correct 5 ms 600 KB Output is partially correct
26 Partially correct 4 ms 600 KB Output is partially correct
27 Partially correct 4 ms 600 KB Output is partially correct
28 Partially correct 4 ms 600 KB Output is partially correct
29 Partially correct 4 ms 600 KB Output is partially correct
30 Partially correct 5 ms 600 KB Output is partially correct
31 Partially correct 7 ms 600 KB Output is partially correct
32 Partially correct 7 ms 600 KB Output is partially correct
33 Partially correct 7 ms 600 KB Output is partially correct
34 Partially correct 4 ms 600 KB Output is partially correct
35 Partially correct 4 ms 600 KB Output is partially correct
36 Partially correct 5 ms 600 KB Output is partially correct
37 Partially correct 6 ms 600 KB Output is partially correct
38 Partially correct 5 ms 600 KB Output is partially correct
39 Partially correct 4 ms 600 KB Output is partially correct
40 Partially correct 6 ms 600 KB Output is partially correct
41 Partially correct 4 ms 600 KB Output is partially correct
42 Partially correct 7 ms 600 KB Output is partially correct
43 Partially correct 5 ms 596 KB Output is partially correct
44 Partially correct 4 ms 600 KB Output is partially correct
45 Partially correct 7 ms 600 KB Output is partially correct
46 Partially correct 4 ms 600 KB Output is partially correct
47 Partially correct 7 ms 600 KB Output is partially correct
48 Partially correct 4 ms 600 KB Output is partially correct
49 Partially correct 4 ms 600 KB Output is partially correct
50 Partially correct 4 ms 600 KB Output is partially correct
51 Partially correct 4 ms 600 KB Output is partially correct
52 Partially correct 4 ms 600 KB Output is partially correct
53 Partially correct 4 ms 600 KB Output is partially correct
54 Partially correct 5 ms 540 KB Output is partially correct
55 Partially correct 4 ms 600 KB Output is partially correct
56 Partially correct 4 ms 600 KB Output is partially correct
57 Partially correct 5 ms 600 KB Output is partially correct
58 Partially correct 4 ms 600 KB Output is partially correct
59 Partially correct 4 ms 600 KB Output is partially correct
60 Partially correct 4 ms 600 KB Output is partially correct
61 Partially correct 5 ms 600 KB Output is partially correct
62 Incorrect 0 ms 344 KB Too small array for query.
63 Halted 0 ms 0 KB -