oj.uz

Submission #50003

# Submission time Handle Problem Language Result Execution time Memory
50003 2018-06-06T05:20:26 Z top34051 Circle selection (APIO18_circle_selection) C++17
0 / 100
 1689 ms 68392 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;
        int counter = 0;
        for(int xx=x-2;xx<=x+2;xx++) {
            for(int yy=y-2;yy<=y+2;yy++) {
                if(mp.count(xx)==0) continue;
                if(mp[xx].count(yy)==0) continue;
                for(auto t : mp[xx][yy]) {
                    if(cut(p[i], p[t])) {
                        res[i] = min(res[i], t);
                    }
                    counter++;
                }
            }
        }
//        assert(counter<=60);
        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

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
     ~~~~~^~~~~~~~~
circle_selection.cpp:21:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i=1;i<=n;i++) scanf("%d%d%d",&p[i].x,&p[i].y,&p[i].r);
                           ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 291 ms 5744 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 5744 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1689 ms 47772 KB Output is correct
2 Correct 958 ms 68392 KB Output is correct
3 Incorrect 1575 ms 68392 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Incorrect 2 ms 376 KB Output isn't correct
3 Halted 0 ms 0 KB -