oj.uz

Submission #51084

# Submission time Handle Problem Language Result Execution time Memory
51084 2018-06-16T03:24:58 Z edisonhello Circle selection (APIO18_circle_selection) C++11
100 / 100
 1919 ms 42656 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,tune=native")
#include<cstdio>
#include<unordered_map>
#include<vector>
#include<utility>
#include<algorithm>
using namespace std;
 
int n,pos[300005],ans[300005];
struct circle{
    int x,y,r,i;
} c[300005];
 
namespace std {
    template<> struct hash<pair<int,int>> {
        long long operator()(const pair<int,int> &a) const {
            return 1ll*a.first*1000000009+a.second;
        }
    };
}
 
unordered_map<pair<int,int>,int> mp;
vector<int> idxs[300005];
 
int rit(){
    char c; int x=0; bool mi=0;
    while((c=getchar_unlocked())){ if(c=='-' || (c>='0' && c<='9'))break; }
    if(c=='-')mi=1;
    else x=c-'0';
    while((c=getchar_unlocked())){ if(c<'0' || c>'9')break; x=x*10+(c&15); }
    return mi?-x:x;
}
 
int main(){
    n=rit();
    for(int i=0;i<n;++i){
        c[i].x=rit(),c[i].y=rit(),c[i].r=rit();
        c[i].i=i+1;
    }
    sort(c,c+n,[](const circle &a,const circle &b){ return a.r==b.r?a.i<b.i:a.r>b.r; });
    // for(int i=0;i<n;++i)pos[c[i].i]=i;
    int masterPtr=0;
    int D=c[0].r,killcount=0;
 
    auto buildGraph=[&](){
        for(int i=1;i<=int(mp.size());++i)idxs[i].clear();
        mp.clear();
        D=c[masterPtr].r;
        killcount=0;
        for(int i=masterPtr;i<n;++i){
            if(c[i].i==0)continue;
            pair<int,int> pos(c[i].x/D,c[i].y/D);
            int &it=mp[pos];
            if(it)idxs[it].push_back(i);
            else idxs[(it=mp.size())].push_back(i);
            // cout<<"insert "<<i<<" into "<<it<<" , pos: "<<pos.first<<" , "<<pos.second<<endl;
        }
    };
 
    buildGraph();
    while(masterPtr<n){
        while(masterPtr<n && c[masterPtr].i==0)++masterPtr;
        if(masterPtr>=n)break;
        // cout<<"now masterPtr: "<<masterPtr<<" circle is "<<c[masterPtr].i<<endl;
        // cout<<"circle position: "<<c[masterPtr].x<<" "<<c[masterPtr].y<<endl;
        if(D/c[masterPtr].r>=10 && killcount>=1000){
            buildGraph();
            // cout<<"map contains: "<<endl;
            // for(auto p:mp)cout<<"[("<<p.first.first<<" , "<<p.first.second<<") : "<<p.second<<"] ";
            // cout<<endl;
        }
        pair<int,int> pos(c[masterPtr].x/D,c[masterPtr].y/D);
        // cout<<"base position: "<<pos.first<<" "<<pos.second<<endl;
        for(int dx=-2;dx<=2;++dx){
            for(int dy=-2;dy<=2;++dy){
                auto it=mp.find(make_pair(pos.first+dx,pos.second+dy));
                if(it==mp.end())continue;
                // cout<<"it's not the end: "<<it->second<<endl;
                for(int i:idxs[it->second]){
                    if(c[i].i==0)continue;
                    if(1ll*(c[i].x-c[masterPtr].x)*(c[i].x-c[masterPtr].x)+1ll*(c[i].y-c[masterPtr].y)*(c[i].y-c[masterPtr].y)>1ll*(c[masterPtr].r+c[i].r)*(c[masterPtr].r+c[i].r))continue;
                    ans[c[i].i]=c[masterPtr].i;
                    // cout<<"killed "<<c[i].i<<", killer: "<<c[masterPtr].i<<endl;
                    
                    if(c[i].i!=c[masterPtr].i)c[i].i=0;
                    ++killcount;
                }
            }
        }
        c[masterPtr].i=0;
    }
    for(int i=1;i<=n;++i){
        printf("%d ",ans[i]);
    }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 8 ms 7640 KB Output is correct
3 Correct 8 ms 7640 KB Output is correct
4 Correct 7 ms 7640 KB Output is correct
5 Correct 8 ms 7640 KB Output is correct
6 Correct 10 ms 7640 KB Output is correct
7 Correct 9 ms 7640 KB Output is correct
8 Correct 8 ms 7640 KB Output is correct
9 Correct 7 ms 7640 KB Output is correct
10 Correct 8 ms 7640 KB Output is correct
11 Correct 8 ms 7640 KB Output is correct
12 Correct 10 ms 7640 KB Output is correct
13 Correct 8 ms 7684 KB Output is correct
14 Correct 8 ms 7712 KB Output is correct
15 Correct 8 ms 7712 KB Output is correct
16 Correct 10 ms 7712 KB Output is correct
17 Correct 8 ms 7756 KB Output is correct
18 Correct 8 ms 7756 KB Output is correct
19 Correct 9 ms 7780 KB Output is correct
20 Correct 10 ms 7780 KB Output is correct
21 Correct 10 ms 7796 KB Output is correct
22 Correct 18 ms 8196 KB Output is correct
23 Correct 17 ms 8196 KB Output is correct
24 Correct 17 ms 8232 KB Output is correct
25 Correct 17 ms 8232 KB Output is correct
26 Correct 17 ms 8232 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 134 ms 16860 KB Output is correct
2 Correct 138 ms 17396 KB Output is correct
3 Correct 156 ms 17396 KB Output is correct
4 Correct 132 ms 17396 KB Output is correct
5 Correct 172 ms 18024 KB Output is correct
6 Correct 730 ms 28832 KB Output is correct
7 Correct 209 ms 28832 KB Output is correct
8 Correct 306 ms 28832 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 28832 KB Output is correct
2 Correct 392 ms 28832 KB Output is correct
3 Correct 1534 ms 42504 KB Output is correct
4 Correct 1560 ms 42512 KB Output is correct
5 Correct 1328 ms 42512 KB Output is correct
6 Correct 434 ms 42512 KB Output is correct
7 Correct 180 ms 42512 KB Output is correct
8 Correct 37 ms 42512 KB Output is correct
9 Correct 1398 ms 42512 KB Output is correct
10 Correct 1213 ms 42512 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1607 ms 42656 KB Output is correct
2 Correct 1572 ms 42656 KB Output is correct
3 Correct 547 ms 42656 KB Output is correct
4 Correct 1477 ms 42656 KB Output is correct
5 Correct 1685 ms 42656 KB Output is correct
6 Correct 195 ms 42656 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 8 ms 7640 KB Output is correct
3 Correct 8 ms 7640 KB Output is correct
4 Correct 7 ms 7640 KB Output is correct
5 Correct 8 ms 7640 KB Output is correct
6 Correct 10 ms 7640 KB Output is correct
7 Correct 9 ms 7640 KB Output is correct
8 Correct 8 ms 7640 KB Output is correct
9 Correct 7 ms 7640 KB Output is correct
10 Correct 8 ms 7640 KB Output is correct
11 Correct 8 ms 7640 KB Output is correct
12 Correct 10 ms 7640 KB Output is correct
13 Correct 8 ms 7684 KB Output is correct
14 Correct 8 ms 7712 KB Output is correct
15 Correct 8 ms 7712 KB Output is correct
16 Correct 10 ms 7712 KB Output is correct
17 Correct 8 ms 7756 KB Output is correct
18 Correct 8 ms 7756 KB Output is correct
19 Correct 9 ms 7780 KB Output is correct
20 Correct 10 ms 7780 KB Output is correct
21 Correct 10 ms 7796 KB Output is correct
22 Correct 18 ms 8196 KB Output is correct
23 Correct 17 ms 8196 KB Output is correct
24 Correct 17 ms 8232 KB Output is correct
25 Correct 17 ms 8232 KB Output is correct
26 Correct 17 ms 8232 KB Output is correct
27 Correct 12 ms 42656 KB Output is correct
28 Correct 12 ms 42656 KB Output is correct
29 Correct 12 ms 42656 KB Output is correct
30 Correct 27 ms 42656 KB Output is correct
31 Correct 27 ms 42656 KB Output is correct
32 Correct 26 ms 42656 KB Output is correct
33 Correct 52 ms 42656 KB Output is correct
34 Correct 49 ms 42656 KB Output is correct
35 Correct 53 ms 42656 KB Output is correct
36 Correct 364 ms 42656 KB Output is correct
37 Correct 408 ms 42656 KB Output is correct
38 Correct 510 ms 42656 KB Output is correct
39 Correct 394 ms 42656 KB Output is correct
40 Correct 306 ms 42656 KB Output is correct
41 Correct 301 ms 42656 KB Output is correct
42 Correct 283 ms 42656 KB Output is correct
43 Correct 335 ms 42656 KB Output is correct
44 Correct 345 ms 42656 KB Output is correct
45 Correct 288 ms 42656 KB Output is correct
46 Correct 307 ms 42656 KB Output is correct
47 Correct 279 ms 42656 KB Output is correct
48 Correct 308 ms 42656 KB Output is correct
49 Correct 408 ms 42656 KB Output is correct
50 Correct 454 ms 42656 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 7416 KB Output is correct
2 Correct 8 ms 7640 KB Output is correct
3 Correct 8 ms 7640 KB Output is correct
4 Correct 7 ms 7640 KB Output is correct
5 Correct 8 ms 7640 KB Output is correct
6 Correct 10 ms 7640 KB Output is correct
7 Correct 9 ms 7640 KB Output is correct
8 Correct 8 ms 7640 KB Output is correct
9 Correct 7 ms 7640 KB Output is correct
10 Correct 8 ms 7640 KB Output is correct
11 Correct 8 ms 7640 KB Output is correct
12 Correct 10 ms 7640 KB Output is correct
13 Correct 8 ms 7684 KB Output is correct
14 Correct 8 ms 7712 KB Output is correct
15 Correct 8 ms 7712 KB Output is correct
16 Correct 10 ms 7712 KB Output is correct
17 Correct 8 ms 7756 KB Output is correct
18 Correct 8 ms 7756 KB Output is correct
19 Correct 9 ms 7780 KB Output is correct
20 Correct 10 ms 7780 KB Output is correct
21 Correct 10 ms 7796 KB Output is correct
22 Correct 18 ms 8196 KB Output is correct
23 Correct 17 ms 8196 KB Output is correct
24 Correct 17 ms 8232 KB Output is correct
25 Correct 17 ms 8232 KB Output is correct
26 Correct 17 ms 8232 KB Output is correct
27 Correct 134 ms 16860 KB Output is correct
28 Correct 138 ms 17396 KB Output is correct
29 Correct 156 ms 17396 KB Output is correct
30 Correct 132 ms 17396 KB Output is correct
31 Correct 172 ms 18024 KB Output is correct
32 Correct 730 ms 28832 KB Output is correct
33 Correct 209 ms 28832 KB Output is correct
34 Correct 306 ms 28832 KB Output is correct
35 Correct 8 ms 28832 KB Output is correct
36 Correct 392 ms 28832 KB Output is correct
37 Correct 1534 ms 42504 KB Output is correct
38 Correct 1560 ms 42512 KB Output is correct
39 Correct 1328 ms 42512 KB Output is correct
40 Correct 434 ms 42512 KB Output is correct
41 Correct 180 ms 42512 KB Output is correct
42 Correct 37 ms 42512 KB Output is correct
43 Correct 1398 ms 42512 KB Output is correct
44 Correct 1213 ms 42512 KB Output is correct
45 Correct 1607 ms 42656 KB Output is correct
46 Correct 1572 ms 42656 KB Output is correct
47 Correct 547 ms 42656 KB Output is correct
48 Correct 1477 ms 42656 KB Output is correct
49 Correct 1685 ms 42656 KB Output is correct
50 Correct 195 ms 42656 KB Output is correct
51 Correct 12 ms 42656 KB Output is correct
52 Correct 12 ms 42656 KB Output is correct
53 Correct 12 ms 42656 KB Output is correct
54 Correct 27 ms 42656 KB Output is correct
55 Correct 27 ms 42656 KB Output is correct
56 Correct 26 ms 42656 KB Output is correct
57 Correct 52 ms 42656 KB Output is correct
58 Correct 49 ms 42656 KB Output is correct
59 Correct 53 ms 42656 KB Output is correct
60 Correct 364 ms 42656 KB Output is correct
61 Correct 408 ms 42656 KB Output is correct
62 Correct 510 ms 42656 KB Output is correct
63 Correct 394 ms 42656 KB Output is correct
64 Correct 306 ms 42656 KB Output is correct
65 Correct 301 ms 42656 KB Output is correct
66 Correct 283 ms 42656 KB Output is correct
67 Correct 335 ms 42656 KB Output is correct
68 Correct 345 ms 42656 KB Output is correct
69 Correct 288 ms 42656 KB Output is correct
70 Correct 307 ms 42656 KB Output is correct
71 Correct 279 ms 42656 KB Output is correct
72 Correct 308 ms 42656 KB Output is correct
73 Correct 408 ms 42656 KB Output is correct
74 Correct 454 ms 42656 KB Output is correct
75 Correct 162 ms 42656 KB Output is correct
76 Correct 135 ms 42656 KB Output is correct
77 Correct 142 ms 42656 KB Output is correct
78 Correct 142 ms 42656 KB Output is correct
79 Correct 181 ms 42656 KB Output is correct
80 Correct 134 ms 42656 KB Output is correct
81 Correct 1447 ms 42656 KB Output is correct
82 Correct 1565 ms 42656 KB Output is correct
83 Correct 1550 ms 42656 KB Output is correct
84 Correct 1432 ms 42656 KB Output is correct
85 Correct 1514 ms 42656 KB Output is correct
86 Correct 1422 ms 42656 KB Output is correct
87 Correct 1557 ms 42656 KB Output is correct
88 Correct 1349 ms 42656 KB Output is correct
89 Correct 1314 ms 42656 KB Output is correct
90 Correct 1272 ms 42656 KB Output is correct
91 Correct 1379 ms 42656 KB Output is correct
92 Correct 1187 ms 42656 KB Output is correct
93 Correct 1510 ms 42656 KB Output is correct
94 Correct 1627 ms 42656 KB Output is correct
95 Correct 1446 ms 42656 KB Output is correct
96 Correct 1533 ms 42656 KB Output is correct
97 Correct 1387 ms 42656 KB Output is correct
98 Correct 925 ms 42656 KB Output is correct
99 Correct 1663 ms 42656 KB Output is correct
100 Correct 1438 ms 42656 KB Output is correct
101 Correct 1151 ms 42656 KB Output is correct
102 Correct 1510 ms 42656 KB Output is correct
103 Correct 1919 ms 42656 KB Output is correct
104 Correct 1694 ms 42656 KB Output is correct
105 Correct 920 ms 42656 KB Output is correct
106 Correct 1267 ms 42656 KB Output is correct
107 Correct 1290 ms 42656 KB Output is correct
108 Correct 1210 ms 42656 KB Output is correct
109 Correct 1149 ms 42656 KB Output is correct
110 Correct 1201 ms 42656 KB Output is correct
111 Correct 1270 ms 42656 KB Output is correct
112 Correct 1390 ms 42656 KB Output is correct
113 Correct 1183 ms 42656 KB Output is correct
114 Correct 1332 ms 42656 KB Output is correct
115 Correct 1330 ms 42656 KB Output is correct
116 Correct 1245 ms 42656 KB Output is correct