oj.uz

답안 #966648

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
966648 2024-04-20T07:39:04 Z Soumya1 원 고르기 (APIO18_circle_selection) C++17
37 / 100
 1059 ms 142268 KB 
#include <bits/stdc++.h>
using namespace std;
const int mxN = 3e5 + 5;
int x[mxN], y[mxN], r[mxN], pos[mxN], ans[mxN];
set<pair<int, int>> st[4 * mxN];
void update(int x, int lx, int rx, int l, int r, int i) {
  if (l > rx || lx > r) return;
  if (l <= lx && r >= rx) {
    st[x].insert({y[i], i});
    return;
  }
  int mx = (lx + rx) >> 1;
  update(x << 1, lx, mx, l, r, i);
  update(x << 1 | 1, mx + 1, rx, l, r, i);
}
bool intersect(int a, int b) {
  return 1LL * (x[a] - x[b]) * (x[a] - x[b]) + 1LL * (y[a] - y[b]) * (y[a] - y[b]) <= 1LL * (r[a] + r[b]) * (r[a] + r[b]);
}
void update(int a, int b) {
  if (!intersect(a, b)) return;
  if (pos[b] < pos[ans[a]]) ans[a] = b;
}
void check(int x, int i) {
  auto it = lower_bound(st[x].begin(), st[x].end(), pair<int, int> {y[i], -2e9});
  int cnt = 5;
  while (it != st[x].end()) {
    update(i, (*it).second);
    cnt--;
    it++;
    if (!cnt) break;
  }
  it = lower_bound(st[x].begin(), st[x].end(), pair<int, int> {y[i], -2e9});
  if (it == st[x].begin()) return;
  --it;
  cnt = 5;
  while (true) {
    update(i, (*it).second);
    if (it == st[x].begin()) break;
    cnt--;
    it--;
    if (!cnt) break;
  }
}
void query(int x, int lx, int rx, int p, int i) {
  check(x, i);
  if (lx == rx) return;
  int mx = (lx + rx) >> 1;
  if (p <= mx) query(x << 1, lx, mx, p, i);
  else query(x << 1 | 1, mx + 1, rx, p, i);
}
void testCase() {
  int n;
  cin >> n;
  vector<int> all;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i] >> r[i];
    all.push_back(x[i] - r[i]);
    all.push_back(x[i] + r[i]); 
  }
  vector<int> ord(n);
  iota(ord.begin(), ord.end(), 0);
  sort(ord.begin(), ord.end(), [&](int i, int j) {
    if (r[i] != r[j]) return r[i] > r[j];
    return i < j;
  });
  for (int i = 0; i < n; i++) {
    pos[ord[i]] = i;
  }
  sort(all.begin(), all.end());
  all.erase(unique(all.begin(), all.end()), all.end());
  int N = all.size();
  for (int i = 0; i < n; i++) ans[i] = i;
  for (int i = 0; i < n; i++) {
    int ii = ord[i];
    int L = lower_bound(all.begin(), all.end(), x[ii] - r[ii]) - all.begin() + 1;
    int R = lower_bound(all.begin(), all.end(), x[ii] + r[ii]) - all.begin() + 1;
    query(1, 1, N, L, ii);
    query(1, 1, N, R, ii);
    if (ans[ii] == ii) {
      update(1, 1, N, L, R, ii);
    }
  }
  for (int i = 0; i < n; i++) cout << ans[i] + 1 << " ";
  cout << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  testCase();
  return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 62044 KB Output is correct
