oj.uz

Submission #309758

# Submission time Handle Problem Language Result Execution time Memory
309758 2020-10-04T13:17:32 Z georgerapeanu Counting Mushrooms (IOI20_mushrooms) C++17
87.9377 / 100
 10 ms 640 KB 
#include "mushrooms.h"
#include <cstdio>
#include <chrono>
#include <algorithm>
#include <random>

using namespace std;

const int TARGET = 141;

int count_mushrooms(int n) {

    mt19937 gen(chrono::steady_clock::now().time_since_epoch().count());

    vector<int> stuff[2];
    stuff[0] = {0};

    vector<int> order;

    for(int i = 1;i < n;i++){
        order.push_back(i);
    }

    shuffle(order.begin(),order.end(),gen);

    if(n <= 226){
        int ans = 1;
        for(int i = 1;i < n;i++){
            ans += (use_machine({0,i}) == 0);
        }
        return ans;
    }

    for(int i = 0;stuff[0].size() < 2 && stuff[1].size() < 2;i++){
        stuff[use_machine({0,order.back()})].push_back(order.back());
        order.pop_back();
    }

    while((int)stuff[0].size() < TARGET && (int)stuff[1].size() < TARGET && (int)order.size() > 1){
        if((int)stuff[0].size() > 1){
            int a = order.back();order.pop_back();
            int b = order.back();order.pop_back();
            int tmp = use_machine({stuff[0][0],a,stuff[0][1],b});
            stuff[tmp % 2].push_back(b);
            stuff[tmp / 2].push_back(a);
        }
        else{
            int a = order.back();order.pop_back();
            int b = order.back();order.pop_back();
            int tmp = use_machine({stuff[1][0],a,stuff[1][1],b});
            stuff[1 - (tmp % 2)].push_back(b);
            stuff[1 - (tmp / 2)].push_back(a);
        }
    }

    if(order.size() == 1){
        return (int)stuff[0].size() + (use_machine({0,order[0]}) == 0);
    }

    if(order.size() == 0){
        return stuff[0].size();
    }

    int ans = stuff[0].size();

    while((int)order.size() > 0){
        int cnt = min(order.size(),max(stuff[0].size(),stuff[1].size()));
        vector<int> tmp;
        if(stuff[0].size() > stuff[1].size()){
            for(int i = 0;i < cnt;i++){
                tmp.push_back(stuff[0][i]);
                tmp.push_back(order[(int)order.size() - 1 - i]);
            }
            int aux = use_machine(tmp);
            ans += cnt - ((aux / 2) + (aux % 2));
            stuff[aux % 2].push_back(tmp.back());
        }
        else{
            for(int i = 0;i < cnt;i++){
                tmp.push_back(stuff[1][i]);
                tmp.push_back(order[(int)order.size() - 1 - i]);
            }
            int aux = use_machine(tmp);
            ans += ((aux / 2) + (aux % 2));
            stuff[1 - (aux % 2)].push_back(tmp.back());
        }
        for(int i = 0;i < cnt;i++){
            order.pop_back();
        }
    }

    return ans;
}

Subtask #1
87.9377 / 100.0

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