Submission #416114

#	Time	Username	Problem	Language	Result	Execution time	Memory
416114		duality	버섯 세기 (IOI20_mushrooms)	C++14	91.87 / 100	17 ms	640 KiB

mushrooms

#define DEBUG 0
 
#include <bits/stdc++.h>
using namespace std;
 
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
 
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
 
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
 
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
 
// ---------- END OF TEMPLATE ----------
#include "mushrooms.h"
 
int order[20000];
int query(vi v) {
    int i;
    for (i = 0; i < v.size(); i++) v[i] = order[v[i]];
    return use_machine(v);
}
int count_mushrooms(int n) {
    int i,j,ans = 0;
    vi a,b,v;
    vpii vv;
    a.pb(0);
    for (i = 0; i < n; i++) order[i] = i;
    //random_shuffle(order+1,order+n);
    vi q;
    for (i = 0; i < n; i++) q.pb(order[i]);
    //query(q);
    for (i = 1; i < n; i++) {
        v.pb(i);
        if ((max(a.size(),b.size()) >= 3) && (max(a.size(),b.size()) < 85) && (v.size() == 3)) {
            if (a.size() >= 3) {
                int r = query({v[0],a[0],v[1],a[1],v[2],a[2]});
                if (r & 1) b.pb(v[0]);
                else a.pb(v[0]);
                if (r/2 == 0) a.pb(v[1]),a.pb(v[2]);
                else if (r/2 == 2) b.pb(v[1]),b.pb(v[2]);
                else vv.pb(mp(v[1],v[2]));
            }
            else {
                int r = query({v[0],b[0],v[1],b[1],v[2],b[2]});
                if (r & 1) a.pb(v[0]);
                else b.pb(v[0]);
                if (r/2 == 0) b.pb(v[1]),b.pb(v[2]);
                else if (r/2 == 2) a.pb(v[1]),a.pb(v[2]);
                else vv.pb(mp(v[1],v[2]));
            }
            v.clear();
        }
        else if (v.size() == max(a.size(),b.size())) {
            if (a.size() > b.size()) {
                vi q;
                for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(a[j]);
                int r = query(q);
                ans += v.size()-r/2-1;
                if (r & 1) b.pb(v[0]);
                else a.pb(v[0]);
            }
            else {
                vi q;
                for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(b[j]);
                int r = query(q);
                ans += r/2;
                if (r & 1) a.pb(v[0]);
                else b.pb(v[0]);
            }
            v.clear();
        }
        if (vv.size() == 2) {
            if (a.size() >= 2) {
                int q = query({vv[0].first,a[0],vv[1].first,a[1]});
                if (q & 1) b.pb(vv[0].first),a.pb(vv[0].second);
                else a.pb(vv[0].first),b.pb(vv[0].second);
                if (q & 2) b.pb(vv[1].first),a.pb(vv[1].second);
                else a.pb(vv[1].first),b.pb(vv[1].second);
            }
            else {
                int q = query({vv[0].first,b[0],vv[1].first,b[1]});
                if (q & 1) a.pb(vv[0].first),b.pb(vv[0].second);
                else b.pb(vv[0].first),a.pb(vv[0].second);
                if (q & 2) a.pb(vv[1].first),b.pb(vv[1].second);
                else b.pb(vv[1].first),a.pb(vv[1].second);
            }
            vv.clear();
        }
        else if ((max(a.size(),b.size()) >= 85) && !vv.empty()) {
            int q = query({0,vv[0].first});
            if (q == 1) b.pb(vv[0].first),a.pb(vv[0].second);
            else a.pb(vv[0].first),b.pb(vv[0].second);
            vv.clear();
        }
    }
    if (vv.size() == 2) {
        if (a.size() >= 2) {
            int q = query({vv[0].first,a[0],vv[1].first,a[1]});
            if (q & 1) b.pb(vv[0].first),a.pb(vv[0].second);
            else a.pb(vv[0].first),b.pb(vv[0].second);
            if (q & 2) b.pb(vv[1].first),a.pb(vv[1].second);
            else a.pb(vv[1].first),b.pb(vv[1].second);
        }
        else {
            int q = query({vv[0].first,b[0],vv[1].first,b[1]});
            if (q & 1) a.pb(vv[0].first),b.pb(vv[0].second);
            else b.pb(vv[0].first),a.pb(vv[0].second);
            if (q & 2) a.pb(vv[1].first),b.pb(vv[1].second);
            else b.pb(vv[1].first),a.pb(vv[1].second);
        }
        vv.clear();
    }
    else if (!vv.empty()) {
        int q = query({0,vv[0].first});
        if (q == 1) b.pb(vv[0].first),a.pb(vv[0].second);
        else a.pb(vv[0].first),b.pb(vv[0].second);
        vv.clear();
    }
    if (!v.empty()) {
        if (a.size() > b.size()) {
            vi q;
            for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(a[j]);
            int r = query(q);
            ans += v.size()-r/2-1;
            if (r & 1) b.pb(v[0]);
            else a.pb(v[0]);
        }
        else {
            vi q;
            for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(b[j]);
            int r = query(q);
            ans += r/2;
            if (r & 1) a.pb(v[0]);
            else b.pb(v[0]);
        }
        v.clear();
    }
    return a.size()+ans;
}

Compilation message (stderr)

mushrooms.cpp: In function 'int query(vi)':
mushrooms.cpp:62:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |     for (i = 0; i < v.size(); i++) v[i] = order[v[i]];
      |                 ~~^~~~~~~~~~
mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:99:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |                 for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(a[j]);
      |                             ~~^~~~~~~~~~
mushrooms.cpp:107:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |                 for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(b[j]);
      |                             ~~^~~~~~~~~~
mushrooms.cpp:165:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  165 |             for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(a[j]);
      |                         ~~^~~~~~~~~~
mushrooms.cpp:173:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  173 |             for (j = 0; j < v.size(); j++) q.pb(v[j]),q.pb(b[j]);
      |                         ~~^~~~~~~~~~

• Subtask 1: 91.8699 / 100