# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1075389 | HappyCapybara | Circle selection (APIO18_circle_selection) | C++17 | 550 ms | 62640 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
double eps = pow(10, -9);
double dist(int ax, int ay, int bx, int by){
return sqrt(pow(ax-bx, 2)+pow(ay-by, 2));
}
int main(){
int n;
cin >> n;
vector<vector<int>> v(n);
vector<pair<int,int>> ep;
for (int i=0; i<n; i++){
int x, y, r;
cin >> x >> y >> r;
v[i] = {-r, i, x, y};
}
sort(v.begin(), v.end());
for (int i=0; i<n; i++){
ep.push_back({v[i][2]+v[i][0], i});
ep.push_back({v[i][2]-v[i][0], i});
}
sort(ep.begin(), ep.end());
vector<vector<int>> fts(n);
for (int i=0; i<2*n; i++){
//cout << ep[i].first << " " << ep[i].second << "\n";
fts[ep[i].second].push_back(i);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |