#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 5e3 + 10;
bool done[N];
int n, ans[N], x[N], y[N], r[N];
int solveTestCase() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i] >> r[i];
/*for (int i = 0; i < n; i++) {
pair<int, int> best = {1e18, 1e18};
for (int j = 0; j < n; j++) {
if (!done[j])
best = min(best, {-r[j], j});
}
if (best.first == 1e18)
break;
for (int j = 0,ind = best.second; j < n; j++) {
if (done[j])
continue;
int dist = (x[ind] - x[j]) * (x[ind] - x[j]) + (y[ind] - y[j]) * (y[ind] - y[j]);
if (dist <= (r[ind] + r[j]) * (r[ind] + r[j]))
ans[j] = ind + 1, done[j] = true;;
}
}*/
for (int i = 0; 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
circle_selection.cpp: In function 'long long int solveTestCase()':
circle_selection.cpp:34:1: warning: no return statement in function returning non-void [-Wreturn-type]
34 | }
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
512 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
5 ms |
896 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
512 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
5 ms |
896 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
512 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
2 ms |
512 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |