# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49133 | 2018-05-22T15:45:25 Z | BThero | Circle selection (APIO18_circle_selection) | C++17 | 3000 ms | 387000 KB |
// Why am I so stupid? :c #include <bits/stdc++.h> #define pb push_back #define mp make_pair #define all(x) (x).begin(), (x).end() #define fi first #define se second typedef long long ll; using namespace std; struct circle { int x, y, r; circle() { x = y = r = 0; } } arr[300005]; map < pair <int, int>, vector <int> > mm; int ans[300005]; int n; bool inter(circle a, circle b) { ll dist = (a.x - b.x) * 1ll * (a.x - b.x) + (a.y - b.y) * 1ll * (a.y - b.y); return dist <= a.r + b.r; } void solve() { scanf("%d", &n); for (int i = 1; i <= n; ++i) { scanf("%d %d %d", &arr[i].x, &arr[i].y, &arr[i].r); } int R = arr[1].r; for (int i = 1; i <= n; ++i) { mm[mp(arr[i].x / R, arr[i].y / R)].pb(i); ans[i] = i; } for (int i = 1; i <= n; ++i) { if (ans[i] != i) { continue; } int cx = arr[i].x / R, cy = arr[i].y / R; for (int x = cx - 2; x <= cx + 2; ++x) { for (int y = cy - 2; y <= cy + 2; ++y) { for (int it : mm[mp(x, y)]) { if (inter(arr[i], arr[it])) { ans[it] = i; } } } } } for (int i = 1; i <= n; ++i) { printf("%d ", ans[i]); } } int main() { #ifdef BThero freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #endif // BThero int tt = 1; while (tt--) { solve(); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 3832 KB | Output is correct |
2 | Correct | 5 ms | 3940 KB | Output is correct |
3 | Incorrect | 6 ms | 3940 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3036 ms | 6584 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 5 ms | 6584 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3060 ms | 387000 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 3832 KB | Output is correct |
2 | Correct | 5 ms | 3940 KB | Output is correct |
3 | Incorrect | 6 ms | 3940 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 3832 KB | Output is correct |
2 | Correct | 5 ms | 3940 KB | Output is correct |
3 | Incorrect | 6 ms | 3940 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |