Submission #265479

#	Time	Username	Problem	Language	Result	Execution time	Memory
265479		DS007	Circle selection (APIO18_circle_selection)	C++14	0 / 100	3065 ms	36216 KiB

circle_selection

#include <bits/stdc++.h>
using namespace std;
#define int long long

struct circle {
    int x, y, r, i;

    bool operator < (circle c) {
        return r > c.r;
    }
};

const int N = 3e5;
circle c[N];
bool done[N];
int n, ans[N];

int solveTestCase() {
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> c[i].x >> c[i].y >> c[i].r, c[i].i = i + 1;

    sort(c, c + n);

    for (int i = 0; i < n; i++) {
        if (done[i])
            continue;

        ans[c[i].i] = c[i].i;
        for (int j = i + 1; j < n; j++) {
            if ((c[i].y - c[j].y) * (c[i].y - c[j].y) + (c[i].x - c[j].x) * (c[i].x - c[j].x) < 0)
                exit(0);
            long double dist = sqrt((c[i].y - c[j].y) * (c[i].y - c[j].y) + (c[i].x - c[j].x) * (c[i].x - c[j].x));
            if (dist <= c[i].r + c[j].r)
                done[j] = true, ans[c[j].i] = c[i].i;
        }
    }

    for (int i = 1; i <= n; i++)
        cout << ans[i] << " ";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int t = 1;
    //cin >> t;
    while (t--)
        solveTestCase();
}

Compilation message (stderr)

circle_selection.cpp: In function 'long long int solveTestCase()':
circle_selection.cpp:41:1: warning: control reaches end of non-void function [-Wreturn-type]
   41 | }
      | ^

• Subtask 1: 0 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 15
• Subtask 4: 0 / 23
• Subtask 5: 0 / 30
• Subtask 6: 0 / 13