oj.uz

Submission #531144

# Submission time Handle Problem Language Result Execution time Memory
531144 2022-02-27T20:12:53 Z ColourAttila Counting Mushrooms (IOI20_mushrooms) C++17
92.2449 / 100
 9 ms 460 KB 
#include <bits/stdc++.h>
#include "mushrooms.h"
using namespace std;
using ll = long long;

const int maxN = 2e5 + 5;
const int MOD = 1e9 + 7;
vector<int> knownA , knownB, ask;

int cnt;

int query1(vector<int> a) {
    int res = use_machine(a);

    if(res == 1)  {
        knownB.push_back(a.back());
    }
    else {
        knownA.push_back(a.back());
    }

    return res;
}

int query2(vector<int> a, bool type) {
    int res = use_machine(a);
    //cout << "type: " << type << endl;

    if(((res & 2) == 2) == type) {
        knownB.push_back(a[1]);
    }
    else {
        knownA.push_back(a[1]);
    }

    if(((res & 1) == 1) == type) {
        knownB.push_back(a.back());
    }
    else {
        knownA.push_back(a.back());
    }

    return res;
}

int query3(vector<int> a, bool type) {
    int res = use_machine(a);


    if(type) {
        cnt += (a.size() - res) / 2;
        if(!(res % 2)) knownA.push_back(a.back());
        else knownB.push_back(a.back());
    }
    else {
        cnt += (res + 1) / 2;
        if(res % 2) knownA.push_back(a.back());
        else knownB.push_back(a.back());
    }

    return res;
}

int count_mushrooms(int n){
    knownA.push_back(0);
    ask = {0, 1};

    int curr = 1;

    // van legalabb 2
    int res = query1(ask);
    if(res == 1) {
        if(n == 2) return 1;
        ask[1] = 2;
        query1(ask);
        curr++;
    }

    if(n == curr+1) return knownA.size();

    int sq = sqrt(n)/2;
    //gyöknyi ugyanolyan keresese
    while((int)knownA.size() < sq && (int)knownB.size() < sq) {
        ask.clear();
        
        bool type;
        if(knownA.size() > 1) {
            ask = {knownA[0], ++curr, knownA[1], ++curr};
            type = 1;
        }
        else {
            ask = {knownB[0], ++curr, knownB[1], ++curr};
            type = 0;
        }

        query2(ask, type);
    }

    // megoldas
    cnt = knownA.size();
    while(curr < n-1) {
        ask.clear();
        bool type;
        
        if(knownA.size() > knownB.size()) {
            type = 1;
            for(int i = 0; i < (int)knownA.size(); i++) {
                ask.push_back(knownA[i]);
                ask.push_back(++curr);
                if(curr == n-1) break;
            }
        }
        else {
            type = 0;
            for(int i = 0; i < (int)knownB.size(); i++) {
                ask.push_back(knownB[i]);
                ask.push_back(++curr);
                if(curr == n-1) break;
            }
        }

        query3(ask, type);
    }

    return cnt;
}

Subtask #1
92.2449 / 100.0

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