oj.uz

답안 #399797

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
399797 2021-05-06T16:08:16 Z my99n 원 고르기 (APIO18_circle_selection) C++14
0 / 100
 538 ms 36472 KB 
#include<bits/stdc++.h>
using namespace std;
#define x first
#define y second
typedef pair<long long,long long> point;

struct A {
  long long x, y, r;
  int i;
  bool operator < (const A & o) const {
    if (x == o.x) return i < o.i;
    return x < o.x;
  }
} cir[300100];

set<A> s;

bool compare (A & a, A & b) {
  if (a.r == b.r) return a.i < b.i;
  return a.r > b.r;
}

int ans[300100];

long long dis (point i, point j) {
  long long temp = ((i.x-j.x) * (i.x-j.x)) + ((i.y-j.y) * (i.y-j.y));
  return temp;
}

bool intersect (A i, A j) {
  // cerr << dis({i.x, i.y}, {j.x, j.y}) << ' ' << (i.r+j.r) << endl;
  return (dis({i.x, i.y}, {j.x, j.y}) <= (i.r+j.r)*(i.r+j.r));
}

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n; cin >> n;
  for (int i = 1; i <= n; i++) {
    long long x, y, r; cin >> x >> y >> r;
    cir[i] = {x, y, r, i};
    s.insert({x, y, r, i});
  }
  sort(cir+1, cir+1+n, compare);

  // cerr << "here" << endl;

  // for (int i = 1; i <= n; i++) {
  //   auto a = s.lower_bound(cir[i]);
  //   assert(a->i == cir[i].i);
  // }

  for (int i = 1; i <= n; i++) {
    int ind = cir[i].i;
    if (ans[ind]) continue;
    auto a = s.lower_bound(cir[i]);
    assert(a->i == cir[i].i);
    // cerr << a->i << endl;
    if (a != s.begin()) {
      auto x = prev(a);
      // cerr << "? " << x->i << endl;
      while (x != s.begin()) {
        if (!intersect(*x, cir[i])) break;
        ans[x->i] = ind;
        auto temp = x--;
        s.erase(temp);
      }
      if (x == s.begin() and intersect(*x, cir[i])) {
        ans[x->i] = ind;
        auto temp = x;
        s.erase(temp);
      }
    }
    auto x = a;
    while (x != s.end()) {
      if (!intersect(*x, cir[i])) break;
      ans[x->i] = ind;
      auto temp = x++;
      s.erase(temp);
    }
  }

  for (int i = 1; i <= n; i++) {
    cout << ans[i] << ' ';
  } cout << endl;
  return 0;
}
/*
11 
9 9 2
13 2 1
11 8 2
3 3 2
3 12 1
12 14 1
9 8 5
2 8 2
5 2 1
14 4 2
14 14 1
*/

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Incorrect 1 ms 332 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 403 ms 36472 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 538 ms 36404 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Incorrect 1 ms 332 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Incorrect 1 ms 332 KB Output isn't correct
9 Halted 0 ms 0 KB -