oj.uz

Submission #1057422

# Submission time Handle Problem Language Result Execution time Memory
1057422 2024-08-13T19:08:37 Z c2zi6 Counting Mushrooms (IOI20_mushrooms) C++14
80.427 / 100
 7 ms 852 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "mushrooms.h"

int count_mushrooms(int n) {
    int max0 = n, max1 = n;

    VI qr;
    rep(i, n) qr.pb(i);
    int ret = use_machine(qr);
    int min0 = (ret+2)/2;
    int min1 = (ret+1)/2;
    setmin(max0, n - min1);
    setmin(max1, n - min0);

    VI mek, zro;
    zro.pb(0);
    int ans = 1;
    int last = 1;
    while (last < n) {
        VI qr;
        for (int x : (mek.size() > zro.size() ? mek : zro)) {
            qr.pb(x);
            qr.pb(last++);
            if (last >= n) break;
        }
        int ret = use_machine(qr);
        int urish = (ret+1)/2;
        if (mek.size() > zro.size()) {
            ans += urish;
            if (ret & 1) zro.pb(last-1);
            else mek.pb(last-1);
        } else {
            ans += qr.size()/2 - urish;
            if (ret & 1) mek.pb(last-1);
            else zro.pb(last-1);
        }
    }
    return ans;
}

Subtask #1
80.427 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 4 ms 600 KB Output is correct
8 Correct 7 ms 596 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Partially correct 4 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 5 ms 600 KB Output is partially correct
16 Partially correct 7 ms 600 KB Output is partially correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 6 ms 600 KB Output is correct
19 Partially correct 4 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 6 ms 600 KB Output is partially correct
23 Correct 4 ms 600 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Partially correct 4 ms 600 KB Output is partially correct
26 Partially correct 5 ms 600 KB Output is partially correct
27 Partially correct 5 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 7 ms 600 KB Output is partially correct
31 Partially correct 6 ms 600 KB Output is partially correct
32 Partially correct 7 ms 600 KB Output is partially correct
33 Partially correct 5 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 4 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 5 ms 600 KB Output is partially correct
42 Partially correct 4 ms 600 KB Output is partially correct
43 Partially correct 4 ms 600 KB Output is partially correct
44 Partially correct 7 ms 600 KB Output is partially correct
45 Partially correct 5 ms 600 KB Output is partially correct
46 Partially correct 4 ms 600 KB Output is partially correct
47 Partially correct 4 ms 600 KB Output is partially correct
48 Partially correct 4 ms 600 KB Output is partially correct
49 Partially correct 5 ms 600 KB Output is partially correct
50 Partially correct 4 ms 600 KB Output is partially correct
51 Partially correct 5 ms 600 KB Output is partially correct
52 Partially correct 4 ms 600 KB Output is partially correct
53 Partially correct 7 ms 600 KB Output is partially correct
54 Partially correct 4 ms 600 KB Output is partially correct
55 Partially correct 4 ms 600 KB Output is partially correct
56 Partially correct 4 ms 596 KB Output is partially correct
57 Partially correct 4 ms 600 KB Output is partially correct
58 Partially correct 7 ms 600 KB Output is partially correct
59 Partially correct 6 ms 600 KB Output is partially correct
60 Partially correct 4 ms 600 KB Output is partially correct
61 Partially correct 4 ms 600 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 0 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 1 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 0 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 348 KB Output is correct
88 Correct 0 ms 352 KB Output is correct
89 Correct 0 ms 348 KB Output is correct
90 Correct 0 ms 352 KB Output is correct
91 Correct 0 ms 352 KB Output is correct