# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
476574 | hongrae03k | Circle selection (APIO18_circle_selection) | C++17 | 3081 ms | 19992 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;
typedef long long i64;
const int MAX = 3e5 + 9;
struct Circle {
i64 x, y;
i64 rad, idx;
} circles[MAX];
bool cmpRad(Circle& a, Circle& b) {
if (a.rad == b.rad) return a.idx < b.idx;
return a.rad > b.rad;
}
bool intercept(Circle& a, Circle &b) {
i64 dx = a.x * 1LL - b.x * 1LL;
i64 dy = a.y * 1LL - b.y * 1LL;
i64 dist2 = dx * dx * 1LL + dy * dy * 1LL;
i64 rad2 = (a.rad + b.rad) * (a.rad + b.rad) * 1LL;
return dist2 <= rad2;
}
int par[MAX];
bool deleted[MAX];
int main() {
int N;
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... |