oj.uz

답안 #938881

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938881 2024-03-05T18:08:48 Z green_gold_dog 원 고르기 (APIO18_circle_selection) C++17
7 / 100
 3000 ms 581884 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;
        segment_tree(ll n) {
                size = n;
                tree.resize(size * 4);
        }
        void insert(ll x, ll y, ll id) {
                insert(1, 0, size, x, y, id);
        }
        void insert(ll v, ll l, ll r, ll x, ll y, ll id) {
                if (x < l || r <= x) {
                        return;
                }
                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);
        vector<vector<pair<ll, ll>>> points(n);
        set<ll> allx;
        for (ll i = 0; i < n; i++) {
                points[i].emplace_back(all[i].x - all[i].r, all[i].y - all[i].r);
                points[i].emplace_back(all[i].x - all[i].r, all[i].y + all[i].r);
                points[i].emplace_back(all[i].x + all[i].r, all[i].y - all[i].r);
                points[i].emplace_back(all[i].x + all[i].r, all[i].y + all[i].r);
                allx.insert(all[i].x - all[i].r);
                allx.insert(all[i].x + all[i].r);
        }
        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++) {
                for (auto&[x, y] : points[i]) {
                        x = zip[x];
                        st.insert(x, y, i);
                }
        }
        for (ll i = 0; i < n; i++) {
                if (ans[all[i].id] == -1) {
                        vector<ll> na;
                        st.get(points[i][0].first, points[i][2].first, points[i][0].second, points[i][1].second, na);
                        for (auto j : na) {
                                if (ans[all[j].id] == -1) {
                                        if (all[i].check(all[j])) {
                                                ans[all[j].id] = all[i].id;
                                                for (auto[x, y] : points[j]) {
                                                        st.erase(x, 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:176:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  176 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
circle_selection.cpp:177:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  177 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 756 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 604 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 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 12 ms 3932 KB Output is correct
17 Correct 13 ms 4036 KB Output is correct
18 Correct 12 ms 3932 KB Output is correct
19 Correct 88 ms 21812 KB Output is correct
20 Correct 75 ms 22056 KB Output is correct
21 Correct 96 ms 21584 KB Output is correct
22 Correct 71 ms 15436 KB Output is correct
23 Correct 84 ms 17692 KB Output is correct
24 Correct 80 ms 15200 KB Output is correct
25 Correct 67 ms 14552 KB Output is correct
26 Correct 84 ms 14980 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3034 ms 578000 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Execution timed out 3100 ms 391636 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3120 ms 581884 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 756 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 604 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 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 12 ms 3932 KB Output is correct
17 Correct 13 ms 4036 KB Output is correct
18 Correct 12 ms 3932 KB Output is correct
19 Correct 88 ms 21812 KB Output is correct
20 Correct 75 ms 22056 KB Output is correct
21 Correct 96 ms 21584 KB Output is correct
22 Correct 71 ms 15436 KB Output is correct
23 Correct 84 ms 17692 KB Output is correct
24 Correct 80 ms 15200 KB Output is correct
25 Correct 67 ms 14552 KB Output is correct
26 Correct 84 ms 14980 KB Output is correct
27 Correct 278 ms 45012 KB Output is correct
28 Correct 271 ms 44940 KB Output is correct
29 Correct 315 ms 44824 KB Output is correct
30 Correct 184 ms 34004 KB Output is correct
31 Correct 181 ms 31248 KB Output is correct
32 Correct 176 ms 31276 KB Output is correct
33 Execution timed out 3043 ms 474416 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 464 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 756 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 604 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 604 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 12 ms 3932 KB Output is correct
17 Correct 13 ms 4036 KB Output is correct
18 Correct 12 ms 3932 KB Output is correct
19 Correct 88 ms 21812 KB Output is correct
20 Correct 75 ms 22056 KB Output is correct
21 Correct 96 ms 21584 KB Output is correct
22 Correct 71 ms 15436 KB Output is correct
23 Correct 84 ms 17692 KB Output is correct
24 Correct 80 ms 15200 KB Output is correct
25 Correct 67 ms 14552 KB Output is correct
26 Correct 84 ms 14980 KB Output is correct
27 Execution timed out 3034 ms 578000 KB Time limit exceeded
28 Halted 0 ms 0 KB -