oj.uz

Submission #338276

# Submission time Handle Problem Language Result Execution time Memory
338276 2020-12-22T20:34:00 Z MvC Counting Mushrooms (IOI20_mushrooms) C++17
92.623 / 100
 9 ms 492 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define lun(x) (int)x.size()
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<60);
const int inf=(1<<30);
const int nmax=2e4+50;
const ll mod=1e9+7;
using namespace std;
int i,j,t,x,y,rs,k;
vector<int>a[2],v;
int ask(vector<int> a)
{
    return use_machine(a);
}
int count_mushrooms(int n)
{
    if(n==2)
    {
        if(!ask({0,1}))return 2;
        return 1;
    }
    a[0].pb(0);
    if(ask({0,1}))a[1].pb(1);
    else a[0].pb(1);
    if(ask({0,2}))a[1].pb(2);
    else a[0].pb(2);
    k=85;
    for(i=3;i<n;i+=2)
    {
        if(max(lun(a[0]),lun(a[1]))>=k)break;
        v.clear();
        for(j=0;j<2;j++)
        {
            if(lun(a[j])<2)continue;
            v.pb(i),v.pb(a[j][0]);
            if(i+1<n)v.pb(i+1),v.pb(a[j][1]);
            x=ask(v);
            if(!x)
            {
                a[j].pb(i);
                if(i+1<n)a[j].pb(i+1);
            }
            else if(x==1)
            {
                a[j^1].pb(i);
                if(i+1<n)a[j].pb(i+1);
            }
            else if(x==2)
            {
                a[j].pb(i);
                a[j^1].pb(i+1);
            }
            else if(x==3)
            {
                a[j^1].pb(i);
                a[j^1].pb(i+1);
            }
            break;
        }
    }
    rs=lun(a[0]);
    for(;i<n;i+=k)
    {
        v.clear(),y=0;
        if(lun(a[0])>=lun(a[1]))k=lun(a[0]),t=0;
        else k=lun(a[1]),t=1;
        for(j=i;j<min(i+k,n);j++)
        {
            v.pb(j);
            v.pb(a[t][j-i]);
            y++;
        }
        x=ask(v);
        if(x&1)a[t^1].pb(i);
        else a[t].pb(i);
        if(t)rs+=(x+1)/2;
        else rs+=y-(x+1)/2;
    }
    return rs;
}
/*int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);

    return 0;
}*/

Subtask #1
92.623 / 100.0

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