oj.uz

Submission #217299

# Submission time Handle Problem Language Result Execution time Memory
217299 2020-03-29T11:39:53 Z fedoseevtimofey Chameleon's Love (JOI20_chameleon) C++14
0 / 100
 43 ms 2808 KB 
#include "chameleon.h"
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <random>
#include <iomanip>
#include <functional>
#include <cassert>

using namespace std;

typedef long long ll;

void Solve(int n) {
  vector <vector <int>> g(2 * n);
  /*for (int i = 0; i < 2 * n; ++i) {
    for (int j = i + 1; j < 2 * n; ++j) {
      int x = Query({i + 1, j + 1});
      if (x == 1) {
        g[i].push_back(j);
        g[j].push_back(i);
      }
    }
  }*/
  map <vector <int>, int> ans;
  function <int(vector <int>)> my_query = [&] (const vector <int> &p) {
    vector <int> a = p;
    sort(a.begin(), a.end());
    for (int &x : a) ++x;
    if (!ans.count(a)) {
      ans[a] = Query(a);
    }
    return ans[a];
  };
  function <void(int, vector <int>)> rec = [&] (int v, vector <int> a) {
    if (a.size() == 1) {
      if (my_query({v, a[0]}) == 1) {
        g[v].push_back(a[0]);
        g[a[0]].push_back(v);
      }
    } else {
      int m = a.size() / 2;
      vector <int> b, c;
      for (int i = 0; i < m; ++i) b.push_back(a[i]);
      for (int i = m; i < (int)a.size(); ++i) c.push_back(a[i]);
      b.push_back(v);
      c.push_back(v);
      if (my_query(b) != (int)b.size() + 1) {
        b.pop_back();
        rec(v, b);
      }
      if (my_query(c) != (int)c.size() + 1) {
        c.pop_back();
        rec(v, c);
      }
    }
  };

  
  vector <int> a;
  for (int i = n; i < 2 * n; ++i) a.push_back(i);
  for (int i = 0; i < n; ++i) rec(i, a);
  vector <int> who(2 * n, -1);
  vector <set <int>> bad(2 * n);
  for (int i = 0; i < 2 * n; ++i) {
    if (g[i].size() == 1) {
      who[i] = g[i][0];
      who[g[i][0]] = i;
    } else if (g[i].size() == 3) {
      for (int j = 0; j < 3; ++j) {
        vector <int> p = {i + 1};
        for (int k = 0; k < 3; ++k) {
          if (k != j) p.push_back(g[i][k] + 1);
        }
        if (Query(p) == 1) {
          bad[i].insert(g[i][j]);
          bad[g[i][j]].insert(i);
        }
      }
    } else {
      assert(false);
    }
  }
  for (int i = 0; i < 2 * n; ++i) {
    if (who[i] == -1) {
      for (int j = 0; j < (int)g[i].size(); ++j) {
        if (!bad[i].count(g[i][j])) {
          who[i] = g[i][j];
        }
      }
    }
  }

  for (int i = 0; i < 2 * n; ++i) {
    if (who[i] > i) {
      Answer(i + 1, who[i] + 1);
    }
  }
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 43 ms 2808 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Runtime error 5 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Runtime error 5 ms 640 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 43 ms 2808 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Incorrect 43 ms 2808 KB Wrong Answer [3]
4 Halted 0 ms 0 KB -