oj.uz

Submission #939583

# Submission time Handle Problem Language Result Execution time Memory
939583 2024-03-06T14:33:31 Z green_gold_dog Circle selection (APIO18_circle_selection) C++17
37 / 100
 3000 ms 489352 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

struct circle {
        ll x, y, r, id;
        circle(ll x = 0, ll y = 0, ll r = 0, ll id = 0): x(x), y(y), r(r), id(id) {}
        bool operator<(const circle c2) const {
                return c2.r < r;
        }
        bool check(circle c2) {
                return square(x - c2.x) + square(y - c2.y) <= square(r + c2.r);
        }
};

struct segment_tree {
        vector<set<pair<ll, ll>>> tree;
        ll size;
        ll can = 20;
        segment_tree(ll n) {
                assert(n <= 1'000'000);
                size = 1;
                while (size < n) {
                        size *= 2;
                }
                tree.resize(size * 2);
        }
        void insert(ll x, ll y, ll id) {
                can = 20;
                insert(1, 0, size, x, y, id);
                //assert(can >= 0);
        }
        void insert(ll v, ll l, ll r, ll x, ll y, ll id) {
                if (x < l || r <= x) {
                        return;
                }
                can--;
                tree[v].insert(make_pair(y, id));
                if (r - l == 1) {
                        return;
                }
                ll mid = (l + r) / 2;
                insert(v * 2, l, mid, x, y, id);
                insert(v * 2 + 1, mid, r, x, y, id);
        }
        void erase(ll x, ll y, ll id) {
                erase(1, 0, size, x, y, id);
        }
        void erase(ll v, ll l, ll r, ll x, ll y, ll id) {
                if (x < l || r <= x) {
                        return;
                }
                tree[v].erase(make_pair(y, id));
                if (r - l == 1) {
                        return;
                }
                ll mid = (l + r) / 2;
                erase(v * 2, l, mid, x, y, id);
                erase(v * 2 + 1, mid, r, x, y, id);
        }
        void get(ll l, ll r, ll nl, ll nr, vector<ll>& ans) {
                get(1, 0, size, l, r + 1, nl, nr, ans);
        }
        void get(ll v, ll l, ll r, ll ql, ll qr, ll nl, ll nr, vector<ll>& ans) {
                if (ql <= l && r <= qr) {
                        auto it = tree[v].lower_bound(make_pair(nl, 0));
                        while (it != tree[v].end() && it->first <= nr) {
                                ans.emplace_back(it->second);
                                it++;
                        }
                        return;
                }
                if (qr <= l || r <= ql) {
                        return;
                }
                ll mid = (l + r) / 2;
                get(v * 2, l, mid, ql, qr, nl, nr, ans);
                get(v * 2 + 1, mid, r, ql, qr, nl, nr, ans);
        }
};

