oj.uz

Submission #367658

# Submission time Handle Problem Language Result Execution time Memory
367658 2021-02-17T22:02:51 Z rocks03 Counting Mushrooms (IOI20_mushrooms) C++14
92.2449 / 100
 11 ms 492 KB 
//#pragma GCC target("avx2")
//#pragma GCC optimization("O3")
//#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define pb push_back
#define SZ(x) ((int)(x).size())
#define all(x) x.begin(), x.end()
#define rep(i, a, b) for(int i = (a); i < (b); i++)
#define per(i, a, b) for(int i = (a); i >= (b); i--)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int use_machine(vector<int>);

int count_mushrooms(int N){
    vector<int> a = {0}, b;
    int ind = 1;
    vector<int> ask = {0, 1};
    int ans = use_machine(ask);
    ++ind;
    if(ans == 0) a.pb(1);
    else b.pb(1);
    if(N == 2) return SZ(a);
    if(SZ(a) < 2){
        ask = {0, 2};
        ans = use_machine(ask);
        if(ans == 1) b.pb(2);
        else a.pb(2);
        ++ind;
    }
    const int BOUND = 90;
    while(ind + 1 <= N - 1 && max(SZ(a), SZ(b)) < BOUND){
        if(SZ(a) >= SZ(b)){
            ask = {ind, a[0], ind + 1, a[1]};
            ans = use_machine(ask);
            if(ans == 0){
                a.pb(ind); a.pb(ind + 1);
            } else if(ans == 1){
                b.pb(ind); a.pb(ind + 1);
            } else if(ans == 2){
                a.pb(ind); b.pb(ind + 1);
            } else if(ans == 3){
                b.pb(ind); b.pb(ind + 1);
            }
            ind += 2;
        } else{
            ask = {ind, b[0], ind + 1, b[1]};
            ans = use_machine(ask);
            if(ans == 0){
                b.pb(ind); b.pb(ind + 1);
            } else if(ans == 1){
                a.pb(ind); b.pb(ind + 1);
            } else if(ans == 2){
                b.pb(ind); a.pb(ind + 1);
            } else if(ans == 3){
                a.pb(ind); a.pb(ind + 1);
            }
            ind += 2;
        }
    }
    if(ind == N) return SZ(a);
    if(ind + 1 == N){
        ask = {0, N - 1};
        ans = use_machine(ask);
        if(ans == 1) b.pb(N - 1);
        else a.pb(N - 1);
        ++ind;
        return SZ(a);
    }
    int answer = SZ(a);
    while(ind <= N - 1){
        if(SZ(a) >= SZ(b)){
            ask.clear();
            rep(i, 0, SZ(a)){
                if(ind > N - 1) break;
                ask.pb(a[i]);
                ask.pb(ind);
                ++ind;
            }
            ans = use_machine(ask);
            answer += SZ(ask) / 2 - (ans + 1) / 2;
            if(ans & 1){
                b.pb(ask.back());
            } else{
                a.pb(ask.back());
            }
        } else{
            ask.clear();
            rep(i, 0, SZ(b)){
                if(ind > N - 1) break;
                ask.pb(b[i]);
                ask.pb(ind);
                ++ind;
            }
            ans = use_machine(ask);
            answer += (ans + 1) / 2;
            if(ans & 1){
                a.pb(ask.back());
            } else{
                b.pb(ask.back());
            }
        }
    }
    return answer;
}

