oj.uz

Submission #720565

# Submission time Handle Problem Language Result Execution time Memory
720565 2023-04-08T13:25:43 Z bin9638 Counting Mushrooms (IOI20_mushrooms) C++17
80.7143 / 100
 10 ms 516 KB 
#include <bits/stdc++.h>

#ifndef SKY
#include "mushrooms.h"
#endif // SKY

using namespace std;

#define N 100010
#define ll long long
#define fs first
#define sc second
#define ii pair<int,int>
#define pb push_back

#ifdef SKY
int type[N];
int use_machine(vector<int>s)
{
    int res=0;
    for(int i=0;i<s.size()-1;i++)
        res+=(type[s[i]]!=type[s[i+1]]);
    return res;
}
#endif // SKY

int n,hv[N];
vector<int>A,B;

int count_mushrooms(int cc)
{
    n=cc;
    A.clear();
    B.clear();
    A.pb(0);
    int res=1;
    for(int i=0;i<n;i++)
        hv[i]=i;
    random_shuffle(hv+1,hv+n);
    for(int i=1;i<n;)
    {
        if(A.size()>=B.size())
        {
            vector<int>hoi;
            int cnt=0;
            for(int j=i;j<min(n,i+(int)A.size());j++)
            {
                cnt++;
                hoi.pb(hv[j]);
                hoi.pb(A[j-i]);
            }
            int val=(cnt*2-1-use_machine(hoi));
            res+=((val+1)/2);
            if(val&1)
                A.pb(hv[i]);
                    else B.pb(hv[i]);
            i+=(A.size()-(val&1));
        }else
        {
            vector<int>hoi;
            int cnt=0;
            for(int j=i;j<min(n,i+(int)B.size());j++)
            {
                hoi.pb(hv[j]);
                hoi.pb(B[j-i]);
                cnt++;
            }
            int val=(cnt*2-1-use_machine(hoi));
            res+=(cnt-((val+1)/2));
            if(val&1)
                B.pb(hv[i]);
                    else A.pb(hv[i]);
            i+=(B.size()-(val&1));
        }
       // cout<<res<<" "<<i<<endl;
    }
    return res;
}

#ifdef SKY
int main()
{
    freopen("A.inp","r",stdin);
    freopen("A.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>type[i];
    cout<<count_mushrooms(n);
    return 0;
}
#endif

Subtask #1
80.7143 / 100.0

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