oj.uz

Submission #1066217

# Submission time Handle Problem Language Result Execution time Memory
1066217 2024-08-19T16:37:53 Z Ahmed57 Counting Mushrooms (IOI20_mushrooms) C++17
88.2812 / 100
 7 ms 660 KB 
#include "bits/stdc++.h"
using namespace std;
#include "mushrooms.h"
 mt19937 rnd;
int count_mushrooms(int n){
    rnd.seed(time(0));
    int mi = 1e9 ;
    int B = 3;
    for(int b = 3;b<=n;b++){
        int cost = b/2+2;
        int ma = (b+1)/2;
        cost+=(n-b+ma-1)/ma;
        if(cost<mi){
            mi = cost;
            B = b;
        }
    }
    vector<int> BS[2];
    int cnt = 0;
    vector<int> label;
    for(int i = 0;i<n;i++)label.push_back(i);
    shuffle(label.begin()+1,label.end(),rnd);
    vector<int> pending;
    BS[0].push_back(0);
    for(int i = 1;i<min(n,3);i++){
        if(use_machine({0,label[i]})){
            BS[1].push_back(label[i]);
        }else {
            BS[0].push_back(label[i]);
        }
    }
    int la = 2;
    for(int i = 3;i+1<min(n,B);i+=2){
        la = i+1;
        if(BS[0].size()>1){
            //A
            int an = use_machine({BS[0][0],label[i],BS[0][1],label[i+1]});
            if(an==0){
                BS[0].push_back(label[i]);
                BS[0].push_back(label[i+1]);
                continue;
            }if(an==1){
                BS[0].push_back(label[i]);
                BS[1].push_back(label[i+1]);
                continue;
            }if(an==2){
                BS[1].push_back(label[i]);
                BS[0].push_back(label[i+1]);
                continue;
            }else{
                BS[1].push_back(label[i]);
                BS[1].push_back(label[i+1]);
                continue;
            }
        }else{
            int an = use_machine({BS[1][0],label[i],BS[1][1],label[i+1]});
            if(an==0){
                BS[1].push_back(label[i]);
                BS[1].push_back(label[i+1]);
                continue;
            }if(an==1){
                BS[1].push_back(label[i]);
                BS[0].push_back(label[i+1]);
                continue;
            }if(an==2){
                BS[0].push_back(label[i]);
                BS[1].push_back(label[i+1]);
                continue;
            }else{
                BS[0].push_back(label[i]);
                BS[0].push_back(label[i+1]);
                continue;
            }
        }
    }
    if(la+1<min(n,B)){
        if(use_machine({0,label[la+1]})){
            BS[1].push_back(label[la+1]);
        }else BS[0].push_back(label[la+1]);
    }
    cnt = BS[0].size();
    int sz = max(BS[0].size(),BS[1].size());
    vector<int> bs;
    
    for(int i = B;i<n;i+=sz){
        sz = max(sz,(int)max(BS[0].size(),BS[1].size()));
        int As , typ;
        if(BS[0].size()>BS[1].size()){
            As = 1;typ = 0;
        }else As = 0 , typ = 1;
        int xd = i;
        vector<int> lol;
        int nah = 0;
        int last = -1;
        for(int j = i;j<min(n,i+sz);j++){
            nah++;
            lol.push_back(BS[typ][j-i]);
            lol.push_back(label[j]);
            last = label[j];
        }
        int ans = use_machine(lol);
        if(ans%2){
            if(As==0){
                cnt++;
                BS[0].push_back(last);
            }else BS[1].push_back(last);
            ans--;
        }else{
            if(As==1){
                cnt++;
                BS[0].push_back(last);
            }else BS[1].push_back(last);
        }
        ans/=2;
        nah--;
        if(As==0)cnt+=ans;
        else cnt+=nah-ans;
    }
    return cnt;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:91:13: warning: unused variable 'xd' [-Wunused-variable]
   91 |         int xd = i;
      |             ^~

Subtask #1
88.2812 / 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 6 ms 600 KB Output is correct
8 Correct 4 ms 600 KB Output is correct
9 Correct 6 ms 600 KB Output is correct
10 Partially correct 4 ms 600 KB Output is partially correct
11 Partially correct 4 ms 600 KB Output is partially correct
12 Partially correct 4 ms 600 KB Output is partially correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 2 ms 552 KB Output is correct
15 Partially correct 7 ms 600 KB Output is partially correct
16 Partially correct 4 ms 600 KB Output is partially correct
17 Correct 2 ms 552 KB Output is correct
18 Correct 4 ms 600 KB Output is correct
19 Partially correct 4 ms 600 KB Output is partially correct
20 Partially correct 4 ms 600 KB Output is partially correct
21 Partially correct 4 ms 600 KB Output is partially correct
22 Partially correct 4 ms 600 KB Output is partially correct
23 Correct 5 ms 600 KB Output is correct
24 Correct 2 ms 600 KB Output is correct
25 Partially correct 4 ms 600 KB Output is partially correct
26 Partially correct 4 ms 600 KB Output is partially correct
27 Partially correct 5 ms 600 KB Output is partially correct
28 Partially correct 4 ms 660 KB Output is partially correct
29 Partially correct 4 ms 600 KB Output is partially correct
30 Partially correct 4 ms 600 KB Output is partially correct
31 Partially correct 4 ms 600 KB Output is partially correct
32 Partially correct 4 ms 600 KB Output is partially correct
33 Partially correct 4 ms 600 KB Output is partially correct
34 Partially correct 4 ms 600 KB Output is partially correct
35 Partially correct 4 ms 600 KB Output is partially correct
36 Partially correct 4 ms 600 KB Output is partially correct
37 Partially correct 4 ms 600 KB Output is partially correct
38 Partially correct 4 ms 600 KB Output is partially correct
39 Partially correct 4 ms 600 KB Output is partially correct
40 Partially correct 4 ms 600 KB Output is partially correct
41 Partially correct 4 ms 600 KB Output is partially correct
42 Partially correct 6 ms 600 KB Output is partially correct
43 Partially correct 4 ms 600 KB Output is partially correct
44 Partially correct 4 ms 600 KB Output is partially correct
45 Partially correct 4 ms 600 KB Output is partially correct
46 Partially correct 4 ms 600 KB Output is partially correct
47 Partially correct 4 ms 600 KB Output is partially correct
48 Partially correct 5 ms 600 KB Output is partially correct
49 Partially correct 4 ms 600 KB Output is partially correct
50 Partially correct 5 ms 600 KB Output is partially correct
51 Partially correct 4 ms 600 KB Output is partially correct
52 Partially correct 4 ms 600 KB Output is partially correct
53 Partially correct 4 ms 600 KB Output is partially correct
54 Partially correct 4 ms 600 KB Output is partially correct
55 Partially correct 4 ms 600 KB Output is partially correct
56 Partially correct 4 ms 600 KB Output is partially correct
57 Partially correct 5 ms 600 KB Output is partially correct
58 Partially correct 4 ms 600 KB Output is partially correct
59 Partially correct 6 ms 600 KB Output is partially correct
60 Partially correct 4 ms 600 KB Output is partially correct
61 Partially correct 4 ms 600 KB Output is partially 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 0 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 596 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 1 ms 596 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 1 ms 344 KB Output is correct
86 Correct 1 ms 344 KB Output is correct
87 Correct 0 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 1 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct