oj.uz

Submission #899881

# Submission time Handle Problem Language Result Execution time Memory
899881 2024-01-07T08:15:18 Z abcvuitunggio Counting Mushrooms (IOI20_mushrooms) C++17
100 / 100
 6 ms 772 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
const int k=100;
vector <int> a[2];
int t,res;
int count_mushrooms(int n){
    if (n<=227){
        for (int i=1;i<n;i++)
            res+=1-use_machine({0,i});
        return res+1;
    }
    a[0].push_back(0);
    for (int i=1;i<=2;i++){
        int x=use_machine({0,i});
        a[x].push_back(i);
    }
    int ch=0;
    if (a[0].size()<a[1].size()){
        swap(a[0],a[1]);
        ch=1;
    }
    int x=use_machine({3,a[0][0],4,a[0][1]});
    a[x&1].push_back(3);
    a[(x>>1)&1].push_back(4);
    if (a[0].size()<a[1].size()){
        swap(a[0],a[1]);
        ch^=1;
    }
    for (int i=5;max(a[0].size(),a[1].size())<k;){
        int x=use_machine({i,a[0][0],i+1,a[0][1],i+2,a[0][2]});
        a[x&1].push_back(i);
        x/=2;
        if (x%2==0){
            a[x/2].push_back(i+1);
            a[x/2].push_back(i+2);
            i+=3;
            continue;
        }
        if (a[1].size()<2){
            x=use_machine({a[0][0],i+1});
            a[x].push_back(i+1);
            a[x^1].push_back(i+2);
            i+=3;
            continue;
        }
        x=use_machine({i+4,a[0][0],i+3,a[0][1],i+2,a[0][2],a[1][0],i+1,a[1][1]})-1;
        a[x&1].push_back(i+4);
        x/=2;
        a[x&1].push_back(i+3);
        x/=2;
        a[x].push_back(i+2);
        a[x^1].push_back(i+1);
        i+=5;
    }
    t=(a[0].size()<k)^ch;
    if (a[0].size()<k)
        swap(a[0],a[1]);
    res=a[1].size();
    for (int i=a[0].size()+a[1].size();i<n;){
        vector <int> ve;
        for (int j=i;j<min(i+(int)a[0].size(),n);j++){
            ve.push_back(j);
            ve.push_back(a[0][j-i]);
        }
        int x=use_machine(ve);
        res+=(x+1)/2;
        a[x&1].push_back(i);
        if (a[0].size()<a[1].size()){
            res=min(i+(int)a[0].size(),n)-res;
            swap(a[0],a[1]);
            t^=1;
        }
        i=ve[ve.size()-2]+1;
    }
    return (t?res:n-res);
}

Subtask #1
100.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 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 444 KB Output is correct
7 Correct 4 ms 460 KB Output is correct
8 Correct 5 ms 772 KB Output is correct
9 Correct 4 ms 460 KB Output is correct
10 Correct 4 ms 460 KB Output is correct
11 Correct 4 ms 456 KB Output is correct
12 Correct 4 ms 464 KB Output is correct
13 Correct 4 ms 460 KB Output is correct
14 Correct 2 ms 460 KB Output is correct
15 Correct 5 ms 456 KB Output is correct
16 Correct 4 ms 456 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 4 ms 456 KB Output is correct
19 Correct 4 ms 464 KB Output is correct
20 Correct 6 ms 464 KB Output is correct
21 Correct 4 ms 456 KB Output is correct
22 Correct 4 ms 460 KB Output is correct
23 Correct 4 ms 460 KB Output is correct
24 Correct 2 ms 456 KB Output is correct
25 Correct 4 ms 460 KB Output is correct
26 Correct 4 ms 708 KB Output is correct
27 Correct 5 ms 464 KB Output is correct
28 Correct 5 ms 460 KB Output is correct
29 Correct 4 ms 464 KB Output is correct
30 Correct 5 ms 456 KB Output is correct
31 Correct 4 ms 456 KB Output is correct
32 Correct 5 ms 460 KB Output is correct
33 Correct 4 ms 456 KB Output is correct
34 Correct 4 ms 456 KB Output is correct
35 Correct 4 ms 460 KB Output is correct
36 Correct 4 ms 464 KB Output is correct
37 Correct 4 ms 460 KB Output is correct
38 Correct 5 ms 712 KB Output is correct
39 Correct 5 ms 464 KB Output is correct
40 Correct 4 ms 456 KB Output is correct
41 Correct 4 ms 460 KB Output is correct
42 Correct 4 ms 460 KB Output is correct
43 Correct 4 ms 460 KB Output is correct
44 Correct 4 ms 460 KB Output is correct
45 Correct 4 ms 460 KB Output is correct
46 Correct 4 ms 712 KB Output is correct
47 Correct 4 ms 708 KB Output is correct
48 Correct 4 ms 456 KB Output is correct
49 Correct 4 ms 456 KB Output is correct
50 Correct 4 ms 460 KB Output is correct
51 Correct 4 ms 460 KB Output is correct
52 Correct 4 ms 456 KB Output is correct
53 Correct 4 ms 460 KB Output is correct
54 Correct 4 ms 460 KB Output is correct
55 Correct 4 ms 460 KB Output is correct
56 Correct 4 ms 460 KB Output is correct
57 Correct 4 ms 456 KB Output is correct
58 Correct 4 ms 452 KB Output is correct
59 Correct 4 ms 456 KB Output is correct
60 Correct 4 ms 460 KB Output is correct
61 Correct 4 ms 456 KB Output is 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 1 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 1 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