Subtask #1
92.2449 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 2 ms 492 KB Output is correct
7 Correct 7 ms 364 KB Output is correct
8 Correct 9 ms 364 KB Output is correct
9 Correct 6 ms 364 KB Output is correct
10 Correct 7 ms 364 KB Output is correct
11 Partially correct 7 ms 404 KB Output is partially correct
12 Correct 9 ms 364 KB Output is correct
13 Correct 6 ms 364 KB Output is correct
14 Correct 5 ms 364 KB Output is correct
15 Partially correct 7 ms 364 KB Output is partially correct
16 Partially correct 7 ms 364 KB Output is partially correct
17 Correct 4 ms 364 KB Output is correct
18 Correct 9 ms 364 KB Output is correct
19 Partially correct 7 ms 364 KB Output is partially correct
20 Correct 10 ms 364 KB Output is correct
21 Correct 7 ms 364 KB Output is correct
22 Partially correct 7 ms 364 KB Output is partially correct
23 Correct 9 ms 364 KB Output is correct
24 Correct 5 ms 364 KB Output is correct
25 Partially correct 8 ms 384 KB Output is partially correct
26 Partially correct 7 ms 364 KB Output is partially correct
27 Partially correct 10 ms 364 KB Output is partially correct
28 Partially correct 8 ms 392 KB Output is partially correct
29 Partially correct 7 ms 364 KB Output is partially correct
30 Partially correct 7 ms 364 KB Output is partially correct
31 Partially correct 9 ms 364 KB Output is partially correct
32 Partially correct 8 ms 364 KB Output is partially correct
33 Partially correct 8 ms 364 KB Output is partially correct
34 Partially correct 11 ms 364 KB Output is partially correct
35 Partially correct 9 ms 364 KB Output is partially correct
36 Partially correct 10 ms 364 KB Output is partially correct
37 Partially correct 8 ms 492 KB Output is partially correct
38 Partially correct 7 ms 364 KB Output is partially correct
39 Partially correct 9 ms 364 KB Output is partially correct
40 Partially correct 10 ms 364 KB Output is partially correct
41 Partially correct 6 ms 404 KB Output is partially correct
42 Partially correct 7 ms 364 KB Output is partially correct
43 Partially correct 10 ms 364 KB Output is partially correct
44 Partially correct 9 ms 364 KB Output is partially correct
45 Partially correct 7 ms 364 KB Output is partially correct
46 Partially correct 7 ms 492 KB Output is partially correct
47 Partially correct 7 ms 364 KB Output is partially correct
48 Partially correct 8 ms 364 KB Output is partially correct
49 Partially correct 7 ms 364 KB Output is partially correct
50 Partially correct 9 ms 364 KB Output is partially correct
51 Partially correct 11 ms 492 KB Output is partially correct
52 Partially correct 10 ms 492 KB Output is partially correct
53 Partially correct 7 ms 364 KB Output is partially correct
54 Partially correct 8 ms 492 KB Output is partially correct
55 Partially correct 7 ms 364 KB Output is partially correct
56 Partially correct 6 ms 404 KB Output is partially correct
57 Partially correct 8 ms 364 KB Output is partially correct
58 Partially correct 7 ms 364 KB Output is partially correct
59 Partially correct 8 ms 364 KB Output is partially correct
60 Partially correct 10 ms 364 KB Output is partially correct
61 Partially correct 8 ms 364 KB Output is partially correct
62 Correct 1 ms 268 KB Output is correct
63 Correct 0 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 0 ms 364 KB Output is correct
67 Correct 0 ms 364 KB Output is correct
68 Correct 0 ms 364 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 492 KB Output is correct
73 Correct 1 ms 364 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 0 ms 364 KB Output is correct
76 Correct 0 ms 364 KB Output is correct
77 Correct 0 ms 364 KB Output is correct
78 Correct 1 ms 364 KB Output is correct
79 Correct 1 ms 364 KB Output is correct
80 Correct 1 ms 364 KB Output is correct
81 Correct 1 ms 364 KB Output is correct
82 Correct 0 ms 364 KB Output is correct
83 Correct 0 ms 364 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 1 ms 492 KB Output is correct
86 Correct 1 ms 364 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 1 ms 364 KB Output is correct
89 Correct 1 ms 364 KB Output is correct
90 Correct 1 ms 364 KB Output is correct
91 Correct 1 ms 364 KB Output is correct