oj.uz

Submission #698680

# Submission time Handle Problem Language Result Execution time Memory
698680 2023-02-14T07:36:19 Z vjudge1 Circle selection (APIO18_circle_selection) C++17
87 / 100
 3000 ms 31632 KB 
#include<bits/stdc++.h>
#define maxn 400000
using namespace std;
int n;
int el[maxn];
int x[maxn];
int y[maxn];
int rev[maxn];
int radius[maxn];
pair<pair<int,int>,pair<int,int> > circ[maxn];
vector<pair<pair<int,int>,int> > v;
set<pair<int,int> > s;
inline bool intersect(int i,int j) {
    return 1ll*(x[i]-x[j])*(x[i]-x[j])+1ll*(y[i]-y[j])*(y[i]-y[j])<=1ll*(radius[i]+radius[j])*(radius[i]+radius[j]);
}
void dc(int l,int r) {
    if(l==r) return;
    int m=(l+r)/2;
    dc(l,m);
    //cout<<l<<" "<<m<<" "<<r<<endl;
    for(int i=l;i<=r;i++) {
        int ind=circ[i].first.second;
        if(el[ind]==ind) {
            //cout<<ind<<endl;
            if(i<=m) {
                v.push_back({{x[ind]-radius[ind],0},ind});
                v.push_back({{x[ind]+radius[ind],2},ind});
            }
            else {
                v.push_back({{x[ind]-radius[ind],1},ind});
                v.push_back({{x[ind]+radius[ind],1},ind});
            }
        }
    }
    sort(v.begin(),v.end());
    for(auto p:v) {
        int xc=p.first.first;
        int ind=p.second;
        int pos=rev[ind];
        if(pos<=m) {
            //cout<<ind<<" "<<pos<<endl;
            if(xc == x[ind]-radius[ind]) s.insert({y[ind],ind});
            else s.erase({y[ind],ind});
        }
        else {
            if(s.empty()) continue;
            set<pair<int,int> >::iterator it=s.lower_bound({y[ind],-1});
            set<pair<int,int> >::iterator st=it;
            int co=5001;
            int i=0;
            //cout<<ind<<" "<<pos<<endl;
            while(it!=s.end() && i<=co) {
                int jnd=(*it).second;
                if(rev[jnd]<rev[el[ind]] && intersect(ind,jnd)) {
                    el[ind]=jnd;
                }
                it++;
                i++;
            }
            it=st;
            if(it==s.begin()) continue;
            i=0;
            do {
                it--;
                int jnd=(*it).second;
                if(rev[jnd]<rev[el[ind]] && intersect(ind,jnd)) {
                    el[ind]=jnd;
                }
                i++;
            } while(it!=s.begin() && i<=co);
        }
    }
    s.clear();
    v.clear();
    dc(m+1,r);
}
int main() {
    scanf("%d",&n);
    for(int i=1;i<=n;i++) {
        scanf("%d %d %d",&x[i],&y[i],&radius[i]);
        circ[i]={{-radius[i],i},{x[i],y[i]}};
        el[i]=i;
    }
    sort(circ+1,circ+n+1);
    for(int i=1;i<=n;i++) {
        rev[circ[i].first.second]=i;
        //cout<<circ[i].first.second<<" ";
    }
    //cout<<endl;
    dc(1,n);
    for(int i=1;i<=n;i++) {
        printf("%d ",el[i]);
    }
    printf("\n");
    return 0;
}

Compilation message

