oj.uz

Submission #221626

# Submission time Handle Problem Language Result Execution time Memory
221626 2020-04-10T14:20:48 Z rama_pang ICC (CEOI16_icc) C++14
90 / 100
 168 ms 656 KB 
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;

mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
vector<vector<int>> components;

int Query(vector<int> A, vector<int> B) {
  if (A.empty() || B.empty()) return 0;
  return query(A.size(), B.size(), A.data(), B.data());
}

int QueryComponent(vector<int> A, vector<int> B) {
  vector<int> P, Q;
  for (auto i : A) {
    for (auto j : components[i]) {
      P.emplace_back(j);
    }
  }
  for (auto i : B) {
    for (auto j : components[i]) {
      Q.emplace_back(j);
    }
  }
  return Query(P, Q);
}

void Answer(int A, int B) {
  return setRoad(A, B);
}

int Split(int L, int R, vector<int> &A, vector<int> &B, int depth, bool Check) {
  if (depth == 0) {
    int mid = (L + R) / 2;
    for (int i = L; i <= mid; i++) A.emplace_back(i);
    for (int i = mid + 1; i <= R; i++) B.emplace_back(i);
    return max(mid - L + 1, R - mid);
  }
  int mid = (L + R) / 2;
  if (Check) {
    return max(Split(L, mid, A, B, depth - 1, Check), Split(mid + 1, R, A, B, depth - 1, Check));
  } else {
    vector<int> tA, tB;
    Split(L, mid, tA, tB, depth - 1, true);
    if (QueryComponent(tA, tB)) {
      return Split(L, mid, A, B, depth - 1, Check);
    } else {
      return Split(mid + 1, R, A, B, depth - 1, Check);
    }
  }
}

pair<int, int> BinarySearch(vector<int> A, vector<int> B, bool onComponent) {
  if (A.size() < B.size()) swap(A, B);
  if (A.size() == 1 && B.size() == 1) return {A[0], B[0]};

  int mid = A.size() / 2;
  vector<int> L(begin(A), begin(A) + mid), R(begin(A) + mid, end(A));

  bool res;
  if (onComponent) {
    if (R.empty() || QueryComponent(L, B)) {
      return BinarySearch(L, B, onComponent);
    } else {
      return BinarySearch(R, B, onComponent);
    }
  } else {
    if (R.empty() || Query(L, B)) {
      return BinarySearch(L, B, onComponent);
    } else {
      return BinarySearch(R, B, onComponent);
    }
  }
}

void MergeComponent(int C1, int C2) {
  vector<int> Merged;
  for (auto i : components[C1]) Merged.emplace_back(i);
  for (auto i : components[C2]) Merged.emplace_back(i);
  components[C1].clear();
  components[C2].clear();
  sort(begin(components), end(components), [&](const vector<int> &a, const vector<int> &b) {
    return a.size() > b.size();
  });

  while (components.back().empty()) components.pop_back();
  components.emplace_back(Merged);
}

void run(int N) {
  for (int i = 1; i <= N; i++) {
    components.emplace_back(vector<int>{i});
  }

  for (int i = 1; i < N; i++) {
    vector<int> A, B; // find two components that are connected by new edge
    for (int depth = 0; ; depth++) {
      int sz = Split(0, components.size() - 1, A, B, depth, true);
      if (sz == 1) break;
      int res = QueryComponent(A, B);
      A.clear(), B.clear();
      if (res) {
        Split(0, components.size() - 1, A, B, depth, false);
        break;
      }
    }

    // Binary Search to find edge's endpoint
    auto TwoComp = BinarySearch(A, B, true);
    auto Edge = BinarySearch(components[TwoComp.first], components[TwoComp.second], false);
    Answer(Edge.first, Edge.second);
    MergeComponent(TwoComp.first, TwoComp.second);
  }
}

Compilation message

icc.cpp: In function 'std::pair<int, int> BinarySearch(std::vector<int>, std::vector<int>, bool)':
icc.cpp:60:8: warning: unused variable 'res' [-Wunused-variable]
   bool res;
        ^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 512 KB Ok! 113 queries used.
2 Correct 11 ms 512 KB Ok! 108 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 46 ms 512 KB Ok! 625 queries used.
2 Correct 52 ms 512 KB Ok! 670 queries used.
3 Correct 51 ms 512 KB Ok! 685 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 512 KB Ok! 1564 queries used.
2 Correct 168 ms 512 KB Ok! 1776 queries used.
3 Correct 141 ms 512 KB Ok! 1474 queries used.
4 Correct 139 ms 512 KB Ok! 1497 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 576 KB Ok! 1503 queries used.
2 Correct 138 ms 512 KB Ok! 1472 queries used.
3 Correct 163 ms 580 KB Ok! 1762 queries used.
4 Correct 138 ms 560 KB Ok! 1491 queries used.

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 512 KB Ok! 1716 queries used.
2 Correct 160 ms 512 KB Ok! 1761 queries used.
3 Correct 166 ms 580 KB Ok! 1762 queries used.
4 Correct 140 ms 512 KB Ok! 1561 queries used.
5 Correct 141 ms 512 KB Ok! 1524 queries used.
6 Correct 136 ms 512 KB Ok! 1462 queries used.

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 165 ms 656 KB Too many queries! 1763 out of 1625
2 Halted 0 ms 0 KB -