oj.uz

Submission #253860

# Submission time Handle Problem Language Result Execution time Memory
253860 2020-07-28T23:43:13 Z EntityIT Circle selection (APIO18_circle_selection) C++14
87 / 100
 3000 ms 60428 KB 
#include <bits/stdc++.h>
using namespace std;

#define ALL(x) (x).begin(), (x).end()
#define SZ(x) static_cast<int>((x).size())

template<class T, size_t D>
struct vec : vector<vec<T, D - 1>> {
  template<class... Args>
  vec(size_t n = 0, Args... args)
      : vector<vec<T, D - 1>>(n, vec<T, D - 1>(args...)) {}
};
template<class T>
struct vec<T, 1> : vector<T> {
  template<class... Args>
  vec(Args... args)
      : vector<T>(args...) {}
};

template<class T>
inline bool Minimize(T& a, const T& b) { return a > b ? a = b, true : false; }
template<class T>
inline bool Maximize(T& a, const T& b) { return a < b ? a = b, true : false; }
inline int Next(int i, int n) { return i == n - 1 ? 0 : i + 1; }
inline int Prev(int i, int n) { return !i ? n - 1 : i - 1; }

mt19937 rng(static_cast<uint32_t>(chrono::steady_clock::now().time_since_epoch().count()));

struct Circle {
  int x, y, r;
  Circle(int t_x = 0, int t_y = 0, int t_r = 0)
      : x(t_x),
        y(t_y),
        r(t_r) {}

  bool CheckIntersection(const Circle& o) const {
    return static_cast<int64_t>(x - o.x) * (x - o.x) + static_cast<int64_t>(y - o.y) * (y - o.y) <= static_cast<int64_t>(r + o.r) * (r + o.r);
  }
};

