oj.uz

Submission #116681

# Submission time Handle Problem Language Result Execution time Memory
116681 2019-06-13T14:20:16 Z IOrtroiii ICC (CEOI16_icc) C++14
100 / 100
 157 ms 632 KB 
#include <bits/stdc++.h>
#include "icc.h"
using namespace std;

const int N = 105;

int qa[N], qb[N];

int query(vector<int> a, vector<int> b) {
   int sza = a.size(), szb = b.size();
   for (int i = 0; i < sza; ++i) {
      qa[i] = a[i];
   }
   for (int i = 0; i < szb; ++i) {
      qb[i] = b[i];
   }
   return query(sza, szb, qa, qb);
}

int fnd(vector<int> from, vector<int> to) {
   int l = 0, r = from.size() - 1;
   while (l < r) {
      int md = (l + r) >> 1;
      if (query(vector<int>(from.begin(), from.begin() + md + 1), to)) {
         r = md;
      } else {
         l = md + 1;
      }
   }
   return from[l];
}

int p[N];
vector<int> comp[N];

int getp(int u) {
   if (p[u] == u) {
      return u;
   } else {
      return p[u] = getp(p[u]);
   }
}

void mrg(int u, int v) {
   u = getp(u), v = getp(v);
   if (comp[u].size() < comp[v].size()) {
      swap(u, v);
   }
   p[v] = u;
   for (int w : comp[v]) {
      comp[u].push_back(w);
   }
}

void modify(vector<int> l, vector<int> r) {
   int u = fnd(l, r);
   int v = fnd(r, l);
   mrg(u, v);
   setRoad(u, v);
}

int n;

void solve() {
   vector<int> roots;
   for (int i = 1; i <= n; ++i) {
      if (p[i] == i) {
         roots.push_back(i);
      }
   }
   shuffle(roots.begin(), roots.end(), mt19937(04042001));
   int sz = roots.size();
   for (int i = 0; (1 << i) < sz; ++i) {
      vector<int> l, r;
      for (int j = 0; j < sz; ++j) {
         if (j & (1 << i)) {
            for (int v : comp[roots[j]]) {
               l.push_back(v);
            }
         } else {
            for (int v : comp[roots[j]]) {
               r.push_back(v);
            }
         }
      }
      if (query(l, r)) {
         modify(l, r);
         return;
      }
   }
}

void run(int n) {
   ::n = n;
   for (int i = 1; i <= n; ++i) {
      p[i] = i;
      comp[i].push_back(i);
   }
   for (int i = 0; i < n - 1; ++i) {
      solve();
   }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 512 KB Ok! 99 queries used.
2 Correct 7 ms 512 KB Ok! 94 queries used.

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 568 KB Ok! 518 queries used.
2 Correct 45 ms 512 KB Ok! 651 queries used.
3 Correct 45 ms 568 KB Ok! 661 queries used.

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 560 KB Ok! 1390 queries used.
2 Correct 155 ms 568 KB Ok! 1618 queries used.
3 Correct 140 ms 512 KB Ok! 1608 queries used.
4 Correct 134 ms 568 KB Ok! 1475 queries used.

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 568 KB Ok! 1501 queries used.
2 Correct 134 ms 564 KB Ok! 1460 queries used.
3 Correct 153 ms 512 KB Ok! 1588 queries used.
4 Correct 131 ms 512 KB Ok! 1470 queries used.

Subtask #5
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 512 KB Ok! 1595 queries used.
2 Correct 149 ms 512 KB Ok! 1573 queries used.
3 Correct 157 ms 512 KB Ok! 1616 queries used.
4 Correct 139 ms 604 KB Ok! 1572 queries used.
5 Correct 129 ms 512 KB Ok! 1454 queries used.
6 Correct 133 ms 632 KB Ok! 1529 queries used.

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 512 KB Ok! 1600 queries used.
2 Correct 142 ms 568 KB Ok! 1609 queries used.