oj.uz

Submission #1058174

# Submission time Handle Problem Language Result Execution time Memory
1058174 2024-08-14T08:50:20 Z idas Counting Mushrooms (IOI20_mushrooms) C++17
0 / 100
 6 ms 600 KB 
#include "mushrooms.h"
#include "bits/stdc++.h"
#define FOR(i, begin, end) for(int i=(begin); i<(end); i++)
#define sz(x) ((int)((x).size()))
#define pb push_back

using namespace std;
typedef vector<int> vi;

const int MxN=2e4, C=142;
int n;
vi a, b;

int count_mushrooms(int N) {
    n=N; a.pb(0);

    if(use_machine({0,1})) b.pb(1);
    else a.pb(1);

    if(use_machine({0,2})) b.pb(2);
    else a.pb(2);

    int in=3;
    while(in<=n-2 && sz(a)<C && sz(b)<C) {
        if(sz(a)>=2) {
            int k=use_machine({a[0], in, a[1], in+1});
            if(k==0) a.pb(in), a.pb(in+1);
            else if(k==1) a.pb(in), b.pb(in+1);
            else if(k==2) b.pb(in), a.pb(in+1);
            else b.pb(in), b.pb(in+1);
            in+=2;
        }
        else {
            int k=use_machine({b[0], in, b[1], in+1});
            if(k==0) b.pb(in), b.pb(in+1);
            else if(k==1) b.pb(in), a.pb(in+1);
            else if(k==2) a.pb(in), b.pb(in+1);
            else a.pb(in), a.pb(in+1);
            in+=2;
        }
    }

    int ans=sz(a);
    if(sz(a)>=sz(b)) {
        while(in<n) {
            vi tmp; int actual=0;
            FOR(i, 0, sz(a)) {
                tmp.pb(a[i]);
                if(in<n) tmp.pb(in++), actual++;
            }
            int k=use_machine(tmp);

            // cout << "query: ";
            // for(auto it : tmp) {
            //     cout << it << " ";
            // }
            // cout << endl << k << endl;

            ans+=actual-(k+1)/2;
        }
    }
    else {
        while(in<n) {
            vi tmp;
            FOR(i, 0, sz(b)) {
                tmp.pb(b[i]);
                if(in<n) tmp.pb(in++);
            }
            int k=use_machine(tmp);
            ans+=(k+1)/2;
        }
    }

    return ans;
}
/*
3
0 1 0

10
0 0 0 0 0 0 0 0 0 0
*/

Subtask #1
0 / 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 3 ms 436 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Partially correct 5 ms 344 KB Output is partially correct
11 Partially correct 4 ms 344 KB Output is partially correct
12 Partially correct 5 ms 344 KB Output is partially correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Partially correct 4 ms 344 KB Output is partially correct
16 Partially correct 4 ms 344 KB Output is partially correct
17 Correct 2 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Partially correct 4 ms 344 KB Output is partially correct
20 Partially correct 5 ms 344 KB Output is partially correct
21 Partially correct 5 ms 344 KB Output is partially correct
22 Partially correct 5 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 3 ms 344 KB Output is partially correct
26 Partially correct 5 ms 344 KB Output is partially correct
27 Partially correct 3 ms 344 KB Output is partially correct
28 Partially correct 4 ms 344 KB Output is partially correct
29 Partially correct 6 ms 344 KB Output is partially correct
30 Partially correct 6 ms 344 KB Output is partially correct
31 Partially correct 6 ms 344 KB Output is partially correct
32 Partially correct 4 ms 444 KB Output is partially correct
33 Partially correct 3 ms 344 KB Output is partially correct
34 Partially correct 3 ms 344 KB Output is partially correct
35 Partially correct 5 ms 344 KB Output is partially correct
36 Partially correct 4 ms 344 KB Output is partially correct
37 Partially correct 5 ms 344 KB Output is partially correct
38 Partially correct 5 ms 344 KB Output is partially correct
39 Partially correct 3 ms 344 KB Output is partially correct
40 Partially correct 5 ms 344 KB Output is partially correct
41 Partially correct 5 ms 444 KB Output is partially correct
42 Partially correct 5 ms 344 KB Output is partially correct
43 Partially correct 3 ms 600 KB Output is partially correct
44 Partially correct 4 ms 344 KB Output is partially correct
45 Partially correct 4 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 3 ms 344 KB Output is partially correct
49 Partially correct 3 ms 600 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 5 ms 344 KB Output is partially correct
54 Partially correct 5 ms 344 KB Output is partially correct
55 Partially correct 6 ms 444 KB Output is partially correct
56 Partially correct 3 ms 344 KB Output is partially correct
57 Partially correct 4 ms 344 KB Output is partially correct
58 Partially correct 3 ms 344 KB Output is partially correct
59 Partially correct 4 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 Incorrect 0 ms 344 KB Invalid value 2 in the query array.
63 Halted 0 ms 0 KB -