Submission #540733

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
540733	2022-03-21T15:16:11 Z	two_sides	Chameleon's Love (JOI20_chameleon)	C++17	Compilation error	0 ms	0 KB

chameleon

#include <bits/stdc++.h>

using namespace std;

bool check(vector<int> v, int x) {
    if (v.empty()) return false;
    v.push_back(x);
    return Query(v) != v.size();
}

void Solve(int n) {
    n = n * 2 + 1;
    vector<vector<int>> adj(n + 1);
    vector<int> col(n + 1), ans(n + 1);
    vector<int> pre(n + 1), nxt(n + 1);
    queue<int> que;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j < i; j++)
            col[j] = -1;
        for (int j = 1, u; j < i; j++) {
            if (col[j] >= 0) continue;
            que.push(j); col[j] = 0;
            while (que.size()) {
                u = que.front(); que.pop();
                for (int v : adj[u])
                    if (col[v] < 0) {
                        col[v] = 1 - col[u];
                        que.push(v);
                    }
            }
        }
        vector<int> half[2];
        for (int j = 1; j < i; j++)
            half[col[j]].push_back(j);
        for (int j = 0; j < 2; j++) {
            while (check(half[j], i)) {
                int l = 1, r = half[j].size();
                while (l < r) {
                    int m = (l + r) / 2;
                    if (check(vector<int>
                    (half[j].begin(),
                    half[j].begin() + m), i))
                        r = m;
                    else l = m + 1;
                }
            }
            adj[i].push_back(half[j][l - 1]);
            adj[hafl[j][l - 1]].push_back(i);
            half.erase(half[j].begin,
            half[j].begin() + m);
        }
    }
    for (int i = 1; i <= n; i++) {
        if (adj[i].size() == 1) continue;
        while (Query({i, adj[i][0], adj[i][1]}) != 1)
            rotate(adj[i].begin(), adj[i].begin() + 1, adj[i].end());
        nxt[i] = adj[i][2]; pre[adj[i][2]] = i;
    }
    for (int i = 1; i <= n; i++) {
        if (adj[i].size() == 1) ans[i] = adj[i][0];
        else ans[i] = adj[i][0] + adj[i][1] + adj[i][2] - nxt[i] - pre[i];
        if (ans[i] > i) Answer(i, ans[i]);
    }
}

Compilation message

chameleon.cpp: In function 'bool check(std::vector<int>, int)':
chameleon.cpp:8:12: error: 'Query' was not declared in this scope
    8 |     return Query(v) != v.size();
      |            ^~~~~
chameleon.cpp: In function 'void Solve(int)':
chameleon.cpp:47:38: error: 'l' was not declared in this scope
   47 |             adj[i].push_back(half[j][l - 1]);
      |                                      ^
chameleon.cpp:48:17: error: 'hafl' was not declared in this scope; did you mean 'half'?
   48 |             adj[hafl[j][l - 1]].push_back(i);
      |                 ^~~~
      |                 half
chameleon.cpp:49:18: error: request for member 'erase' in 'half', which is of non-class type 'std::vector<int> [2]'
   49 |             half.erase(half[j].begin,
      |                  ^~~~~
chameleon.cpp:50:31: error: 'm' was not declared in this scope
   50 |             half[j].begin() + m);
      |                               ^
chameleon.cpp:55:16: error: 'Query' was not declared in this scope
   55 |         while (Query({i, adj[i][0], adj[i][1]}) != 1)
      |                ^~~~~
chameleon.cpp:62:25: error: 'Answer' was not declared in this scope
   62 |         if (ans[i] > i) Answer(i, ans[i]);
      |                         ^~~~~~