Submission #979681

#	Time	Username	Problem	Language	Result	Execution time	Memory
979681		Pannda	Chameleon's Love (JOI20_chameleon)	C++14	100 / 100	28 ms	596 KiB

chameleon

#include "chameleon.h"
#include <bits/stdc++.h>
using namespace std;

void Solve(int n) {
    auto query = [&](vector<int> p) -> int {
        for (int &i : p) i++;
        return Query(p);
    };
    auto answer = [&](int i, int j) -> void {
        Answer(i + 1, j + 1);
    };
    auto sum = [&](vector<int> a, vector<int> b) -> vector<int> {
        a.insert(a.end(), b.begin(), b.end());
        return a;
    };

    vector<vector<int>> adj(2 * n);

    auto work = [&](auto self, vector<int> p) -> void {
        vector<int> p0, p1;
        for (int u : p) {
            if (query(sum(p0, {u})) == p0.size() + 1) {
                p0.push_back(u);
            } else {
                p1.push_back(u);
            }
        }
        swap(p0, p1);
        for (int u : p0) {
            vector<int> p = p1;
            while (true) {
                int l = 0, r = p.size();
                while (l + 1 < r) {
                    int m = (l + r) >> 1;
                    if (query(sum(vector<int>(p.begin() + l, p.begin() + m), {u})) < m - l + 1) {
                        r = m;
                    } else {
                        l = m;
                    }
                }
                int v = p[l];
                adj[u].push_back(v);
                adj[v].push_back(u);
                p.erase(p.begin() + l);
                if (query(sum(p, {u})) == p.size() + 1) break;
            }
        }
        if (!p0.empty()) self(self, p0);
    };
    work(work, [&]() -> vector<int> { vector<int> p(2 * n); iota(p.begin(), p.end(), 0); return p; }());

    for (int u = 0; u < 2 * n; u++) {
        for (int i = 0; i < 3 && adj[u].size() == 3; i++) {
            for (int j = i + 1; j < 3 && adj[u].size() == 3; j++) {
                if (query({u, adj[u][i], adj[u][j]}) == 1) {
                    adj[u] = {adj[u][i], adj[u][j]};
                }
            }
        }
    }

    for (int u = 0; u < 2 * n; u++) {
        for (int v : adj[u]) {
            if (find(adj[v].begin(), adj[v].end(), u) != adj[v].end()) {
                if (u < v) answer(u, v);
            }
        }
    }
}

Compilation message (stderr)

chameleon.cpp: In instantiation of 'Solve(int)::<lambda(auto:1, std::vector<int>)> [with auto:1 = Solve(int)::<lambda(auto:1, std::vector<int>)>]':
chameleon.cpp:51:103:   required from here
chameleon.cpp:23:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |             if (query(sum(p0, {u})) == p0.size() + 1) {
      |                 ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
chameleon.cpp:46:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |                 if (query(sum(p, {u})) == p.size() + 1) break;
      |                     ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~

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