oj.uz

Submission #570306

# Submission time Handle Problem Language Result Execution time Memory
570306 2022-05-29T07:57:41 Z 600Mihnea ICC (CEOI16_icc) C++17
61 / 100
 187 ms 540 KB 
#include <bits/stdc++.h>
#include "icc.h"

using namespace std;

mt19937 rng((long long) (new char));

int get(vector<int> a, vector<int> b) {
  if (a.empty() || b.empty()) {
    return 0;
  }
  return query((int) a.size(), (int) b.size(), a.data(), b.data());
}

vector<int> operator + (vector<int> a, vector<int> b) {
  for (auto &x : b) {
    a.push_back(x);
  }
  return a;
}

const int N = 100 + 7;
int t[N];

int get_root(int a) {
  if (t[a] == a) {
    return a;
  } else {
    return t[a] = get_root(t[a]);
  }
}

void join(int a, int b) {
  t[get_root(a)] = get_root(b);
}

void run(int n) {
  for (int i = 1; i <= n; i++) {
    t[i] = i;
  }
  for (int step = 1; step <= n - 1; step++) {
    vector<vector<int>> comps;
    for (int i = 1; i <= n; i++) {
      if (get_root(i) == i) {
        vector<int> currentComp;
        for (int j = 1; j <= n; j++) {
          if (get_root(j) == i) {
            currentComp.push_back(j);
          }
        }
        comps.push_back(currentComp);
      }
    }

    assert((int) comps.size() == n - step + 1);
    assert((int) comps.size() >= 2);

    vector<int> p1, p2;
    while (1) {
      p1.clear();
      p2.clear();
      for (auto &comp : comps) {
        if (rng() & 1) {
          p1 = p1 + comp;
        } else {
          p2 = p2 + comp;
        }
      }
      assert((int) p1.size() + (int) p2.size() == n);
      if (get(p1, p2) == 1) {
        break;
      }
    }
    while ((int) p1.size() > 1 || (int) p2.size() > 1) {
      if ((int) p2.size() < (int) p1.size()) {
        swap(p1, p2);
      }
      assert((int) p1.size() <= (int) p2.size());
      vector<int> X(p2.begin(), p2.begin() + (int)p2.size() / 2), Y(p2.begin() + (int) p2.size() / 2, p2.end());
      assert((int) X.size() + (int) Y.size() == (int) p2.size());
      if (get(p1, X)) {
        p2 = X;
      } else {
        p2 = Y;
      }
    }
    assert((int) p1.size() == 1 && (int) p2.size() == 1);
    join(p1[0], p2[0]);
    setRoad(p1[0], p2[0]);
  }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 468 KB Ok! 115 queries used.
2 Correct 9 ms 468 KB Ok! 108 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 504 KB Ok! 580 queries used.
2 Correct 47 ms 504 KB Ok! 865 queries used.
3 Correct 43 ms 492 KB Ok! 824 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 468 KB Ok! 1532 queries used.
2 Correct 187 ms 520 KB Ok! 2163 queries used.
3 Correct 155 ms 540 KB Ok! 1754 queries used.
4 Correct 127 ms 528 KB Ok! 1744 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 125 ms 524 KB Ok! 1684 queries used.
2 Correct 118 ms 524 KB Ok! 1601 queries used.
3 Correct 169 ms 512 KB Ok! 1887 queries used.
4 Correct 114 ms 536 KB Ok! 1617 queries used.

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Incorrect 144 ms 524 KB Too many queries! 1956 out of 1775
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 156 ms 468 KB Too many queries! 1942 out of 1625
2 Halted 0 ms 0 KB -