2 Correct 13 ms 62044 KB Output is correct
3 Correct 14 ms 62300 KB Output is correct
4 Correct 13 ms 62196 KB Output is correct
5 Correct 12 ms 62044 KB Output is correct
6 Correct 13 ms 62044 KB Output is correct
7 Correct 12 ms 62044 KB Output is correct
8 Correct 13 ms 62192 KB Output is correct
9 Correct 13 ms 62044 KB Output is correct
10 Correct 12 ms 62188 KB Output is correct
11 Correct 13 ms 62044 KB Output is correct
12 Correct 13 ms 62044 KB Output is correct
13 Correct 12 ms 62092 KB Output is correct
14 Correct 13 ms 62044 KB Output is correct
15 Correct 13 ms 62040 KB Output is correct
16 Correct 14 ms 62044 KB Output is correct
17 Correct 14 ms 62044 KB Output is correct
18 Correct 14 ms 62044 KB Output is correct
19 Correct 18 ms 62300 KB Output is correct
20 Correct 17 ms 62300 KB Output is correct
21 Correct 19 ms 62456 KB Output is correct
22 Correct 21 ms 62840 KB Output is correct
23 Correct 30 ms 63588 KB Output is correct
24 Correct 20 ms 62812 KB Output is correct
25 Correct 19 ms 62556 KB Output is correct
26 Correct 23 ms 63180 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 197 ms 138948 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 62044 KB Output is correct
2 Correct 500 ms 88240 KB Output is correct
3 Runtime error 204 ms 142268 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 177 ms 141136 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 62044 KB Output is correct
2 Correct 13 ms 62044 KB Output is correct
3 Correct 14 ms 62300 KB Output is correct
4 Correct 13 ms 62196 KB Output is correct
5 Correct 12 ms 62044 KB Output is correct
6 Correct 13 ms 62044 KB Output is correct
7 Correct 12 ms 62044 KB Output is correct
8 Correct 13 ms 62192 KB Output is correct
9 Correct 13 ms 62044 KB Output is correct
10 Correct 12 ms 62188 KB Output is correct
11 Correct 13 ms 62044 KB Output is correct
12 Correct 13 ms 62044 KB Output is correct
13 Correct 12 ms 62092 KB Output is correct
14 Correct 13 ms 62044 KB Output is correct
15 Correct 13 ms 62040 KB Output is correct
16 Correct 14 ms 62044 KB Output is correct
17 Correct 14 ms 62044 KB Output is correct
18 Correct 14 ms 62044 KB Output is correct
19 Correct 18 ms 62300 KB Output is correct
20 Correct 17 ms 62300 KB Output is correct
21 Correct 19 ms 62456 KB Output is correct
22 Correct 21 ms 62840 KB Output is correct
23 Correct 30 ms 63588 KB Output is correct
24 Correct 20 ms 62812 KB Output is correct
25 Correct 19 ms 62556 KB Output is correct
26 Correct 23 ms 63180 KB Output is correct
27 Correct 26 ms 62552 KB Output is correct
28 Correct 30 ms 62556 KB Output is correct
29 Correct 25 ms 62556 KB Output is correct
30 Correct 33 ms 64340 KB Output is correct
31 Correct 28 ms 63576 KB Output is correct
32 Correct 28 ms 63572 KB Output is correct
33 Correct 158 ms 67000 KB Output is correct
34 Correct 168 ms 67024 KB Output is correct
35 Correct 178 ms 66764 KB Output is correct
36 Correct 250 ms 79568 KB Output is correct
37 Correct 272 ms 79984 KB Output is correct
38 Correct 312 ms 82252 KB Output is correct
39 Correct 1051 ms 67892 KB Output is correct
40 Correct 1059 ms 68104 KB Output is correct
41 Correct 1053 ms 68012 KB Output is correct
42 Correct 721 ms 68332 KB Output is correct
43 Correct 193 ms 73956 KB Output is correct
44 Correct 187 ms 73836 KB Output is correct
45 Correct 183 ms 73932 KB Output is correct
46 Correct 190 ms 74044 KB Output is correct
47 Correct 187 ms 73672 KB Output is correct
48 Correct 178 ms 73676 KB Output is correct
49 Correct 192 ms 73864 KB Output is correct
50 Correct 198 ms 73704 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 62044 KB Output is correct
2 Correct 13 ms 62044 KB Output is correct
3 Correct 14 ms 62300 KB Output is correct
4 Correct 13 ms 62196 KB Output is correct
5 Correct 12 ms 62044 KB Output is correct
6 Correct 13 ms 62044 KB Output is correct
7 Correct 12 ms 62044 KB Output is correct
8 Correct 13 ms 62192 KB Output is correct
9 Correct 13 ms 62044 KB Output is correct
10 Correct 12 ms 62188 KB Output is correct
11 Correct 13 ms 62044 KB Output is correct
12 Correct 13 ms 62044 KB Output is correct
13 Correct 12 ms 62092 KB Output is correct
14 Correct 13 ms 62044 KB Output is correct
15 Correct 13 ms 62040 KB Output is correct
16 Correct 14 ms 62044 KB Output is correct
17 Correct 14 ms 62044 KB Output is correct
18 Correct 14 ms 62044 KB Output is correct
19 Correct 18 ms 62300 KB Output is correct
20 Correct 17 ms 62300 KB Output is correct
21 Correct 19 ms 62456 KB Output is correct
22 Correct 21 ms 62840 KB Output is correct
23 Correct 30 ms 63588 KB Output is correct
24 Correct 20 ms 62812 KB Output is correct
25 Correct 19 ms 62556 KB Output is correct
26 Correct 23 ms 63180 KB Output is correct
27 Runtime error 197 ms 138948 KB Execution killed with signal 11
28 Halted 0 ms 0 KB -