oj.uz

Submission #407589

# Submission time Handle Problem Language Result Execution time Memory
407589 2021-05-19T03:55:15 Z juggernaut Circle selection (APIO18_circle_selection) C++17
12 / 100
 802 ms 36492 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) {
          if(~ans[i])continue;
            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])break;
                sr.erase(it);
              if(~ans[it->second])continue;
              ans[it->second]=i;
            }
        }
        for (auto x : ans) assert(~x), std::cout << x + 1 << ' ';
        std::cout << '\n';
    }

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:30:21: warning: unused variable 'j' [-Wunused-variable]
   30 |                 int j = it->second;
      |                     ^

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
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 777 ms 36464 KB Output is correct
2 Correct 773 ms 36492 KB Output is correct
3 Correct 802 ms 36216 KB Output is correct
4 Correct 728 ms 36468 KB Output is correct
5 Correct 684 ms 36208 KB Output is correct
6 Correct 734 ms 36348 KB Output is correct
7 Correct 675 ms 36336 KB Output is correct
8 Correct 702 ms 36332 KB Output is correct

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 676 ms 36016 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 -