답안 #309188

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
309188 2020-10-02T20:37:16 Z Vimmer 버섯 세기 (IOI20_mushrooms) C++14
100 / 100
13 ms 1408 KB
#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)
//{
//    if (kol < 4) {for (auto it : pr) cout << it << " "; cout << endl; }
//
//    set <int> se; se.clear();
//
//    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 skok = 103;

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;}

vector <int> tr, tl;

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

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

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

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

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

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

            int val = ask(m);

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

            if (val % 2) {koler--; tl.PB(m.back());}
              else tr.PB(m.back());

            ans += koler;
        }
        else
        {
            while (i < sz(tl) && sz(se) > 0)
            {
                m.PB(tl[i++]);

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

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

            int val = ask(m);

            int koler = val / 2;

            if (val % 2) {tr.PB(m.back()); koler++;}
              else tl.PB(m.back());

            ans += koler;
        }
    }

    return ans;
}

void dec(set <int> &se) {se.erase(se.begin());}

int count_mushrooms(int 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);

    if (n > 300)
    {
        vector <int> m = {0, *se.begin()};

        dec(se);

        if (ask(m) == 0)
        {
            tr.PB(m.back());

            m.resize(4);

            m[0] = 0;

            m[2] = tr[1];

            m[1] = *se.begin();

            dec(se);

            m[3] = *se.begin();

            dec(se);

            int val = ask(m);

            if (val == 0) {tr.PB(m[1]); tr.PB(m[3]);} else
            if (val == 1) {tr.PB(m[1]); tl.PB(m[3]);} else
            if (val == 2) {tr.PB(m[3]); tl.PB(m[1]);} else
            if (val == 3) {tl.PB(m[1]); tl.PB(m[3]);}

            while (max(sz(tl), sz(tr)) < 3)
                {
                    m.resize(4);

                    m[0] = 0;

                    m[2] = tr[1];

                    m[1] = *se.begin();

                    dec(se);

                    m[3] = *se.begin();

                    dec(se);

                    val = ask(m);

                    if (val == 0) {tr.PB(m[1]); tr.PB(m[3]);} else
                    if (val == 1) {tr.PB(m[1]); tl.PB(m[3]);} else
                    if (val == 2) {tr.PB(m[3]); tl.PB(m[1]);} else
                    if (val == 3) {tl.PB(m[1]); tl.PB(m[3]);}
                }
        }
        else
        {
            tl.PB(m[1]);

            m[1] = *se.begin();

            dec(se);

            if (ask(m) != 0)
            {
                tl.PB(m[1]);

                m.clear();

                m.PB(tl[0]);

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

                dec(se);

                m.PB(tl[1]);

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

                dec(se);

                int val = ask(m);

                if (val == 0) {tl.PB(m[1]); tl.PB(m[3]);}
                if (val == 1) {tl.PB(m[1]); tr.PB(m[3]);}
                if (val == 2) {tl.PB(m[3]); tr.PB(m[1]);}
                if (val == 3) {tr.PB(m[1]); tr.PB(m[3]);}

                while (max(sz(tl), sz(tr)) < 3)
                {
                    m[1] = *se.begin(); dec(se);

                    m[3] = *se.begin(); dec(se);

                    val = ask(m);

                    if (val == 0) {tl.PB(m[1]); tl.PB(m[3]);}
                    if (val == 1) {tl.PB(m[1]); tr.PB(m[3]);}
                    if (val == 2) {tl.PB(m[3]); tr.PB(m[1]);}
                    if (val == 3) {tr.PB(m[1]); tr.PB(m[3]);}
                }
            }
            else
            {
                tr.PB(m.back());

                m.resize(4);

                m[0] = 0;

                m[2] = tr[1];

                m[1] = *se.begin();

                dec(se);

                m[3] = *se.begin();

                dec(se);

                int val = ask(m);

                if (val == 0) {tr.PB(m[1]); tr.PB(m[3]);} else
                if (val == 1) {tr.PB(m[1]); tl.PB(m[3]);} else
                if (val == 2) {tr.PB(m[3]); tl.PB(m[1]);} else
                if (val == 3) {tl.PB(m[1]); tl.PB(m[3]);}

                while (max(sz(tl), sz(tr)) < 3)
                {
                    m.resize(4);

                    m[0] = 0;

                    m[2] = tr[1];

                    m[1] = *se.begin();

                    dec(se);

                    m[3] = *se.begin();

                    dec(se);

                    val = ask(m);

                    if (val == 0) {tr.PB(m[1]); tr.PB(m[3]);} else
                    if (val == 1) {tr.PB(m[1]); tl.PB(m[3]);} else
                    if (val == 2) {tr.PB(m[3]); tl.PB(m[1]);} else
                    if (val == 3) {tl.PB(m[1]); tl.PB(m[3]);}
                }
            }
        }
        while (max(sz(tl), sz(tr)) < skok)
        {
            m.resize(6);

            m[1] = *se.begin(); dec(se);
            m[3] = *se.begin(); dec(se);
            m[5] = *se.begin(); dec(se);

            if (sz(tl) > sz(tr))
            {
                m[0] = tl[0];

                m[2] = tl[1];

                m[4] = tl[2];

                int val = ask(m);

                if (val % 2) tr.PB(m[5]);
                  else tl.PB(m[5]);

                if (val == 0 || val == 1) {tl.PB(m[1]); tl.PB(m[3]);}

                if ((val == 4 || val == 5)) {tr.PB(m[1]); tr.PB(m[3]);}

                if (val == 2 || val == 3)
                {
if (sz(tr) >= 2)
                    {
                        vector <int> p = {tr[0], m[1], tr[1], m[0], m[3], m[2], *se.begin(), m[4], 0}; dec(se);

                        p[8] = *se.begin(); dec(se);

                        int val = ask(p);

                        if (val % 2 == 0) tr.PB(p[8]);
                          else tl.PB(p[8]);

                        if (val <= 2) {tr.PB(p[1]); tl.PB(p[4]); tl.PB(p[6]);}
                        else
                        if (val <= 4) {tr.PB(p[1]); tl.PB(p[4]); tr.PB(p[6]);}
                        else if (val <= 6) {tl.PB(p[1]); tr.PB(p[4]); tl.PB(p[6]);}
                          else {tl.PB(p[1]); tr.PB(p[4]); tr.PB(p[6]);}

                        continue;
                    }
                    vector <int> p; p.resize(4);

                    for (int i = 0; i < 4; i++) p[i] = m[i];

                    val = ask(p);

                    if (val == 0) {tl.PB(m[1]); tl.PB(m[3]);}

                    if (val == 1) {tl.PB(m[1]); tr.PB(m[3]);}

                    if (val == 2) {tr.PB(m[1]); tl.PB(m[3]);}

                    if (val == 3) {tr.PB(m[1]); tr.PB(m[3]);}
                }
            }
            else
            {
                m[0] = tr[0];

                m[2] = tr[1];

                m[4] = tr[2];

                int val = ask(m);

                if (val % 2) tl.PB(m[5]);
                  else tr.PB(m[5]);

                if (val == 0 || val == 1) {tr.PB(m[1]); tr.PB(m[3]);}

                if ((val == 4 || val == 5)) {tl.PB(m[1]); tl.PB(m[3]);}

                if (val == 2 || val == 3)
                {
		   if (sz(tl) >= 2)
                    {
                        vector <int> p = {tl[0], m[1], tl[1], m[0], m[3], m[2], *se.begin(), m[4], 0}; dec(se);

                        p[8] = *se.begin(); dec(se);

                        int val = ask(p);

                        if (val % 2 == 0) tl.PB(p[8]);
                          else tr.PB(p[8]);

                        if (val <= 2) {tl.PB(p[1]); tr.PB(p[4]); tr.PB(p[6]);}
                        else
                        if (val <= 4) {tl.PB(p[1]); tr.PB(p[4]); tl.PB(p[6]);}
                        else if (val <= 6) {tr.PB(p[1]); tl.PB(p[4]); tr.PB(p[6]);}
                          else {tr.PB(p[1]); tl.PB(p[4]); tl.PB(p[6]);}

                        continue;
                    }

                    vector <int> p; p.resize(4);

                    for (int i = 0; i < 4; i++) p[i] = m[i];

                    val = ask(p);

                    if (val == 0) {tr.PB(m[1]); tr.PB(m[3]);}

                    if (val == 1) {tr.PB(m[1]); tl.PB(m[3]);}

                    if (val == 2) {tl.PB(m[1]); tr.PB(m[3]);}

                    if (val == 3) {tl.PB(m[1]); tl.PB(m[3]);}
                }
            }
        }
    }
    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;
