# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49999 | 2018-06-06T05:05:21 Z | top34051 | Circle selection (APIO18_circle_selection) | C++17 | 3000 ms | 483944 KB |
//subtask 4 #include<bits/stdc++.h> using namespace std; const int maxn = 3e5 + 5; struct node { int x,y,r; }; int n; node p[maxn]; int R; int res[maxn]; map<int,map<int,vector<int>>> mp; double dist(node a, node b) { return sqrt((a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y)); } bool cut(node a, node b) { return dist(a,b) <= (double)a.r + b.r; } int main() { scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d%d%d",&p[i].x,&p[i].y,&p[i].r); R = p[1].r; for(int i=1;i<=n;i++) { int x = p[i].x/R, y = p[i].y/R; res[i] = i; for(int xx=x-2;xx<=x+2;xx++) { for(int yy=y-2;yy<=y+2;yy++) { for(auto t : mp[xx][yy]) { if(cut(p[i], p[t])) { res[i] = min(res[i], t); } } } } if(res[i]==i) { mp[x][y].push_back(i); assert(mp[x][y].size()<=3); } } for(int i=1;i<=n;i++) printf("%d ",res[i]); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Incorrect | 2 ms | 484 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 151 ms | 7596 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 7596 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3057 ms | 483944 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Incorrect | 2 ms | 484 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 248 KB | Output is correct |
2 | Incorrect | 2 ms | 484 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |