oj.uz

Submission #1086394

# Submission time Handle Problem Language Result Execution time Memory
1086394 2024-09-10T12:34:53 Z juicy ICC (CEOI16_icc) C++17
90 / 100
 84 ms 648 KB 
#include "icc.h"

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int N = 105;

int pr[N];
vector<int> ver[N];

int qry(vector<int> a, vector<int> b) {
  return query(a.size(), b.size(), &a[0], &b[0]);
}

int find(int u) {
  return pr[u] == u ? u : pr[u] = find(pr[u]); 
}

int find(vector<int> a, vector<int> b) {
  int l = 0, r = a.size() - 1, res = -1;
  while (l <= r) {
    int m = (l + r) / 2;
    if (qry(vector(a.begin(), a.begin() + m + 1), b)) {
      res = a[m];
      r = m - 1;
    } else {
      l = m + 1;
    }
  }
  return res;
}

void run(int n) {
  iota(pr, pr + n, 0);
  for (int i = 0; i < n; ++i) {
    ver[i].push_back(i + 1);
  }
  for (int e = 0; e < n - 1; ++e) {
    vector<int> root;
    for (int i = 0; i < n; ++i) {
      if (pr[i] == i) {
        root.push_back(i);
      }
    }
    shuffle(root.begin(), root.end(), rng);
    int m = root.size();
    vector<int> a, b;
    for (int i = 0; (1 << i) < m; ++i) {
      vector<int>().swap(a);
      vector<int>().swap(b);
      for (int j = 0; j < m; ++j) {
        auto &v = j >> i & 1 ? a : b;
        v.insert(v.end(), ver[root[j]].begin(), ver[root[j]].end());
      }
      if (qry(a, b)) {
        break;
      }
    }
    int u = find(a, b), v = find(b, a);
    setRoad(u, v);
    --u, --v;
    for (int x : ver[pr[v]]) {
      pr[x - 1] = pr[u];
      ver[pr[u]].push_back(x);
    }
  }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 600 KB Ok! 102 queries used.
2 Correct 4 ms 600 KB Ok! 100 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 604 KB Ok! 537 queries used.
2 Correct 27 ms 640 KB Ok! 692 queries used.
3 Correct 26 ms 604 KB Ok! 680 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 600 KB Ok! 1434 queries used.
2 Correct 84 ms 604 KB Ok! 1691 queries used.
3 Correct 79 ms 604 KB Ok! 1622 queries used.
4 Correct 77 ms 640 KB Ok! 1541 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 604 KB Ok! 1523 queries used.
2 Correct 79 ms 644 KB Ok! 1518 queries used.
3 Correct 80 ms 644 KB Ok! 1641 queries used.
4 Correct 77 ms 604 KB Ok! 1511 queries used.

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 604 KB Ok! 1640 queries used.
2 Correct 81 ms 644 KB Ok! 1673 queries used.
3 Correct 84 ms 640 KB Ok! 1673 queries used.
4 Correct 81 ms 648 KB Ok! 1634 queries used.
5 Correct 77 ms 636 KB Ok! 1483 queries used.
6 Correct 78 ms 644 KB Ok! 1566 queries used.

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 84 ms 600 KB Too many queries! 1664 out of 1625
2 Halted 0 ms 0 KB -