oj.uz

Submission #352472

# Submission time Handle Problem Language Result Execution time Memory
352472 2021-01-20T23:09:04 Z Osama_Alkhodairy Counting Mushrooms (IOI20_mushrooms) C++17
92.2449 / 100
 10 ms 532 KB 
#include <bits/stdc++.h>
#include "mushrooms.h"
//~ #include "stub.cpp"
using namespace std;

int count_mushrooms(int n){
    vector <int> p[2];
    p[0].push_back(0);
    for(int i = 1 ; i < min(n, 3) ; i++){
        int x = use_machine({0, i});
        p[x].push_back(i);
    }
    int idx = 3;
    int k = 90;
    while(idx + 1 < n && (int)max(p[0].size(), p[1].size()) < k){
        int f = 0;
        if(p[f].size() < 2) f = 1;
        int x = use_machine({p[f][0], idx, p[f][1], idx + 1});
        p[(x % 2) ^ f].push_back(idx + 1);
        p[(x > 1) ^ f].push_back(idx);
        idx += 2;
    }
    if(idx == n - 1){
        int x = use_machine({0, idx});
        p[x].push_back(idx);
        return p[0].size();
    }
    int ret = p[0].size();
    while(idx < n){
        int f = 0;
        if(p[1].size() > p[0].size()) f = 1;
        vector <int> cur;
        for(auto &i : p[f]){
            if(idx == n) break;
            cur.push_back(i);
            cur.push_back(idx++);
        }
        int x = use_machine(cur);
        p[f ^ (x % 2)].push_back(cur.back());
        int diff = (x + 1) / 2;
        if(f == 1) ret += diff;
        else ret += cur.size() / 2 - diff;
    }
    return ret;
}

Subtask #1
92.2449 / 100.0

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