oj.uz

Submission #87157

# Submission time Handle Problem Language Result Execution time Memory
87157 2018-11-29T19:03:23 Z fedoseevtimofey Circle selection (APIO18_circle_selection) C++14
19 / 100
 3000 ms 401236 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
 
int n;
vector <int> x, y, r;
 
void init() {
    cin >> n;
    x.resize(n);
    y.resize(n);
    r.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> x[i] >> y[i] >> r[i];
    }
}
 
bool inter(int i, int j) {
    return (ll)(x[i] - x[j]) * (x[i] - x[j]) + (ll)(y[i] - y[j]) * (y[i] - y[j]) <= (ll)(r[i] + r[j]) * (r[i] + r[j]);
}
 
map <pair <int, int>, vector <int>> who;
 
set <int> alive;
 
void rebuild(int B) {
    who.clear();
    for (auto i : alive) {
        int xx = x[i] / B;
        int yy = y[i] / B;
        who[make_pair(xx, yy)].push_back(i);
    }
}
 
void solve() {
    for (int i = 0; i < n; ++i) alive.insert(i);
    vector <int> idx(n);
    iota(idx.begin(), idx.end(), 0);
    sort(idx.begin(), idx.end(), [&] (int i, int j) {
        if (r[i] != r[j]) return r[i] > r[j];
        return i < j;
    });
    vector <int> kill(n, -1);
    int uk = 0;
    for (int B = 1 << 30; B > 0; B >>= 1) {
        bool fl = false;
        while (true) {
            while (uk < n && kill[idx[uk]] != -1) ++uk;
            if (uk == n) break;
            int cur = idx[uk];
            if (!fl) {
                B = r[cur];
                rebuild(B);
                fl = true;
            }
            alive.erase(cur);
            kill[cur] = cur;
            int xx = x[cur] / B;
            int yy = y[cur] / B;
            for (int cx = xx - 2; cx <= xx + 2; ++cx) {
                for (int cy = yy - 2; cy <= yy + 2; ++cy) {
                    for (auto j : who[make_pair(cx, cy)]) {
                        if (kill[j] != -1) continue;
                        if (inter(cur, j)) {
                            kill[j] = cur;
                            alive.erase(j);
                        }
                    }
                }
            }
        }
    }
    for (int i = 0; i < n; ++i) {
        cout << kill[i] + 1 << ' ';
    }
}
 
int main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.setf(ios::fixed); cout.precision(20);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    init();
    solve();
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 3 ms 540 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 728 KB Output is correct
12 Correct 3 ms 732 KB Output is correct
13 Correct 3 ms 864 KB Output is correct
14 Correct 3 ms 864 KB Output is correct
15 Correct 3 ms 864 KB Output is correct
16 Correct 3 ms 864 KB Output is correct
17 Correct 3 ms 864 KB Output is correct
18 Correct 3 ms 864 KB Output is correct
19 Correct 6 ms 1116 KB Output is correct
20 Correct 6 ms 1116 KB Output is correct
21 Correct 6 ms 1132 KB Output is correct
22 Correct 57 ms 10892 KB Output is correct
23 Correct 63 ms 10892 KB Output is correct
24 Correct 50 ms 10904 KB Output is correct
25 Correct 53 ms 11048 KB Output is correct
26 Correct 54 ms 11048 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 348 ms 25460 KB Output is correct
2 Correct 363 ms 26036 KB Output is correct
3 Correct 331 ms 26036 KB Output is correct
4 Correct 317 ms 26036 KB Output is correct
5 Correct 657 ms 26784 KB Output is correct
6 Correct 1789 ms 91088 KB Output is correct
7 Correct 797 ms 91088 KB Output is correct
8 Correct 950 ms 91088 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 91088 KB Output is correct
2 Correct 1918 ms 199180 KB Output is correct
3 Execution timed out 3053 ms 346916 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 3069 ms 401236 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 3 ms 540 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 728 KB Output is correct
12 Correct 3 ms 732 KB Output is correct
13 Correct 3 ms 864 KB Output is correct
14 Correct 3 ms 864 KB Output is correct
15 Correct 3 ms 864 KB Output is correct
16 Correct 3 ms 864 KB Output is correct
17 Correct 3 ms 864 KB Output is correct
18 Correct 3 ms 864 KB Output is correct
19 Correct 6 ms 1116 KB Output is correct
20 Correct 6 ms 1116 KB Output is correct
21 Correct 6 ms 1132 KB Output is correct
22 Correct 57 ms 10892 KB Output is correct
23 Correct 63 ms 10892 KB Output is correct
24 Correct 50 ms 10904 KB Output is correct
25 Correct 53 ms 11048 KB Output is correct
26 Correct 54 ms 11048 KB Output is correct
27 Correct 12 ms 401236 KB Output is correct
28 Correct 11 ms 401236 KB Output is correct
29 Correct 12 ms 401236 KB Output is correct
30 Correct 152 ms 401236 KB Output is correct
31 Correct 168 ms 401236 KB Output is correct
32 Correct 113 ms 401236 KB Output is correct
33 Correct 113 ms 401236 KB Output is correct
34 Correct 115 ms 401236 KB Output is correct
35 Correct 126 ms 401236 KB Output is correct
36 Correct 1620 ms 401236 KB Output is correct
37 Correct 1725 ms 401236 KB Output is correct
38 Correct 1882 ms 401236 KB Output is correct
39 Execution timed out 3033 ms 401236 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 456 KB Output is correct
4 Correct 3 ms 476 KB Output is correct
5 Correct 3 ms 540 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 564 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 2 ms 592 KB Output is correct
10 Correct 2 ms 596 KB Output is correct
11 Correct 3 ms 728 KB Output is correct
12 Correct 3 ms 732 KB Output is correct
13 Correct 3 ms 864 KB Output is correct
14 Correct 3 ms 864 KB Output is correct
15 Correct 3 ms 864 KB Output is correct
16 Correct 3 ms 864 KB Output is correct
17 Correct 3 ms 864 KB Output is correct
18 Correct 3 ms 864 KB Output is correct
19 Correct 6 ms 1116 KB Output is correct
20 Correct 6 ms 1116 KB Output is correct
21 Correct 6 ms 1132 KB Output is correct
22 Correct 57 ms 10892 KB Output is correct
23 Correct 63 ms 10892 KB Output is correct
24 Correct 50 ms 10904 KB Output is correct
25 Correct 53 ms 11048 KB Output is correct
26 Correct 54 ms 11048 KB Output is correct
27 Correct 348 ms 25460 KB Output is correct
28 Correct 363 ms 26036 KB Output is correct
29 Correct 331 ms 26036 KB Output is correct
30 Correct 317 ms 26036 KB Output is correct
31 Correct 657 ms 26784 KB Output is correct
32 Correct 1789 ms 91088 KB Output is correct
33 Correct 797 ms 91088 KB Output is correct
34 Correct 950 ms 91088 KB Output is correct
35 Correct 2 ms 91088 KB Output is correct
36 Correct 1918 ms 199180 KB Output is correct
37 Execution timed out 3053 ms 346916 KB Time limit exceeded
38 Halted 0 ms 0 KB -