oj.uz

Submission #87161

# Submission time Handle Problem Language Result Execution time Memory
87161 2018-11-29T19:19:41 Z fedoseevtimofey Circle selection (APIO18_circle_selection) C++14
0 / 100
 3000 ms 53520 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;
    int B = 2e9 + 7;
    while (true) {
        while (uk < n && kill[idx[uk]] != -1) ++uk;
        if (uk == n) break;
        int cur = idx[uk];
        if (r[cur] >> 1 <= B) {
            B = r[cur];
            rebuild(B);
        }
        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 (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
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 3 ms 444 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 2 ms 628 KB Output is correct
7 Correct 2 ms 628 KB Output is correct
8 Correct 2 ms 700 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 700 KB Output is correct
11 Correct 3 ms 700 KB Output is correct
12 Correct 3 ms 700 KB Output is correct
13 Correct 3 ms 700 KB Output is correct
14 Correct 3 ms 700 KB Output is correct
15 Correct 3 ms 700 KB Output is correct
16 Correct 3 ms 700 KB Output is correct
17 Correct 3 ms 700 KB Output is correct
18 Correct 3 ms 700 KB Output is correct
19 Correct 6 ms 992 KB Output is correct
20 Correct 7 ms 992 KB Output is correct
21 Correct 6 ms 1008 KB Output is correct
22 Execution timed out 3037 ms 1624 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 315 ms 22772 KB Output is correct
2 Correct 414 ms 23900 KB Output is correct
3 Correct 354 ms 23900 KB Output is correct
4 Correct 357 ms 23900 KB Output is correct
5 Execution timed out 3044 ms 23900 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 23900 KB Output is correct
2 Execution timed out 3035 ms 23900 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 3052 ms 53520 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 384 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 3 ms 444 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 2 ms 628 KB Output is correct
7 Correct 2 ms 628 KB Output is correct
8 Correct 2 ms 700 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 700 KB Output is correct
11 Correct 3 ms 700 KB Output is correct
12 Correct 3 ms 700 KB Output is correct
13 Correct 3 ms 700 KB Output is correct
14 Correct 3 ms 700 KB Output is correct
15 Correct 3 ms 700 KB Output is correct
16 Correct 3 ms 700 KB Output is correct
17 Correct 3 ms 700 KB Output is correct
18 Correct 3 ms 700 KB Output is correct
19 Correct 6 ms 992 KB Output is correct
20 Correct 7 ms 992 KB Output is correct
21 Correct 6 ms 1008 KB Output is correct
22 Execution timed out 3037 ms 1624 KB Time limit exceeded
23 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 384 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 3 ms 444 KB Output is correct
5 Correct 2 ms 500 KB Output is correct
6 Correct 2 ms 628 KB Output is correct
7 Correct 2 ms 628 KB Output is correct
8 Correct 2 ms 700 KB Output is correct
9 Correct 2 ms 700 KB Output is correct
10 Correct 2 ms 700 KB Output is correct
11 Correct 3 ms 700 KB Output is correct
12 Correct 3 ms 700 KB Output is correct
13 Correct 3 ms 700 KB Output is correct
14 Correct 3 ms 700 KB Output is correct
15 Correct 3 ms 700 KB Output is correct
16 Correct 3 ms 700 KB Output is correct
17 Correct 3 ms 700 KB Output is correct
18 Correct 3 ms 700 KB Output is correct
19 Correct 6 ms 992 KB Output is correct
20 Correct 7 ms 992 KB Output is correct
21 Correct 6 ms 1008 KB Output is correct
22 Execution timed out 3037 ms 1624 KB Time limit exceeded
23 Halted 0 ms 0 KB -