oj.uz

Submission #305233

# Submission time Handle Problem Language Result Execution time Memory
305233 2020-09-22T18:55:57 Z ScarletS Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 12 ms 384 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
#define sz(x) (int)(x).size()
using namespace std;
/**
int N,a[20000],totalQ=0;

int use_machine(vector<int> v)
{
    int k = sz(v), sendBack=0;
    ++totalQ;
    for (int i=1;i<k;++i)
        if (a[v[i]]!=a[v[i-1]])
            ++sendBack;
    return sendBack;
}
**/
const int upkeep=80;

int count_mushrooms(int n) {
    if (n<=226*2)
    {
        int ans=0;
        for (int i = 1; i+1 < n; i+=2)
            ans+=use_machine({i,0,i+1});
        if (!(n&1))
            ans+=use_machine({n-1,0});
        return n-ans;
    }
    else
    {
        vector<int> v={0},w,m;
        int x,y,doneTill=0,k;
        while (max(sz(v),sz(w))<2)
        {
            if (use_machine({0,++doneTill}))
                w.push_back(doneTill);
            else
                v.push_back(doneTill);
        }
        //cout<<sz(v)<<" "<<sz(w)<<"\n";
        while (max(sz(v),sz(w))<upkeep)
        {
            if (sz(v)>sz(w))
            {
                k=use_machine({doneTill+1,v[0],doneTill+2,v[1]});
                if (k&1)
                    w.push_back(doneTill+1);
                else
                    v.push_back(doneTill+1);
                if ((k>>1)&1)
                    w.push_back(doneTill+2);
                else
                    v.push_back(doneTill+2);
            }
            else
            {
                k=use_machine({doneTill+1,w[0],doneTill+2,w[1]});
                if (k&1)
                    v.push_back(doneTill+1);
                else
                    w.push_back(doneTill+1);
                if ((k>>1)&1)
                    v.push_back(doneTill+2);
                else
                    w.push_back(doneTill+2);
            }
            doneTill+=2;
        }
        //cout<<sz(v)<<" "<<sz(w)<<"\n";
        x=sz(v);y=sz(w);
        while (doneTill+1<n)
        {
            m.clear();
            if (sz(v)>sz(w))
            {
                for (int i=doneTill+1;i<=min(doneTill+sz(v),n-1);++i)
                {
                    m.push_back(i);
                    m.push_back(0);
                }
                for (int i=1;i<sz(m);i+=2)
                    m[i]=v[(i>>1)];
                k=use_machine(m);
                if (k&1)
                {
                    w.push_back(m[0]);
                    ++y;
                }
                else
                {
                    v.push_back(m[0]);
                    ++x;
                }
                y+=(k>>1);
                x+=(((sz(m)-1)>>1)-(k>>1));
            }
            else
            {
                for (int i=doneTill+1;i<=min(doneTill+sz(w),n-1);++i)
                {
                    m.push_back(i);
                    m.push_back(0);
                }
                for (int i=1;i<sz(m);i+=2)
                    m[i]=w[(i>>1)];
                k=use_machine(m);
                if (k&1)
                {
                    v.push_back(m[0]);
                    ++x;
                }
                else
                {
                    w.push_back(m[0]);
                    ++y;
                }
                x+=(k>>1);
                y+=(((sz(m)-1)>>1)-(k>>1));
            }
            doneTill=m[sz(m)-2];
        }
        return x;
    }
}
/**
int main()
{
    cin>>N;
    for (int i=0;i<N;++i)
        cin>>a[i];
    cout<<count_mushrooms(N)<<"\n";
    cout<<totalQ<<" queries\n";
}**/

Subtask #1
92.623 / 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 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 8 ms 384 KB Output is correct
8 Correct 7 ms 256 KB Output is correct
9 Correct 6 ms 376 KB Output is correct
10 Correct 9 ms 256 KB Output is correct
11 Partially correct 7 ms 380 KB Output is partially correct
12 Correct 7 ms 256 KB Output is correct
13 Correct 6 ms 384 KB Output is correct
14 Correct 5 ms 256 KB Output is correct
15 Partially correct 8 ms 256 KB Output is partially correct
16 Partially correct 12 ms 376 KB Output is partially correct
17 Correct 5 ms 256 KB Output is correct
18 Correct 11 ms 256 KB Output is correct
19 Partially correct 7 ms 256 KB Output is partially correct
20 Correct 7 ms 256 KB Output is correct
21 Correct 9 ms 256 KB Output is correct
22 Partially correct 7 ms 256 KB Output is partially correct
23 Correct 7 ms 256 KB Output is correct
24 Correct 5 ms 256 KB Output is correct
25 Partially correct 9 ms 256 KB Output is partially correct
26 Partially correct 7 ms 256 KB Output is partially correct
27 Partially correct 7 ms 384 KB Output is partially correct
28 Partially correct 7 ms 256 KB Output is partially correct
29 Partially correct 7 ms 384 KB Output is partially correct
30 Partially correct 7 ms 256 KB Output is partially correct
31 Partially correct 7 ms 256 KB Output is partially correct
32 Partially correct 9 ms 256 KB Output is partially correct
33 Partially correct 9 ms 384 KB Output is partially correct
34 Partially correct 8 ms 256 KB Output is partially correct
35 Partially correct 8 ms 256 KB Output is partially correct
36 Partially correct 8 ms 380 KB Output is partially correct
37 Partially correct 8 ms 256 KB Output is partially correct
38 Partially correct 7 ms 384 KB Output is partially correct
39 Partially correct 8 ms 376 KB Output is partially correct
40 Partially correct 7 ms 256 KB Output is partially correct
41 Partially correct 9 ms 256 KB Output is partially correct
42 Partially correct 10 ms 256 KB Output is partially correct
43 Partially correct 7 ms 256 KB Output is partially correct
44 Partially correct 7 ms 256 KB Output is partially correct
45 Partially correct 9 ms 256 KB Output is partially correct
46 Partially correct 7 ms 256 KB Output is partially correct
47 Partially correct 9 ms 256 KB Output is partially correct
48 Partially correct 9 ms 256 KB Output is partially correct
49 Partially correct 7 ms 376 KB Output is partially correct
50 Partially correct 9 ms 256 KB Output is partially correct
51 Partially correct 7 ms 360 KB Output is partially correct
52 Partially correct 9 ms 376 KB Output is partially correct
53 Partially correct 8 ms 256 KB Output is partially correct
54 Partially correct 7 ms 384 KB Output is partially correct
55 Partially correct 6 ms 376 KB Output is partially correct
56 Partially correct 11 ms 360 KB Output is partially correct
57 Partially correct 7 ms 376 KB Output is partially correct
58 Partially correct 9 ms 256 KB Output is partially correct
59 Partially correct 7 ms 256 KB Output is partially correct
60 Partially correct 10 ms 384 KB Output is partially correct
61 Partially correct 9 ms 256 KB Output is partially correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 1 ms 256 KB Output is correct
64 Correct 1 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 1 ms 256 KB Output is correct
71 Correct 0 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 1 ms 256 KB Output is correct
88 Correct 0 ms 256 KB Output is correct
89 Correct 0 ms 256 KB Output is correct
90 Correct 1 ms 256 KB Output is correct
91 Correct 0 ms 256 KB Output is correct