void solve() {
        ll n;
        cin >> n;
        vector<circle> all(n);
        for (ll i = 0; i < n; i++) {
                cin >> all[i].x >> all[i].y >> all[i].r;
                all[i].id = i;
        }
        stable_sort(all.begin(), all.end());
        vector<ll> ans(n, -1);
        set<ll> allx;
        for (ll i = 0; i < n; i++) {
                allx.insert(all[i].x - all[i].r * 2);
                allx.insert(all[i].x);
                allx.insert(all[i].x + all[i].r * 2);
        }
        map<ll, ll> zip;
        ll lst = 0;
        for (auto i : allx) {
                zip[i] = lst;
                lst++;
        }
        segment_tree st(lst);
        for (ll i = 0; i < n; i++) {
                st.insert(zip[all[i].x], all[i].y, i);
        }
        for (ll i = 0; i < n; i++) {
                if (ans[all[i].id] == -1) {
                        vector<ll> na;
                        st.get(zip[all[i].x - all[i].r * 2], zip[all[i].x + all[i].r * 2], all[i].y - all[i].r * 2, all[i].y + all[i].r * 2, na);
                        for (auto j : na) {
                                if (ans[all[j].id] == -1) {
                                        if (all[i].check(all[j])) {
                                                ans[all[j].id] = all[i].id;
                                                st.erase(zip[all[j].x], all[j].y, j);
                                        }
                                }
                        }
                }
        }
        for (auto i : ans) {
                cout << i + 1 << ' ';
        }
        cout << '\n';
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:175:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  175 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
circle_selection.cpp:176:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  176 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 5 ms 1880 KB Output is correct
17 Correct 6 ms 1884 KB Output is correct
18 Correct 4 ms 1884 KB Output is correct
19 Correct 26 ms 8632 KB Output is correct
20 Correct 25 ms 8636 KB Output is correct
21 Correct 27 ms 8600 KB Output is correct
22 Correct 30 ms 8544 KB Output is correct
23 Correct 38 ms 8380 KB Output is correct
24 Correct 35 ms 8376 KB Output is correct
25 Correct 40 ms 8364 KB Output is correct
26 Correct 32 ms 8532 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3067 ms 489352 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2370 ms 212184 KB Output is correct
3 Execution timed out 3070 ms 454224 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3055 ms 469488 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 5 ms 1880 KB Output is correct
17 Correct 6 ms 1884 KB Output is correct
18 Correct 4 ms 1884 KB Output is correct
19 Correct 26 ms 8632 KB Output is correct
20 Correct 25 ms 8636 KB Output is correct
21 Correct 27 ms 8600 KB Output is correct
22 Correct 30 ms 8544 KB Output is correct
23 Correct 38 ms 8380 KB Output is correct
24 Correct 35 ms 8376 KB Output is correct
25 Correct 40 ms 8364 KB Output is correct
26 Correct 32 ms 8532 KB Output is correct
27 Correct 62 ms 17324 KB Output is correct
28 Correct 61 ms 17432 KB Output is correct
29 Correct 72 ms 17684 KB Output is correct
30 Correct 82 ms 17244 KB Output is correct
31 Correct 75 ms 17232 KB Output is correct
32 Correct 73 ms 17072 KB Output is correct
33 Correct 1843 ms 214048 KB Output is correct
34 Correct 1680 ms 214076 KB Output is correct
35 Correct 1801 ms 214156 KB Output is correct
36 Correct 2301 ms 212252 KB Output is correct
37 Correct 2407 ms 212252 KB Output is correct
38 Correct 2403 ms 212268 KB Output is correct
39 Correct 2428 ms 76284 KB Output is correct
40 Correct 2411 ms 76040 KB Output is correct
41 Correct 2169 ms 75716 KB Output is correct
42 Correct 1209 ms 86992 KB Output is correct
43 Correct 1394 ms 212268 KB Output is correct
44 Correct 1368 ms 212252 KB Output is correct
45 Correct 1392 ms 212436 KB Output is correct
46 Correct 1459 ms 212280 KB Output is correct
47 Correct 1418 ms 212336 KB Output is correct
48 Correct 1432 ms 212260 KB Output is correct
49 Correct 1450 ms 212256 KB Output is correct
50 Correct 1402 ms 212396 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 5 ms 1880 KB Output is correct
17 Correct 6 ms 1884 KB Output is correct
18 Correct 4 ms 1884 KB Output is correct
19 Correct 26 ms 8632 KB Output is correct
20 Correct 25 ms 8636 KB Output is correct
21 Correct 27 ms 8600 KB Output is correct
22 Correct 30 ms 8544 KB Output is correct
23 Correct 38 ms 8380 KB Output is correct
24 Correct 35 ms 8376 KB Output is correct
25 Correct 40 ms 8364 KB Output is correct
26 Correct 32 ms 8532 KB Output is correct
27 Execution timed out 3067 ms 489352 KB Time limit exceeded
28 Halted 0 ms 0 KB -