# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
639587 | elkernos | Circle selection (APIO18_circle_selection) | C++17 | 3057 ms | 33852 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 ll;
ll sq(int x) { return (ll)x * x; }
struct C {
int x, y, r;
void read() { cin >> x >> y >> r; }
bool inter(const C &he) const { return sq(x - he.x) + sq(y - he.y) <= sq(r + he.r); }
};
struct T {
int x, y, id;
T(int xx, int yy, int iid) : x(xx), y(yy), id(iid) {}
bool operator<(const T &he) const { return tie(x, y, id) < tie(he.x, he.y, he.id); }
};
const int oo = 1e9 + 7;
int32_t main()
{
cin.tie(0)->sync_with_stdio(0);
int n;
cin >> n;
vector<int> ans(n, -1), ord(n);
vector<C> c(n);
for(int i = 0; i < n; 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... |