# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
698758 | vjudge1 | Circle selection (APIO18_circle_selection) | C++17 | 3083 ms | 16652 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 endl '\n'
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define int ll
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
using namespace std;
const int N = 3e5 + 10, mod = 1e9 + 7;
int n, x[N], y[N], r[N], ans[N];
vector<pair<int, int> > v;
signed main()
{
FAST;
cin >> n;
for(int i = 1; i <= n; i++) {
int x1, y1, r1;
cin >> x1 >> y1 >> r1;
v.push_back({r1, -i});
x[i] = x1;
y[i] = y1;
r[i] = r1;
}
sort(all(v));
reverse(all(v));
for(auto it : v) {
if(ans[-it.second] == 0) {
ans[-it.second] = -it.second;
for(auto i : v) {
if(i.second == it.second) continue;
int a = x[-it.second] - x[-i.second];
# | 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... |