//}
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 512 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 11 ms 1280 KB Output is correct
8 Correct 12 ms 1280 KB Output is correct
9 Correct 12 ms 1280 KB Output is correct
10 Correct 11 ms 1280 KB Output is correct
11 Correct 11 ms 1280 KB Output is correct
12 Correct 13 ms 1280 KB Output is correct
13 Correct 10 ms 1280 KB Output is correct
14 Correct 6 ms 768 KB Output is correct
15 Correct 13 ms 1280 KB Output is correct
16 Correct 11 ms 1280 KB Output is correct
17 Correct 6 ms 768 KB Output is correct
18 Correct 10 ms 1324 KB Output is correct
19 Correct 11 ms 1280 KB Output is correct
20 Correct 11 ms 1280 KB Output is correct
21 Correct 11 ms 1280 KB Output is correct
22 Correct 11 ms 1280 KB Output is correct
23 Correct 10 ms 1324 KB Output is correct
24 Correct 6 ms 768 KB Output is correct
25 Correct 10 ms 1328 KB Output is correct
26 Correct 11 ms 1276 KB Output is correct
27 Correct 11 ms 1280 KB Output is correct
28 Correct 11 ms 1280 KB Output is correct
29 Correct 11 ms 1280 KB Output is correct
30 Correct 13 ms 1280 KB Output is correct
31 Correct 11 ms 1280 KB Output is correct
32 Correct 11 ms 1280 KB Output is correct
33 Correct 12 ms 1280 KB Output is correct
34 Correct 11 ms 1280 KB Output is correct
35 Correct 12 ms 1280 KB Output is correct
36 Correct 12 ms 1280 KB Output is correct
37 Correct 13 ms 1280 KB Output is correct
38 Correct 13 ms 1400 KB Output is correct
39 Correct 11 ms 1280 KB Output is correct
40 Correct 10 ms 1328 KB Output is correct
41 Correct 11 ms 1280 KB Output is correct
42 Correct 11 ms 1280 KB Output is correct
43 Correct 13 ms 1280 KB Output is correct
44 Correct 11 ms 1280 KB Output is correct
45 Correct 12 ms 1280 KB Output is correct
46 Correct 10 ms 1328 KB Output is correct
47 Correct 11 ms 1280 KB Output is correct
48 Correct 11 ms 1280 KB Output is correct
49 Correct 10 ms 1328 KB Output is correct
50 Correct 12 ms 1280 KB Output is correct
51 Correct 13 ms 1280 KB Output is correct
52 Correct 11 ms 1280 KB Output is correct
53 Correct 10 ms 1328 KB Output is correct
54 Correct 11 ms 1280 KB Output is correct
55 Correct 11 ms 1280 KB Output is correct
56 Correct 11 ms 1280 KB Output is correct
57 Correct 11 ms 1408 KB Output is correct
58 Correct 11 ms 1280 KB Output is correct
59 Correct 11 ms 1280 KB Output is correct
60 Correct 11 ms 1280 KB Output is correct
61 Correct 13 ms 1280 KB Output is correct
62 Correct 1 ms 384 KB Output is correct
63 Correct 1 ms 384 KB Output is correct
64 Correct 0 ms 384 KB Output is correct
65 Correct 0 ms 384 KB Output is correct
66 Correct 0 ms 384 KB Output is correct
67 Correct 0 ms 256 KB Output is correct
68 Correct 1 ms 384 KB Output is correct
69 Correct 0 ms 384 KB Output is correct
70 Correct 0 ms 384 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 384 KB Output is correct
74 Correct 1 ms 384 KB Output is correct
75 Correct 0 ms 256 KB Output is correct
76 Correct 0 ms 384 KB Output is correct
77 Correct 0 ms 384 KB Output is correct
78 Correct 0 ms 256 KB Output is correct
79 Correct 1 ms 256 KB Output is correct
80 Correct 0 ms 384 KB Output is correct
81 Correct 0 ms 384 KB Output is correct
82 Correct 0 ms 384 KB Output is correct
83 Correct 0 ms 384 KB Output is correct
84 Correct 0 ms 256 KB Output is correct
85 Correct 1 ms 384 KB Output is correct
86 Correct 0 ms 256 KB Output is correct
87 Correct 0 ms 384 KB Output is correct
88 Correct 0 ms 256 KB Output is correct
89 Correct 0 ms 384 KB Output is correct
90 Correct 0 ms 384 KB Output is correct
91 Correct 0 ms 384 KB Output is correct