Submission #404959

#	Time	Username	Problem	Language	Result	Execution time	Memory
404959		Victor	Chameleon's Love (JOI20_chameleon)	C++17	4 / 100	26 ms	412 KiB

chameleon

#include "chameleon.h"

#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define per(i, a, b) for (int i = b - 1; i >= (a); --i)
#define trav(a, x) for (auto &a : x)

#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back

#define umap unordered_map
#define uset unordered_set

typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;

const int INF = 1'000'000'007;

namespace {

int variable_example = 1;

}  // namespace

bitset<1001> taken;

void bsearch(vi chams, int cham) {
    if (sz(chams) == 1) {
        taken[chams[0]-1] = 1;
        Answer(cham, chams[0]);
        return;
    }

    int si = sz(chams);
    vi next(si >> 1);
    rep(i, 0, si >> 1) next[i] = chams[i];

    int c1 = Query(next);
    next.pb(cham);
    int c2 = Query(next);

    if (c1 == c2)
        next.pop_back();

    else {
        next.clear();
        rep(i, si >> 1, si)next.pb(chams[i]);
    }

    bsearch(next,cham);
}

void Solve(int n) {
    rep(i, 0, n*2) {
        if (taken[i]) continue;
        taken[i] = 1;
        vi vec;
        rep(j, 0, n*2) if (!taken[j]) vec.pb(j + 1);
        bsearch(vec,i+1);
    }
}

Compilation message (stderr)

chameleon.cpp:29:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
   29 | int variable_example = 1;
      |     ^~~~~~~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36