circle_selection.cpp: In function 'int main()':
circle_selection.cpp:78:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
circle_selection.cpp:80:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |         scanf("%d %d %d",&x[i],&y[i],&radius[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 4 ms 828 KB Output is correct
20 Correct 4 ms 840 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 12 ms 940 KB Output is correct
23 Correct 15 ms 920 KB Output is correct
24 Correct 10 ms 892 KB Output is correct
25 Correct 12 ms 916 KB Output is correct
26 Correct 11 ms 896 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 224 ms 19264 KB Output is correct
2 Correct 218 ms 18024 KB Output is correct
3 Correct 219 ms 17896 KB Output is correct
4 Correct 220 ms 18036 KB Output is correct
5 Correct 218 ms 17876 KB Output is correct
6 Correct 430 ms 21372 KB Output is correct
7 Correct 241 ms 20536 KB Output is correct
8 Correct 278 ms 20508 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 320 ms 7228 KB Output is correct
3 Correct 1132 ms 31376 KB Output is correct
4 Correct 1097 ms 31404 KB Output is correct
5 Correct 1028 ms 26832 KB Output is correct
6 Correct 406 ms 16404 KB Output is correct
7 Correct 165 ms 8620 KB Output is correct
8 Correct 25 ms 1920 KB Output is correct
9 Correct 1177 ms 31444 KB Output is correct
10 Correct 1155 ms 27384 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 961 ms 23524 KB Output is correct
2 Correct 851 ms 30340 KB Output is correct
3 Correct 634 ms 25532 KB Output is correct
4 Correct 874 ms 30676 KB Output is correct
5 Correct 858 ms 30868 KB Output is correct
6 Correct 582 ms 25748 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 4 ms 828 KB Output is correct
20 Correct 4 ms 840 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 12 ms 940 KB Output is correct
23 Correct 15 ms 920 KB Output is correct
24 Correct 10 ms 892 KB Output is correct
25 Correct 12 ms 916 KB Output is correct
26 Correct 11 ms 896 KB Output is correct
27 Correct 7 ms 1300 KB Output is correct
28 Correct 8 ms 1256 KB Output is correct
29 Correct 7 ms 1248 KB Output is correct
30 Correct 25 ms 1360 KB Output is correct
31 Correct 21 ms 1408 KB Output is correct
32 Correct 23 ms 1428 KB Output is correct
33 Correct 74 ms 6420 KB Output is correct
34 Correct 73 ms 6100 KB Output is correct
35 Correct 74 ms 5920 KB Output is correct
36 Correct 278 ms 7104 KB Output is correct
37 Correct 273 ms 9664 KB Output is correct
38 Correct 281 ms 9768 KB Output is correct
39 Correct 416 ms 8124 KB Output is correct
40 Correct 381 ms 8104 KB Output is correct
41 Correct 385 ms 8216 KB Output is correct
42 Correct 268 ms 8608 KB Output is correct
43 Correct 238 ms 9636 KB Output is correct
44 Correct 242 ms 9600 KB Output is correct
45 Correct 236 ms 9672 KB Output is correct
46 Correct 234 ms 9612 KB Output is correct
47 Correct 257 ms 9676 KB Output is correct
48 Correct 253 ms 9688 KB Output is correct
49 Correct 233 ms 9676 KB Output is correct
50 Correct 247 ms 9688 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 308 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 308 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 4 ms 828 KB Output is correct
20 Correct 4 ms 840 KB Output is correct
21 Correct 4 ms 852 KB Output is correct
22 Correct 12 ms 940 KB Output is correct
23 Correct 15 ms 920 KB Output is correct
24 Correct 10 ms 892 KB Output is correct
25 Correct 12 ms 916 KB Output is correct
26 Correct 11 ms 896 KB Output is correct
27 Correct 224 ms 19264 KB Output is correct
28 Correct 218 ms 18024 KB Output is correct
29 Correct 219 ms 17896 KB Output is correct
30 Correct 220 ms 18036 KB Output is correct
31 Correct 218 ms 17876 KB Output is correct
32 Correct 430 ms 21372 KB Output is correct
33 Correct 241 ms 20536 KB Output is correct
34 Correct 278 ms 20508 KB Output is correct
35 Correct 1 ms 308 KB Output is correct
36 Correct 320 ms 7228 KB Output is correct
37 Correct 1132 ms 31376 KB Output is correct
38 Correct 1097 ms 31404 KB Output is correct
39 Correct 1028 ms 26832 KB Output is correct
40 Correct 406 ms 16404 KB Output is correct
41 Correct 165 ms 8620 KB Output is correct
42 Correct 25 ms 1920 KB Output is correct
43 Correct 1177 ms 31444 KB Output is correct
44 Correct 1155 ms 27384 KB Output is correct
45 Correct 961 ms 23524 KB Output is correct
46 Correct 851 ms 30340 KB Output is correct
47 Correct 634 ms 25532 KB Output is correct
48 Correct 874 ms 30676 KB Output is correct
49 Correct 858 ms 30868 KB Output is correct
50 Correct 582 ms 25748 KB Output is correct
51 Correct 7 ms 1300 KB Output is correct
52 Correct 8 ms 1256 KB Output is correct
53 Correct 7 ms 1248 KB Output is correct
54 Correct 25 ms 1360 KB Output is correct
55 Correct 21 ms 1408 KB Output is correct
56 Correct 23 ms 1428 KB Output is correct
57 Correct 74 ms 6420 KB Output is correct
58 Correct 73 ms 6100 KB Output is correct
59 Correct 74 ms 5920 KB Output is correct
60 Correct 278 ms 7104 KB Output is correct
61 Correct 273 ms 9664 KB Output is correct
62 Correct 281 ms 9768 KB Output is correct
63 Correct 416 ms 8124 KB Output is correct
64 Correct 381 ms 8104 KB Output is correct
65 Correct 385 ms 8216 KB Output is correct
66 Correct 268 ms 8608 KB Output is correct
67 Correct 238 ms 9636 KB Output is correct
68 Correct 242 ms 9600 KB Output is correct
69 Correct 236 ms 9672 KB Output is correct
70 Correct 234 ms 9612 KB Output is correct
71 Correct 257 ms 9676 KB Output is correct
72 Correct 253 ms 9688 KB Output is correct
73 Correct 233 ms 9676 KB Output is correct
74 Correct 247 ms 9688 KB Output is correct
75 Correct 237 ms 26496 KB Output is correct
76 Correct 240 ms 25896 KB Output is correct
77 Correct 234 ms 26044 KB Output is correct
78 Correct 247 ms 26272 KB Output is correct
79 Correct 285 ms 25844 KB Output is correct
80 Correct 234 ms 26156 KB Output is correct
81 Correct 1097 ms 31296 KB Output is correct
82 Correct 1048 ms 31196 KB Output is correct
83 Correct 1062 ms 31276 KB Output is correct
84 Correct 1174 ms 31632 KB Output is correct
85 Correct 1097 ms 31160 KB Output is correct
86 Correct 1041 ms 31312 KB Output is correct
87 Correct 2187 ms 31428 KB Output is correct
88 Correct 1712 ms 21448 KB Output is correct
89 Correct 1750 ms 21408 KB Output is correct
90 Correct 1675 ms 21480 KB Output is correct
91 Correct 1694 ms 21500 KB Output is correct
92 Correct 1660 ms 21472 KB Output is correct
93 Correct 911 ms 30264 KB Output is correct
94 Execution timed out 3040 ms 19440 KB Time limit exceeded
95 Halted 0 ms 0 KB -