oj.uz

Submission #938854

# Submission time Handle Problem Language Result Execution time Memory
938854 2024-03-05T17:09:29 Z green_gold_dog Circle selection (APIO18_circle_selection) C++17
7 / 100
 3000 ms 27128 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);
        }
};

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);
        for (ll i = 0; i < n; i++) {
                if (ans[all[i].id] == -1) {
                        ans[all[i].id] = all[i].id;
                        for (ll j = i + 1; j < n; j++) {
                                if (all[i].check(all[j]) && ans[all[j].id] == -1) {
                                        ans[all[j].id] = all[i].id;
                                }
                        }
                }
        }
        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:89:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
circle_selection.cpp:90:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   90 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 848 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 14 ms 860 KB Output is correct
23 Correct 15 ms 856 KB Output is correct
24 Correct 15 ms 856 KB Output is correct
25 Correct 20 ms 860 KB Output is correct
26 Correct 14 ms 856 KB Output is correct

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 25936 KB Output is correct
2 Correct 132 ms 25728 KB Output is correct
3 Correct 109 ms 25684 KB Output is correct
4 Correct 110 ms 25940 KB Output is correct
5 Correct 1108 ms 23896 KB Output is correct
6 Execution timed out 3068 ms 23808 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Execution timed out 3083 ms 9364 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 848 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 14 ms 860 KB Output is correct
23 Correct 15 ms 856 KB Output is correct
24 Correct 15 ms 856 KB Output is correct
25 Correct 20 ms 860 KB Output is correct
26 Correct 14 ms 856 KB Output is correct
27 Correct 4 ms 1372 KB Output is correct
28 Correct 4 ms 1356 KB Output is correct
29 Correct 4 ms 1372 KB Output is correct
30 Correct 58 ms 1372 KB Output is correct
31 Correct 52 ms 1116 KB Output is correct
32 Correct 52 ms 1368 KB Output is correct
33 Correct 40 ms 9736 KB Output is correct
34 Correct 38 ms 9820 KB Output is correct
35 Correct 41 ms 9556 KB Output is correct
36 Execution timed out 3049 ms 9044 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 848 KB Output is correct
21 Correct 2 ms 860 KB Output is correct
22 Correct 14 ms 860 KB Output is correct
23 Correct 15 ms 856 KB Output is correct
24 Correct 15 ms 856 KB Output is correct
25 Correct 20 ms 860 KB Output is correct
26 Correct 14 ms 856 KB Output is correct
27 Correct 114 ms 25936 KB Output is correct
28 Correct 132 ms 25728 KB Output is correct
29 Correct 109 ms 25684 KB Output is correct
30 Correct 110 ms 25940 KB Output is correct
31 Correct 1108 ms 23896 KB Output is correct
32 Execution timed out 3068 ms 23808 KB Time limit exceeded
33 Halted 0 ms 0 KB -