# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
139755 | ae04071 | Circle selection (APIO18_circle_selection) | C++11 | 3059 ms | 35192 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>
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using namespace std;
using pii = pair<int,int>;
const int INF = 1e9;
struct circle{
int x,y,r,i;
bool operator<(const circle &rhs)const {
return r!=rhs.r ? r>rhs.r : i<rhs.i;
}
bool touch(circle &rhs)const {
return 1ll*(x-rhs.x)*(x-rhs.x)+1ll*(y-rhs.y)*(y-rhs.y)<=1ll*(r+rhs.r)*(r+rhs.r);
}
}arr[300001],o[300001];
int n,chk[300001];
set<pii> tr;
int main() {
scanf("%d",&n);
for(int i=1;i<=n;i++) {
scanf("%d%d%d",&arr[i].x,&arr[i].y,&arr[i].r);
arr[i].i=i;
tr.insert({arr[i].x,i});
o[i] = arr[i];
}
Compilation message (stderr)
# | 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... |