Submission #306912

# Submission time Handle Problem Language Result Execution time Memory
306912 2020-09-26T14:16:23 Z baluteshih Counting Mushrooms (IOI20_mushrooms) C++14
92.2449 / 100
11 ms 512 KB
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(),v.end()
#define pb push_back
#define SZ(a) ((int)a.size())

const int K=90;

int count_mushrooms(int n)
{
    if(n==2)
        return 2-use_machine({0,1});
    srand(time(NULL));
    int ans=0;
    vector<int> num(n-1,0);
	vector<int> a(1,0),b;
    for(int i=0;i+1<n;++i)
        num[i]=i+1;
    random_shuffle(ALL(num));
    for(int i=0;i<2;++i)
        if(use_machine({0,num[i]})==0)
            a.pb(num[i]);
        else
            b.pb(num[i]);
    for(int i=2,j=0;i+1<SZ(num)&&j<K;i+=2,++j)
    {
        if(SZ(a)>=2)
        {
            int x=use_machine({a[0],num[i],a[1],num[i+1]});
            if(x==0)
                a.pb(num[i]),a.pb(num[i+1]);
            else if(x==1)
                a.pb(num[i]),b.pb(num[i+1]);
            else if(x==2)
                a.pb(num[i+1]),b.pb(num[i]);
            else
                b.pb(num[i]),b.pb(num[i+1]);
        }
        else
        {
            int x=use_machine({b[0],num[i],b[1],num[i+1]});
            if(x==0)
                b.pb(num[i]),b.pb(num[i+1]);
            else if(x==1)
                b.pb(num[i]),a.pb(num[i+1]);
            else if(x==2)
                b.pb(num[i+1]),a.pb(num[i]);
            else
                a.pb(num[i]),a.pb(num[i+1]);
        }
    }
    if(SZ(num)<=2+2*K)
    {
        if((n&1)^1)
        {
            if(use_machine({0,num.back()})==0)
                a.pb(num.back());
            else
                b.pb(num.back());
        }
        return SZ(a);
    }
    ans=SZ(a);
    int nw=2+2*K;
    while(nw+max(SZ(a),SZ(b))<=SZ(num))
    {
        if(SZ(a)>=SZ(b))
        {
            int q=SZ(a);
            vector<int> tmp;
            for(int j=0;j<q;++j)
                tmp.pb(a[j]),tmp.pb(num[nw+j]);
            int x=use_machine(tmp);
            if(x&1)
                --x,b.pb(num[nw+q-1]);
            else
                ++ans,a.pb(num[nw+q-1]);
            ans+=((q-1)*2-x)/2;
            nw+=q;
        }
        else
        {
            int q=SZ(b);
            vector<int> tmp;
            for(int j=0;j<q;++j)
                tmp.pb(b[j]),tmp.pb(num[nw+j]);
            int x=use_machine(tmp);
            if(x&1)
                ++ans,--x,a.pb(num[nw+q-1]);
            else
                b.pb(num[nw+q-1]);
            ans+=x/2;
            nw+=q;
        }
    }
    if(nw<SZ(num))
    {
        if(SZ(a)>=SZ(b))
        {
            vector<int> tmp;
            for(int j=0;nw+j<SZ(num);++j)
                tmp.pb(a[j]),tmp.pb(num[nw+j]);
            tmp.pb(a.back());
            int x=use_machine(tmp);
            ans+=((SZ(num)-nw)*2-x)/2;
        }
        else
        {
            vector<int> tmp;
            for(int j=0;nw+j<SZ(num);++j)
                tmp.pb(b[j]),tmp.pb(num[nw+j]);
            tmp.pb(b.back());
            int x=use_machine(tmp);
            ans+=x/2;
        }
    }
    return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 256 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 9 ms 384 KB Output is correct
8 Correct 7 ms 384 KB Output is correct
9 Correct 7 ms 384 KB Output is correct
10 Correct 7 ms 384 KB Output is correct
11 Partially correct 7 ms 384 KB Output is partially correct
12 Correct 7 ms 384 KB Output is correct
13 Correct 7 ms 504 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Partially correct 8 ms 384 KB Output is partially correct
16 Partially correct 8 ms 384 KB Output is partially correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 9 ms 384 KB Output is correct
19 Partially correct 8 ms 512 KB Output is partially correct
20 Correct 7 ms 384 KB Output is correct
21 Correct 8 ms 384 KB Output is correct
22 Partially correct 7 ms 384 KB Output is partially correct
23 Correct 7 ms 384 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Partially correct 8 ms 384 KB Output is partially correct
26 Partially correct 8 ms 384 KB Output is partially correct
27 Partially correct 8 ms 384 KB Output is partially correct
28 Partially correct 8 ms 384 KB Output is partially correct
29 Partially correct 9 ms 384 KB Output is partially correct
30 Partially correct 10 ms 384 KB Output is partially correct
31 Partially correct 8 ms 384 KB Output is partially correct
32 Partially correct 11 ms 384 KB Output is partially correct
33 Partially correct 8 ms 384 KB Output is partially correct
34 Partially correct 8 ms 512 KB Output is partially correct
35 Partially correct 8 ms 504 KB Output is partially correct
36 Partially correct 8 ms 512 KB Output is partially correct
37 Partially correct 7 ms 460 KB Output is partially correct
38 Partially correct 8 ms 384 KB Output is partially correct
39 Partially correct 8 ms 384 KB Output is partially correct
40 Partially correct 8 ms 384 KB Output is partially correct
41 Partially correct 8 ms 384 KB Output is partially correct
42 Partially correct 7 ms 504 KB Output is partially correct
43 Partially correct 10 ms 384 KB Output is partially correct
44 Partially correct 8 ms 384 KB Output is partially correct
45 Partially correct 9 ms 384 KB Output is partially correct
46 Partially correct 10 ms 384 KB Output is partially correct
47 Partially correct 8 ms 384 KB Output is partially correct
48 Partially correct 9 ms 504 KB Output is partially correct
49 Partially correct 8 ms 384 KB Output is partially correct
50 Partially correct 8 ms 384 KB Output is partially correct
51 Partially correct 8 ms 504 KB Output is partially correct
52 Partially correct 8 ms 384 KB Output is partially correct
53 Partially correct 7 ms 384 KB Output is partially correct
54 Partially correct 9 ms 384 KB Output is partially correct
55 Partially correct 8 ms 384 KB Output is partially correct
56 Partially correct 9 ms 512 KB Output is partially correct
57 Partially correct 8 ms 384 KB Output is partially correct
58 Partially correct 8 ms 384 KB Output is partially correct
59 Partially correct 9 ms 384 KB Output is partially correct
60 Partially correct 8 ms 512 KB Output is partially correct
61 Partially correct 7 ms 456 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 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 0 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 1 ms 256 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 0 ms 256 KB Output is correct
81 Correct 1 ms 256 KB Output is correct
82 Correct 1 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 1 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 0 ms 256 KB Output is correct
91 Correct 0 ms 256 KB Output is correct