oj.uz

Submission #87159

# Submission time Handle Problem Language Result Execution time Memory
87159 2018-11-29T19:08:11 Z fedoseevtimofey Circle selection (APIO18_circle_selection) C++14
49 / 100
 3000 ms 357156 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; 
            }
            else {
                if (B >> 1 >= r[cur]) break;
            }
            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) {
                    vector <int> nw;
                    for (auto j : who[make_pair(cx, cy)]) {
                        if (kill[j] != -1) continue;
                        if (inter(cur, j)) {
                            kill[j] = cur;
                            alive.erase(j);
                        }
                        else {
                            nw.push_back(j);
                        }
                    }
                    who[make_pair(cx, cy)] = nw;
                }
            }
        }
    }
    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 464 KB Output is correct
3 Correct 2 ms 464 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 824 KB Output is correct
13 Correct 3 ms 832 KB Output is correct
14 Correct 3 ms 832 KB Output is correct
15 Correct 3 ms 832 KB Output is correct
16 Correct 3 ms 832 KB Output is correct
17 Correct 3 ms 832 KB Output is correct
18 Correct 3 ms 832 KB Output is correct
19 Correct 6 ms 1092 KB Output is correct
20 Correct 6 ms 1092 KB Output is correct
21 Correct 7 ms 1092 KB Output is correct
22 Correct 54 ms 6116 KB Output is correct
23 Correct 65 ms 6116 KB Output is correct
24 Correct 60 ms 6116 KB Output is correct
25 Correct 56 ms 6204 KB Output is correct
26 Correct 57 ms 6256 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 330 ms 22748 KB Output is correct
2 Correct 399 ms 23508 KB Output is correct
3 Correct 345 ms 23968 KB Output is correct
4 Correct 325 ms 23968 KB Output is correct
5 Correct 672 ms 23968 KB Output is correct
6 Correct 2227 ms 88288 KB Output is correct
7 Correct 846 ms 88288 KB Output is correct
8 Correct 1195 ms 88288 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 88288 KB Output is correct
2 Correct 2019 ms 109776 KB Output is correct
3 Execution timed out 3036 ms 302428 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 3038 ms 357156 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 464 KB Output is correct
3 Correct 2 ms 464 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 824 KB Output is correct
13 Correct 3 ms 832 KB Output is correct
14 Correct 3 ms 832 KB Output is correct
15 Correct 3 ms 832 KB Output is correct
16 Correct 3 ms 832 KB Output is correct
17 Correct 3 ms 832 KB Output is correct
18 Correct 3 ms 832 KB Output is correct
19 Correct 6 ms 1092 KB Output is correct
20 Correct 6 ms 1092 KB Output is correct
21 Correct 7 ms 1092 KB Output is correct
22 Correct 54 ms 6116 KB Output is correct
23 Correct 65 ms 6116 KB Output is correct
24 Correct 60 ms 6116 KB Output is correct
25 Correct 56 ms 6204 KB Output is correct
26 Correct 57 ms 6256 KB Output is correct
27 Correct 11 ms 357156 KB Output is correct
28 Correct 12 ms 357156 KB Output is correct
29 Correct 12 ms 357156 KB Output is correct
30 Correct 140 ms 357156 KB Output is correct
31 Correct 137 ms 357156 KB Output is correct
32 Correct 137 ms 357156 KB Output is correct
33 Correct 114 ms 357156 KB Output is correct
34 Correct 112 ms 357156 KB Output is correct
35 Correct 122 ms 357156 KB Output is correct
36 Correct 1791 ms 357156 KB Output is correct
37 Correct 1841 ms 357156 KB Output is correct
38 Correct 1896 ms 357156 KB Output is correct
39 Correct 754 ms 357156 KB Output is correct
40 Correct 831 ms 357156 KB Output is correct
41 Correct 834 ms 357156 KB Output is correct
42 Correct 478 ms 357156 KB Output is correct
43 Correct 1414 ms 357156 KB Output is correct
44 Correct 1507 ms 357156 KB Output is correct
45 Correct 1391 ms 357156 KB Output is correct
46 Correct 1382 ms 357156 KB Output is correct
47 Correct 1372 ms 357156 KB Output is correct
48 Correct 1411 ms 357156 KB Output is correct
49 Correct 1440 ms 357156 KB Output is correct
50 Correct 1417 ms 357156 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 464 KB Output is correct
3 Correct 2 ms 464 KB Output is correct
4 Correct 2 ms 588 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 2 ms 588 KB Output is correct
7 Correct 1 ms 588 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 3 ms 588 KB Output is correct
12 Correct 3 ms 824 KB Output is correct
13 Correct 3 ms 832 KB Output is correct
14 Correct 3 ms 832 KB Output is correct
15 Correct 3 ms 832 KB Output is correct
16 Correct 3 ms 832 KB Output is correct
17 Correct 3 ms 832 KB Output is correct
18 Correct 3 ms 832 KB Output is correct
19 Correct 6 ms 1092 KB Output is correct
20 Correct 6 ms 1092 KB Output is correct
21 Correct 7 ms 1092 KB Output is correct
22 Correct 54 ms 6116 KB Output is correct
23 Correct 65 ms 6116 KB Output is correct
24 Correct 60 ms 6116 KB Output is correct
25 Correct 56 ms 6204 KB Output is correct
26 Correct 57 ms 6256 KB Output is correct
27 Correct 330 ms 22748 KB Output is correct
28 Correct 399 ms 23508 KB Output is correct
29 Correct 345 ms 23968 KB Output is correct
30 Correct 325 ms 23968 KB Output is correct
31 Correct 672 ms 23968 KB Output is correct
32 Correct 2227 ms 88288 KB Output is correct
33 Correct 846 ms 88288 KB Output is correct
34 Correct 1195 ms 88288 KB Output is correct
35 Correct 3 ms 88288 KB Output is correct
36 Correct 2019 ms 109776 KB Output is correct
37 Execution timed out 3036 ms 302428 KB Time limit exceeded
38 Halted 0 ms 0 KB -