oj.uz

Submission #407842

# Submission time Handle Problem Language Result Execution time Memory
407842 2021-05-19T04:48:50 Z tengiz05 Circle selection (APIO18_circle_selection) C++17
0 / 100
 874 ms 36400 KB 
#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>> sr;
    for (int i = 0; i < n; i++) {
        sr.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;
            int j = it->second;
            if (it->first <= x[i] + r[i]) {
                if (ans[j] == -1)
                    ans[j] = i;
                sr.erase(it);
            } else break;
        }
    }
    for (auto x : ans) assert(~x), std::cout << x + 1 << ' ';
    std::cout << '\n';
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 871 ms 36400 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 874 ms 36020 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 1 ms 204 KB Output isn't correct
4 Halted 0 ms 0 KB -