Submission #309069

#	Time	Username	Problem	Language	Result	Execution time	Memory
309069		Vimmer	Counting Mushrooms (IOI20_mushrooms)	C++14	56.36 / 100	16 ms	1408 KiB

mushrooms

#include <bits/stdc++.h>
#include "mushrooms.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#define N 100005
#define PB push_back
#define sz(x) int(x.size())
#define F first
#define M ll(1e9 + 7)
#define S second
#define all(x) x.begin(), x.end()
#define endl '\n'

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

using namespace std;
//using namespace __gnu_pbds;

typedef long long ll;
//typedef tree <int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int val[N], kol, sum = 0;
//
//int use_machine(vector <int> &pr)
//{
//    sum += sz(pr);
//
//    if (sz(pr) < 2) exit(0);
//
//    kol++;
//
//    int ans = 0;
//
//    for (int i = 1; i < sz(pr); i++)
//        if (val[pr[i]] != val[pr[i - 1]]) ans++;
//
//    return ans;
//}

int ask(vector <int> &m) { return use_machine(m);}
int ask(set <int> &se) {vector <int> m; m.clear(); for (auto it : se) m.PB(it); return use_machine(m);}

ll mlt(ll x, ll y) {return (x * y) % M;}
ll sm(ll x, ll y) {return (x + y) % M;}

int NEED = 220, nr;

vector <int> tr, tl;

int es_minus_3(set <int> &se)
{
    int ans = sz(tr);

    if (sz(tr) > sz(tl))
    {
        while (sz(se) > 0)
        {
            int i = 0;

            vector <int> m; m.clear();

            while (i + 1 < sz(tr) && sz(se) > 0)
            {
                m.PB(tr[i++]);

                m.PB(*se.begin());

                se.erase(se.begin());
            }

            m.PB(tr[i++]);

            int koler = (sz(m) / 2) - (ask(m) / 2);

            ans += koler;
        }
    }
    else
    {
        while (sz(se) > 0)
        {
            int i = 0;

            vector <int> m; m.clear();

            while (i + 1 < sz(tl) && sz(se) > 0)
            {
                m.PB(tl[i++]);

                m.PB(*se.begin());

                se.erase(se.begin());
            }

            m.PB(tl[i++]);

            int koler = ask(m) / 2;

            ans += koler;
        }
    }

    return ans;
}

int count_mushrooms(int n)
{
    nr = n;

    tr.PB(0);

    vector <int> m; m.clear();

    m.PB(0);

    set <int> se; se.clear();

    for (int i = 1; i < n; i++) se.insert(i);

    int i = 1;

    while (i < n && sz(tr) + sz(tl) < NEED)
    {
        m.PB(i);

        int val = ask(m);

        m.pop_back();

        se.erase(i);

        if (val == 1) tl.PB(i++); else tr.PB(i++);
    }

    return es_minus_3(se);
}

//int main()
//{
//    iostream::sync_with_stdio(0); ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//
//    freopen("1.in", "r", stdin); //freopen("fcolor.out", "w", stdout);
//
//    int n;
//
//    cin >> n;
//
//    int num = 0;
//
//    for (int i = 0; i < n; i++) {cin >> val[i]; if (val[i] == 0) num++;}
//
//    cout << num << endl;
//
//    cout << count_mushrooms(n) << endl;
//
//    cout << kol << " " << sum << endl;
//}

• Subtask 1: 56.3591 / 100