oj.uz

Submission #964884

# Submission time Handle Problem Language Result Execution time Memory
964884 2024-04-17T16:56:11 Z TAhmed33 Highway Tolls (IOI18_highway) C++17
51 / 100
 131 ms 16312 KB 
#include "highway.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 25;
mt19937 rng (chrono::steady_clock::now().time_since_epoch().count());
int random (int l, int r) {
  return uniform_int_distribution <int> (l, r) (rng);
}
vector <pair <int, int>> adj[MAXN];
vector <int> ett, ett2;
int in[MAXN], out[MAXN], dep[MAXN], tt;
void dfs (int pos, int par) {
  in[pos] = ++tt; 
  for (auto j : adj[pos]) {
    if (j.first == par) continue;
    ett.push_back(j.second);
    dep[j.first] = 1 + dep[pos];
    dfs(j.first, pos);
  }
  out[pos] = tt;
}
void dfs2 (int pos) {
  for (auto j : adj[pos]) {
    if (in[j.first] < in[pos]) continue;
    ett2.push_back(j.second);
    dfs2(j.first);
  }
}
void find_pair (int n, vector <int> u, vector <int> v, int a, int b) {
  for (int i = 0; i + 1 < n; i++) {
    adj[u[i]].push_back({v[i], i});
    adj[v[i]].push_back({u[i], i});
  }
  vector <int> g(n - 1);
  ll U = ask(g);
  dfs(0, -1);
  for (int i = 0; i < n - 1; i++) {
    if (dep[u[i]] > dep[v[i]]) swap(u[i], v[i]);
  }
  int l = 0, r = n - 2, p1 = -1;
  while (l <= r) {
    int mid = (l + r) / 2;
    g.clear(); g.resize(n - 1);
    for (auto &i : g) i = 0;
    for (int j = 0; j <= mid; j++) g[ett[j]] = 1;
    ll V = ask(g);
    if (V != U) {
      r = mid - 1; p1 = mid;
    } else {
      l = mid + 1;
    }
  }
  l = 0, r = n - 2; int p2 = -1;
  while (l <= r) {
    int mid = (l + r) / 2;
    g.clear(); g.resize(n - 1);
    for (auto &i : g) i = 0;
    for (int j = mid; j + 1 < n; j++) g[ett[j]] = 1;
    ll V = ask(g);
    if (V != U) {
      l = mid + 1; p2 = mid;
    } else {
      r = mid - 1;
    }
  }
 // assert(p1 != -1); assert(p2 != -1);
  p1 = ett[p1]; p2 = ett[p2];
  if (in[v[p1]] <= in[v[p2]] && out[v[p2]] <= out[v[p1]]) {
    answer(u[p1], v[p2]);
    return;
  }
  dfs2(v[p1]);
  l = 0, r = (int)ett2.size() - 1; int ans = -1;
  while (l <= r) {
    int mid = (l + r) / 2;
    g.clear(); g.resize(n - 1);
    for (auto &i : g) i = 0;
    for (int i = mid; i < (int)ett2.size(); i++) {
      g[ett2[i]] = 1;
    }
    ll V = ask(g);
    if (V != U) {
      l = mid + 1; ans = mid;
    } else {
      r = mid - 1;
    }
  }
  if (ans == -1) ans = v[p1];
  else ans = v[ett2[ans]];
  answer(ans, v[p2]);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3800 KB Output is correct
2 Correct 1 ms 3792 KB Output is correct
3 Correct 1 ms 3800 KB Output is correct
4 Correct 1 ms 3800 KB Output is correct
5 Correct 1 ms 3792 KB Output is correct
6 Correct 1 ms 3800 KB Output is correct
7 Correct 1 ms 3796 KB Output is correct
8 Correct 1 ms 3800 KB Output is correct
9 Correct 1 ms 3800 KB Output is correct
10 Correct 1 ms 3804 KB Output is correct
11 Correct 2 ms 3796 KB Output is correct
12 Correct 1 ms 3796 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3848 KB Output is correct
2 Correct 16 ms 4500 KB Output is correct
3 Correct 66 ms 9816 KB Output is correct
4 Correct 122 ms 9584 KB Output is correct
5 Correct 124 ms 9812 KB Output is correct
6 Correct 83 ms 9700 KB Output is correct
7 Correct 74 ms 9636 KB Output is correct
8 Correct 92 ms 9572 KB Output is correct
9 Correct 104 ms 9568 KB Output is correct
10 Correct 115 ms 9808 KB Output is correct
11 Correct 94 ms 11160 KB Output is correct
12 Correct 107 ms 11548 KB Output is correct
13 Correct 87 ms 11132 KB Output is correct
14 Correct 96 ms 10904 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 5280 KB Output is correct
2 Correct 21 ms 6668 KB Output is correct
3 Correct 22 ms 8040 KB Output is correct
4 Correct 63 ms 16060 KB Output is correct
5 Correct 106 ms 16264 KB Output is correct
6 Correct 72 ms 16064 KB Output is correct
7 Correct 83 ms 16296 KB Output is correct
8 Correct 73 ms 16312 KB Output is correct
9 Correct 58 ms 16060 KB Output is correct

Subtask #4
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3852 KB Output is correct
2 Correct 11 ms 4552 KB Output is correct
3 Correct 70 ms 8844 KB Output is correct
4 Correct 122 ms 10292 KB Output is correct
5 Correct 131 ms 9820 KB Output is correct
6 Correct 120 ms 9816 KB Output is correct
7 Correct 94 ms 10288 KB Output is correct
8 Correct 88 ms 10044 KB Output is correct
9 Correct 110 ms 9812 KB Output is correct
10 Correct 80 ms 9800 KB Output is correct
11 Correct 108 ms 10344 KB Output is correct
12 Correct 116 ms 12032 KB Output is correct
13 Correct 76 ms 11456 KB Output is correct
14 Correct 127 ms 11980 KB Output is correct
15 Correct 95 ms 10040 KB Output is correct
16 Correct 105 ms 9572 KB Output is correct
17 Correct 92 ms 11504 KB Output is correct
18 Correct 88 ms 10792 KB Output is correct
19 Correct 113 ms 9808 KB Output is correct
20 Correct 80 ms 12580 KB Output is correct
21 Correct 117 ms 10384 KB Output is correct
22 Correct 79 ms 10116 KB Output is correct
23 Correct 91 ms 10116 KB Output is correct
24 Correct 103 ms 11512 KB Output is correct
25 Correct 94 ms 15452 KB Output is correct

Subtask #5
0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 15 ms 4184 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #6
0 / 31.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 4184 KB Incorrect
2 Halted 0 ms 0 KB -