oj.uz

Submission #1074316

# Submission time Handle Problem Language Result Execution time Memory
1074316 2024-08-25T09:41:58 Z TheQuantiX Counting Mushrooms (IOI20_mushrooms) C++17
69.3252 / 100
 8 ms 600 KB 
#include <bits/stdc++.h>
#include "mushrooms.h"

using namespace std;
using ll = long long;

constexpr ll C = 142;

ll n, m, q, k, x, y, a, b, c;

int count_mushrooms(int n) {
    mt19937 gen(chrono::system_clock::now().time_since_epoch().count());
    vector<int> va(1, 0), vb;
    deque<int> left;
    for (int i = 1; i < n; i++) {
        left.push_back(i);
    }
    for (int i = 0; i < n - 1; i++) {
        swap(left[i], left[gen() % (i + 1)]);
    }
    while (max(va.size(), vb.size()) < C && !left.empty()) {
        if (left.size() == 1) {
            if (use_machine({0, left[0]}) == 0) {
                va.push_back(left[0]);
            }
            else {
                vb.push_back(left[0]);
            }
            left.pop_front();
        }
        else {
            int x = left[0];
            int y = left[1];
            left.pop_front();
            left.pop_front();
            if (gen() % 2) {
                swap(x, y);
            }
            ll num = use_machine({0, x, y});
            if (num == 0) {
                va.push_back(x);
                va.push_back(y);
            }
            else if (num == 2) {
                vb.push_back(x);
                va.push_back(y);
            }
            else {
                left.push_front(x);
                vb.push_back(y);
            }
        }
    }
    int ans = va.size();
    if (va.size() > vb.size()) {
        while (!left.empty()) {
            vector<int> vec;
            ll cnt = 0;
            while (!left.empty() && cnt != va.size()) {
                vec.push_back(va[cnt]);
                vec.push_back(left[0]);
                cnt++;
                left.pop_front();
            }
            ll num = use_machine(vec);
            ans += cnt - (num + 1) / 2;
        }
    }
    else {
        while (!left.empty()) {
            vector<int> vec;
            ll cnt = 0;
            while (!left.empty() && cnt != vb.size()) {
                vec.push_back(vb[cnt]);
                vec.push_back(left[0]);
                cnt++;
                left.pop_front();
            }
            ll num = use_machine(vec);
            ans += (num + 1) / 2;
        }
    }
    return ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:59:41: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |             while (!left.empty() && cnt != va.size()) {
      |                                     ~~~~^~~~~~~~~~~~
mushrooms.cpp:73:41: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |             while (!left.empty() && cnt != vb.size()) {
      |                                     ~~~~^~~~~~~~~~~~

Subtask #1
69.3252 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Partially correct 5 ms 344 KB Output is partially correct
11 Partially correct 7 ms 344 KB Output is partially correct
12 Partially correct 5 ms 340 KB Output is partially correct
13 Partially correct 4 ms 344 KB Output is partially correct
14 Partially correct 3 ms 344 KB Output is partially correct
15 Partially correct 5 ms 344 KB Output is partially correct
16 Partially correct 5 ms 344 KB Output is partially correct
17 Partially correct 3 ms 488 KB Output is partially correct
18 Partially correct 4 ms 344 KB Output is partially correct
19 Partially correct 5 ms 344 KB Output is partially correct
20 Partially correct 5 ms 344 KB Output is partially correct
21 Partially correct 7 ms 344 KB Output is partially correct
22 Partially correct 4 ms 344 KB Output is partially correct
23 Partially correct 4 ms 344 KB Output is partially correct
24 Correct 2 ms 344 KB Output is correct
25 Partially correct 4 ms 344 KB Output is partially correct
26 Partially correct 5 ms 344 KB Output is partially correct
27 Partially correct 4 ms 344 KB Output is partially correct
28 Partially correct 4 ms 344 KB Output is partially correct
29 Partially correct 4 ms 600 KB Output is partially correct
30 Partially correct 5 ms 344 KB Output is partially correct
31 Partially correct 4 ms 344 KB Output is partially correct
32 Partially correct 6 ms 600 KB Output is partially correct
33 Partially correct 4 ms 528 KB Output is partially correct
34 Partially correct 6 ms 600 KB Output is partially correct
35 Partially correct 4 ms 344 KB Output is partially correct
36 Partially correct 4 ms 344 KB Output is partially correct
37 Partially correct 4 ms 344 KB Output is partially correct
38 Partially correct 4 ms 344 KB Output is partially correct
39 Partially correct 8 ms 344 KB Output is partially correct
40 Partially correct 4 ms 344 KB Output is partially correct
41 Partially correct 6 ms 344 KB Output is partially correct
42 Partially correct 5 ms 344 KB Output is partially correct
43 Partially correct 4 ms 344 KB Output is partially correct
44 Partially correct 4 ms 344 KB Output is partially correct
45 Partially correct 5 ms 344 KB Output is partially correct
46 Partially correct 4 ms 344 KB Output is partially correct
47 Partially correct 4 ms 344 KB Output is partially correct
48 Partially correct 5 ms 344 KB Output is partially correct
49 Partially correct 4 ms 344 KB Output is partially correct
50 Partially correct 5 ms 344 KB Output is partially correct
51 Partially correct 5 ms 344 KB Output is partially correct
52 Partially correct 5 ms 344 KB Output is partially correct
53 Partially correct 4 ms 344 KB Output is partially correct
54 Partially correct 4 ms 344 KB Output is partially correct
55 Partially correct 6 ms 344 KB Output is partially correct
56 Partially correct 7 ms 600 KB Output is partially correct
57 Partially correct 5 ms 344 KB Output is partially correct
58 Partially correct 5 ms 600 KB Output is partially correct
59 Partially correct 7 ms 344 KB Output is partially correct
60 Partially correct 4 ms 344 KB Output is partially correct
61 Partially correct 4 ms 344 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 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 1 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 1 ms 344 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 1 ms 344 KB Output is correct
76 Correct 1 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 356 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 0 ms 348 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