oj.uz

Submission #1057076

# Submission time Handle Problem Language Result Execution time Memory
1057076 2024-08-13T13:55:52 Z c2zi6 Counting Mushrooms (IOI20_mushrooms) C++14
10 / 100
 123 ms 436 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 sum = 0;
int use_machine(int l, int r) {
    sum += r-l+1;
    /*cout << "use_machine(" << l << ", " << r << ")" << endl;*/
    VI a;
    replr(i, l, r) a.pb(i);
    return use_machine(a);
}

int count_mushrooms(int n) {
    auto binsearch = [&](int L, int R) {
        // searching for the first index i
        // such that a[i] != a[L] and i is
        // in range [L+1, R]
        // return R+1 if no such index

        setmin(R, n-1);
        /*cout << "BINSEARCH(" << L << ", " << R << ")";*/
        int l = L, r = R+1;
        while (l + 1 < r) {
            int m = (l + r) / 2;
            if (use_machine(l, m)) r = m;
            else l = m;
        }
        /*cout << " = " << r << endl;*/
        return r;
    };


    /*int sq = sqrt(n);*/
    /*VI dif(n+1);*/
    /*int L = 0;*/
    /*while (L < n) {*/
    /*    int ret = binsearch(L, L + sq);*/
    /*    if (ret == L+sq+1) {*/
    /*        L = L + sq;*/
    /*    } else {*/
    /*        L = ret;*/
    /*        dif[ret] = 1;*/
    /*    }*/
    /*}*/

    /*VI ans(n);*/
    /*int cur = 0;*/
    /*rep(i, n) {*/
    /*    if (dif[i]) cur = !cur;*/
    /*    ans[i] = cur;*/
    /*}*/

    /*for (int x : ans) cout << x << " ";*/
    /*cout << endl;*/
    /*cout << sum << endl;*/

	/*   int ret = 0;*/
	/*   for (int x : ans) ret += !x;*/
	/*return ret;*/
    int ret = 1;
    replr(i, 1, n-1) if (!use_machine({0, i})) ret++;
    return ret;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:44:10: warning: variable 'binsearch' set but not used [-Wunused-but-set-variable]
   44 |     auto binsearch = [&](int L, int R) {
      |          ^~~~~~~~~

Subtask #1
10.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 436 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 Partially correct 7 ms 344 KB Output is partially correct
7 Partially correct 93 ms 344 KB Output is partially correct
8 Partially correct 82 ms 344 KB Output is partially correct
9 Partially correct 115 ms 344 KB Output is partially correct
10 Partially correct 79 ms 344 KB Output is partially correct
11 Partially correct 95 ms 344 KB Output is partially correct
12 Partially correct 87 ms 344 KB Output is partially correct
13 Partially correct 100 ms 344 KB Output is partially correct
14 Partially correct 38 ms 344 KB Output is partially correct
15 Partially correct 103 ms 344 KB Output is partially correct
16 Partially correct 89 ms 344 KB Output is partially correct
17 Partially correct 48 ms 344 KB Output is partially correct
18 Partially correct 86 ms 344 KB Output is partially correct
19 Partially correct 123 ms 344 KB Output is partially correct
20 Partially correct 99 ms 344 KB Output is partially correct
21 Partially correct 72 ms 344 KB Output is partially correct
22 Partially correct 100 ms 344 KB Output is partially correct
23 Partially correct 97 ms 344 KB Output is partially correct
24 Partially correct 46 ms 344 KB Output is partially correct
25 Partially correct 113 ms 344 KB Output is partially correct
26 Partially correct 97 ms 344 KB Output is partially correct
27 Partially correct 92 ms 344 KB Output is partially correct
28 Partially correct 85 ms 344 KB Output is partially correct
29 Partially correct 91 ms 344 KB Output is partially correct
30 Partially correct 94 ms 344 KB Output is partially correct
31 Partially correct 94 ms 344 KB Output is partially correct
32 Partially correct 90 ms 344 KB Output is partially correct
33 Partially correct 88 ms 344 KB Output is partially correct
34 Partially correct 98 ms 344 KB Output is partially correct
35 Partially correct 97 ms 344 KB Output is partially correct
36 Partially correct 100 ms 344 KB Output is partially correct
37 Partially correct 94 ms 344 KB Output is partially correct
38 Partially correct 96 ms 344 KB Output is partially correct
39 Partially correct 89 ms 344 KB Output is partially correct
40 Partially correct 95 ms 344 KB Output is partially correct
41 Partially correct 106 ms 344 KB Output is partially correct
42 Partially correct 108 ms 344 KB Output is partially correct
43 Partially correct 88 ms 344 KB Output is partially correct
44 Partially correct 95 ms 344 KB Output is partially correct
45 Partially correct 98 ms 344 KB Output is partially correct
46 Partially correct 93 ms 344 KB Output is partially correct
47 Partially correct 100 ms 344 KB Output is partially correct
48 Partially correct 88 ms 344 KB Output is partially correct
49 Partially correct 111 ms 344 KB Output is partially correct
50 Partially correct 97 ms 344 KB Output is partially correct
51 Partially correct 97 ms 344 KB Output is partially correct
52 Partially correct 97 ms 344 KB Output is partially correct
53 Partially correct 102 ms 344 KB Output is partially correct
54 Partially correct 100 ms 344 KB Output is partially correct
55 Partially correct 95 ms 344 KB Output is partially correct
56 Partially correct 86 ms 344 KB Output is partially correct
57 Partially correct 95 ms 344 KB Output is partially correct
58 Partially correct 95 ms 344 KB Output is partially correct
59 Partially correct 89 ms 344 KB Output is partially correct
60 Partially correct 98 ms 344 KB Output is partially correct
61 Partially correct 96 ms 340 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 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 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 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