Submission #212295

#	Time	Username	Problem	Language	Result	Execution time	Memory
212295		WLZ	Chameleon's Love (JOI20_chameleon)	C++14	4 / 100	54 ms	456 KiB

chameleon

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

namespace {
  vector< vector<int> > g;
  vector<int> found, st;

  void find(const vector<int>& v, int cur) {
    vector<int> tmp = v;
    tmp.push_back(cur);
    if (Query(tmp) == (int) tmp.size()) {
      return;
    }
    if ((int) v.size() == 1) {
      found.push_back(v[0]);
      return;
    }
    vector<int> a, b;
    for (int i = 0; i < (int) v.size(); i++) {
      if (i % 2 == 0) {
        a.push_back(v[i]);
      } else {
        b.push_back(v[i]);
      }
    }
    find(a, cur);
    find(b, cur);
  } 
}

void Solve(int N) {
  g.resize(2 * N + 1);
  st.resize(2 * N + 1);
  st[1] = 0;
  for (int i = 2; i <= 2 * N; i++) {
    found.clear();
    vector<int> a, b;
    for (int j = 1; j < i; j++) {
      if (st[j] == 0) {
        a.push_back(j);
      } else {
        b.push_back(j);
      }
    }
    find(a, i);
    find(b, i);
    if (found.empty()) {
      st[i] = 0;
    } else {
      for (auto& x : found) {
        st[i] = !st[x];
        g[i].push_back(x);
        g[x].push_back(i);
      }
    }
  }
  vector<int> used(2 * N + 1, 0), in(2 * N + 1), out(2 * N + 1);
  for (int i = 1; i <= 2 * N; i++) {
    if (used[i]) {
      continue;
    }
    if ((int) g[i].size() == 1) {
      Answer(i, g[i][0]);
      used[i] = used[g[i][0]] = 1;
    } else {
      if (Query({i, g[i][0], g[i][1]}) == 1) {
        out[i] = g[i][2];
        in[g[i][2]] = i;
      } else {
        if (Query({i, g[i][0], g[i][2]}) == 1) {
          out[i] = g[i][1];
          in[g[i][1]] = i;
        } else {
          out[i] = g[i][0];
          in[g[i][0]] = i;
        }
      }
    }
  }
  for (int i = 1; i <= 2 * N; i++) {
    if (used[i]) {
      continue;
    }
    for (auto& x : g[i]) {
      if (x != in[i] && x != out[i]) {
        Answer(i, x);
        used[i] = used[x] = 1;
      }
    }
  }
}

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