oj.uz

Submission #554285

# Submission time Handle Problem Language Result Execution time Memory
554285 2022-04-28T06:31:06 Z Soumya1 Park (BOI16_park) C++17
100 / 100
 507 ms 25468 KB 
#include <bits/stdc++.h>
#ifdef __LOCAL__
#include <debug_local.h>
#endif
using namespace std;
using ll = long long;
const int mxN = 2e3 + 5;
int par[mxN];
int timer[4][4];
int find(int u) {
  return par[u] = (u == par[u] ? u : find(par[u]));
}
bool unite(int u, int v) {
  u = find(u);
  v = find(v);
  if (u == v) return false;
  par[u] = v;
  return true;
}
ll sq(int x) { return 1LL * x * x; }
int distance(int x1, int y1, int x2, int y2, int r1, int r2) {
  int d = sqrt(sq(x1 - x2) + sq(y1 - y2));
  return d - r1 - r2;
}
void testCase() {
  int n, m, w, h;
  cin >> n >> m >> w >> h;
  vector<array<int, 3>> points(n);
  vector<tuple<int, int, int>> edges;
  auto add = [&](int i, int j, int d) {
    edges.push_back({d, i, j});
  };
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < 3; j++) cin >> points[i][j];
    for (int j = 0; j < i; j++) {
      add(j + 4, i + 4, distance(points[i][0], points[i][1], points[j][0], points[j][1], points[i][2], points[j][2]));
    }
    add(0, i + 4, distance(points[i][0], points[i][1], points[i][0], h, points[i][2], 0));
    add(1, i + 4, distance(points[i][0], points[i][1], points[i][0], 0, points[i][2], 0));
    add(2, i + 4, distance(points[i][0], points[i][1], 0, points[i][1], points[i][2], 0));
    add(3, i + 4, distance(points[i][0], points[i][1], w, points[i][1], points[i][2], 0));
  }
  for (int i = 0; i <= n + 4; i++) par[i] = i;
  for (int i = 0; i < 4; i++) {
    for (int j = 0; j < 4; j++) timer[i][j] = 1e9;
  }
  sort(edges.begin(), edges.end());
  for (auto [w, u, v] : edges) {
    unite(u, v);
    for (int i = 0; i < 4; i++) {
      for (int j = 0; j < 4; j++) {
        if (find(i) == find(j)) timer[i][j] = min(timer[i][j], w);
      }
    }
  }
  while (m--) {
    int r, e;
    cin >> r >> e;
    r *= 2;
    e--;
    for (int i = 0; i < 4; i++) {
      if (i == e) {
        cout << i + 1;
        continue;
      }
      int dd = 1e9;
      int a = min(i, e), b = max(i, e);
      if (a == 0 && b == 1) {
        dd = min({timer[0][1], timer[1][2], timer[1][3]});
      } else if (a == 0 && b == 2) {
        dd = min({timer[0][1], timer[2][3], timer[1][2], timer[0][3]});
      } else if (a == 0 && b == 3) {
        dd = min({timer[2][3], timer[2][0], timer[2][1]});
      } else if (a == 1 && b == 2) {
        dd = min({timer[2][3], timer[3][0], timer[3][1]});
      } else if (a == 1 && b == 3) {
        dd = min({timer[0][1], timer[2][3], timer[0][2], timer[1][3]});
      } else if (a == 2 && b == 3) {
        dd = min({timer[0][1], timer[0][2], timer[0][3]});
      }
      if (dd >= r) cout << i + 1;
    }
    cout << "\n";
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  testCase();
  return 0;
}

Subtask #1
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 459 ms 25144 KB Output is correct
2 Correct 456 ms 25148 KB Output is correct
3 Correct 467 ms 25148 KB Output is correct
4 Correct 457 ms 25148 KB Output is correct
5 Correct 462 ms 25084 KB Output is correct
6 Correct 454 ms 25148 KB Output is correct
7 Correct 359 ms 25152 KB Output is correct
8 Correct 365 ms 25156 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 2056 KB Output is correct
2 Correct 36 ms 2048 KB Output is correct
3 Correct 43 ms 1916 KB Output is correct
4 Correct 36 ms 1988 KB Output is correct
5 Correct 37 ms 2108 KB Output is correct
6 Correct 37 ms 2060 KB Output is correct
7 Correct 30 ms 1712 KB Output is correct
8 Correct 29 ms 1712 KB Output is correct

Subtask #3
42.0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 459 ms 25144 KB Output is correct
2 Correct 456 ms 25148 KB Output is correct
3 Correct 467 ms 25148 KB Output is correct
4 Correct 457 ms 25148 KB Output is correct
5 Correct 462 ms 25084 KB Output is correct
6 Correct 454 ms 25148 KB Output is correct
7 Correct 359 ms 25152 KB Output is correct
8 Correct 365 ms 25156 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 41 ms 2056 KB Output is correct
12 Correct 36 ms 2048 KB Output is correct
13 Correct 43 ms 1916 KB Output is correct
14 Correct 36 ms 1988 KB Output is correct
15 Correct 37 ms 2108 KB Output is correct
16 Correct 37 ms 2060 KB Output is correct
17 Correct 30 ms 1712 KB Output is correct
18 Correct 29 ms 1712 KB Output is correct
19 Correct 496 ms 25348 KB Output is correct
20 Correct 494 ms 25392 KB Output is correct
21 Correct 507 ms 25396 KB Output is correct
22 Correct 501 ms 25312 KB Output is correct
23 Correct 492 ms 25304 KB Output is correct
24 Correct 393 ms 25468 KB Output is correct