Submission #407562

#	Time	Username	Problem	Language	Result	Execution time	Memory
407562		tengiz05	Circle selection (APIO18_circle_selection)	C++17	0 / 100	3090 ms	34436 KiB

circle_selection

#include <bits/stdc++.h>
using i64 = long long;
inline i64 sq(int x) { return i64(x) * x; }
int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n;
    std::cin >> n;
    std::vector<int> x(n), y(n), r(n);
    for (int i = 0; i < n; i++) {
        std::cin >> x[i] >> y[i] >> r[i];
    }
    std::vector<int> ans(n, -1);
    std::vector<int> ind(n);
    iota(ind.begin(), ind.end(), 0);
    sort(ind.begin(), ind.end(), [&](int i, int j) {
        if (r[i] == r[j]) return i < j;
        return r[i] > r[j];
    });
    std::set<std::pair<int, int>> sl, sr;
    for (int i = 0; i < n; i++) {
        sl.emplace(x[i] + r[i], i);
        sr.emplace(x[i] - r[i], i);
    }
    for (auto i : ind) {
        while (sr.size()) {
            auto it = sr.lower_bound({x[i] - r[i], -1});
            if (it == sr.end())break;
            if (it->first <= x[i] + r[i]) {
                int j = it->second;
                ans[j] = i;
                sr.erase({x[j] - r[j], j});
                sl.erase({x[j] + r[j], j});
            }
        }
        while (sl.size()) {
            auto it = sl.lower_bound({x[i] + r[i], 1e9});
            if (it == sl.begin())break;
            it--;
            if (it->first >= x[i] - r[i]) {
                int j = it->second;
                ans[j] = i;
                sr.erase({x[j] - r[j], j});
                sl.erase({x[j] + r[j], j});
            }
        }
    }
    for (auto x : ans) std::cout << x + 1 << ' ';
    std::cout << '\n';
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 30
• Subtask 6: 0 / 13