int main() {
  ios_base::sync_with_stdio(0); cin.tie(0);

  int n_circles; cin >> n_circles;
  vec<Circle, 1> circles(n_circles);
  int min_x, min_y;
  min_x = min_y = numeric_limits<int>::max();
  for (auto& circle : circles) {
    cin >> circle.x >> circle.y >> circle.r;
    Minimize(min_x, circle.x);
    Minimize(min_y, circle.y);
  }
  for (auto& circle : circles) {
    circle.x -= min_x;
    circle.y -= min_y;
  }

  vec<int, 1> ord_circles(n_circles); iota(ALL(ord_circles), 0);
  sort(ALL(ord_circles), [&](int i, int j) {
    return circles[i].r != circles[j].r ? circles[i].r > circles[j].r : i < j;
  });

  int scaler = 31;
  vec<pair<int, int>, 2> members_groups(1);
  for (int i = 0; i < n_circles; ++i) {
    members_groups[0].emplace_back(circles[i].y, i);
  }
  sort(ALL(members_groups[0]));

  vec<char, 1> deleted(n_circles);
  vec<int, 1> answers(n_circles);
  for (auto& idx_circle : ord_circles) {
    if (!deleted[idx_circle]) {
      deleted[idx_circle] = true;
      answers[idx_circle] = idx_circle;

      while (scaler && circles[idx_circle].r <= (1 << (scaler - 1))) {
        --scaler;

        vec<pair<int, int>, 2> next_members_groups(SZ(members_groups) << 1);
        int i = 0;
        for (auto& members : members_groups) {
          for (auto& member : members) {
            if (deleted[member.second]) {
              continue;
            }
            next_members_groups[i + ((circles[member.second].x >> scaler) & 1)].emplace_back(member);
          }
          i += 2;
        }
        next_members_groups.erase(remove_if(ALL(next_members_groups), [&](const vec<pair<int, int>, 1>& x) { return !SZ(x); }), next_members_groups.end());
        members_groups.swap(next_members_groups);
      }

      for (auto it_members_groups = lower_bound(ALL(members_groups), (circles[idx_circle].x >> scaler) - 2, [&](vec<pair<int, int>, 1> i, int j) { return (circles[i[0].second].x >> scaler) < j; }); it_members_groups != members_groups.end() && (circles[(*it_members_groups)[0].second].x >> scaler) <= (circles[idx_circle].x >> scaler) + 2; ++it_members_groups) {
        for (auto it_members = lower_bound(ALL(*it_members_groups), (circles[idx_circle].y >> scaler) - 2, [&](pair<int, int> i, int j) { return (i.first >> scaler) < j; });
        it_members != it_members_groups->end() && (it_members->first >> scaler) <= (circles[idx_circle].y >> scaler) + 2; ++it_members) {
          if (!deleted[it_members->second] && circles[idx_circle].CheckIntersection(circles[it_members->second])) {
            deleted[it_members->second] = true;
            answers[it_members->second] = idx_circle;
          }
        }
      }
    }
  }

  for (auto& answer : answers) {
    cout << answer + 1 << ' ';
  }
  cout << '\n';

  return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 4 ms 768 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 4 ms 768 KB Output is correct
22 Correct 9 ms 1024 KB Output is correct
23 Correct 9 ms 812 KB Output is correct
24 Correct 9 ms 1148 KB Output is correct
25 Correct 10 ms 1328 KB Output is correct
26 Correct 11 ms 1244 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 206 ms 21736 KB Output is correct
2 Correct 206 ms 21736 KB Output is correct
3 Correct 209 ms 22520 KB Output is correct
4 Correct 204 ms 21168 KB Output is correct
5 Correct 394 ms 20028 KB Output is correct
6 Correct 610 ms 29816 KB Output is correct
7 Correct 359 ms 20752 KB Output is correct
8 Correct 389 ms 21752 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 221 ms 9464 KB Output is correct
3 Correct 856 ms 28080 KB Output is correct
4 Correct 937 ms 28208 KB Output is correct
5 Correct 747 ms 23020 KB Output is correct
6 Correct 308 ms 13304 KB Output is correct
7 Correct 148 ms 7784 KB Output is correct
8 Correct 28 ms 2412 KB Output is correct
9 Correct 979 ms 25884 KB Output is correct
10 Correct 803 ms 23984 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1105 ms 26104 KB Output is correct
2 Correct 1644 ms 60428 KB Output is correct
3 Correct 433 ms 23524 KB Output is correct
4 Correct 1238 ms 49732 KB Output is correct
5 Correct 1305 ms 56068 KB Output is correct
6 Correct 373 ms 24436 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 4 ms 768 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 4 ms 768 KB Output is correct
22 Correct 9 ms 1024 KB Output is correct
23 Correct 9 ms 812 KB Output is correct
24 Correct 9 ms 1148 KB Output is correct
25 Correct 10 ms 1328 KB Output is correct
26 Correct 11 ms 1244 KB Output is correct
27 Correct 8 ms 1152 KB Output is correct
28 Correct 8 ms 1276 KB Output is correct
29 Correct 8 ms 1276 KB Output is correct
30 Correct 26 ms 1288 KB Output is correct
31 Correct 25 ms 1752 KB Output is correct
32 Correct 19 ms 1712 KB Output is correct
33 Correct 77 ms 7792 KB Output is correct
34 Correct 80 ms 7920 KB Output is correct
35 Correct 83 ms 7904 KB Output is correct
36 Correct 251 ms 12376 KB Output is correct
37 Correct 214 ms 11972 KB Output is correct
38 Correct 220 ms 11212 KB Output is correct
39 Correct 279 ms 7492 KB Output is correct
40 Correct 282 ms 7456 KB Output is correct
41 Correct 279 ms 7280 KB Output is correct
42 Correct 190 ms 7448 KB Output is correct
43 Correct 286 ms 19488 KB Output is correct
44 Correct 284 ms 19540 KB Output is correct
45 Correct 273 ms 19512 KB Output is correct
46 Correct 289 ms 19656 KB Output is correct
47 Correct 313 ms 19500 KB Output is correct
48 Correct 294 ms 19536 KB Output is correct
49 Correct 325 ms 19492 KB Output is correct
50 Correct 311 ms 19516 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 4 ms 768 KB Output is correct
20 Correct 6 ms 768 KB Output is correct
21 Correct 4 ms 768 KB Output is correct
22 Correct 9 ms 1024 KB Output is correct
23 Correct 9 ms 812 KB Output is correct
24 Correct 9 ms 1148 KB Output is correct
25 Correct 10 ms 1328 KB Output is correct
26 Correct 11 ms 1244 KB Output is correct
27 Correct 206 ms 21736 KB Output is correct
28 Correct 206 ms 21736 KB Output is correct
29 Correct 209 ms 22520 KB Output is correct
30 Correct 204 ms 21168 KB Output is correct
31 Correct 394 ms 20028 KB Output is correct
32 Correct 610 ms 29816 KB Output is correct
33 Correct 359 ms 20752 KB Output is correct
34 Correct 389 ms 21752 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 221 ms 9464 KB Output is correct
37 Correct 856 ms 28080 KB Output is correct
38 Correct 937 ms 28208 KB Output is correct
39 Correct 747 ms 23020 KB Output is correct
40 Correct 308 ms 13304 KB Output is correct
41 Correct 148 ms 7784 KB Output is correct
42 Correct 28 ms 2412 KB Output is correct
43 Correct 979 ms 25884 KB Output is correct
44 Correct 803 ms 23984 KB Output is correct
45 Correct 1105 ms 26104 KB Output is correct
46 Correct 1644 ms 60428 KB Output is correct
47 Correct 433 ms 23524 KB Output is correct
48 Correct 1238 ms 49732 KB Output is correct
49 Correct 1305 ms 56068 KB Output is correct
50 Correct 373 ms 24436 KB Output is correct
51 Correct 8 ms 1152 KB Output is correct
52 Correct 8 ms 1276 KB Output is correct
53 Correct 8 ms 1276 KB Output is correct
54 Correct 26 ms 1288 KB Output is correct
55 Correct 25 ms 1752 KB Output is correct
56 Correct 19 ms 1712 KB Output is correct
57 Correct 77 ms 7792 KB Output is correct
58 Correct 80 ms 7920 KB Output is correct
59 Correct 83 ms 7904 KB Output is correct
60 Correct 251 ms 12376 KB Output is correct
61 Correct 214 ms 11972 KB Output is correct
62 Correct 220 ms 11212 KB Output is correct
63 Correct 279 ms 7492 KB Output is correct
64 Correct 282 ms 7456 KB Output is correct
65 Correct 279 ms 7280 KB Output is correct
66 Correct 190 ms 7448 KB Output is correct
67 Correct 286 ms 19488 KB Output is correct
68 Correct 284 ms 19540 KB Output is correct
69 Correct 273 ms 19512 KB Output is correct
70 Correct 289 ms 19656 KB Output is correct
71 Correct 313 ms 19500 KB Output is correct
72 Correct 294 ms 19536 KB Output is correct
73 Correct 325 ms 19492 KB Output is correct
74 Correct 311 ms 19516 KB Output is correct
75 Correct 290 ms 21260 KB Output is correct
76 Correct 328 ms 21556 KB Output is correct
77 Correct 280 ms 23800 KB Output is correct
78 Correct 246 ms 21348 KB Output is correct
79 Correct 362 ms 21344 KB Output is correct
80 Correct 272 ms 21288 KB Output is correct
81 Correct 1010 ms 24728 KB Output is correct
82 Correct 895 ms 30512 KB Output is correct
83 Correct 897 ms 29532 KB Output is correct
84 Correct 890 ms 23292 KB Output is correct
85 Correct 976 ms 27448 KB Output is correct
86 Correct 996 ms 31408 KB Output is correct
87 Correct 1306 ms 22444 KB Output is correct
88 Correct 1144 ms 22880 KB Output is correct
89 Correct 1161 ms 22776 KB Output is correct
90 Correct 1226 ms 25016 KB Output is correct
91 Correct 1256 ms 22796 KB Output is correct
92 Correct 1206 ms 22868 KB Output is correct
93 Correct 1376 ms 58424 KB Output is correct
94 Execution timed out 3098 ms 21696 KB Time limit exceeded
95 Halted 0 ms 0 KB -