답안 #51085 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
51085	2018-06-16T03:26:54 Z	edisonhello	원 고르기 (APIO18_circle_selection)	C++11	100 / 100	2083 ms	42728 KB

circle_selection

#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

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	7416 KB	Output is correct
2	Correct	7 ms	7516 KB	Output is correct
3	Correct	7 ms	7516 KB	Output is correct
4	Correct	8 ms	7516 KB	Output is correct
5	Correct	7 ms	7520 KB	Output is correct
6	Correct	8 ms	7520 KB	Output is correct
7	Correct	8 ms	7520 KB	Output is correct
8	Correct	7 ms	7520 KB	Output is correct
9	Correct	7 ms	7520 KB	Output is correct
10	Correct	7 ms	7520 KB	Output is correct
11	Correct	7 ms	7552 KB	Output is correct
12	Correct	7 ms	7552 KB	Output is correct
13	Correct	9 ms	7552 KB	Output is correct
14	Correct	8 ms	7552 KB	Output is correct
15	Correct	8 ms	7552 KB	Output is correct
16	Correct	8 ms	7564 KB	Output is correct
17	Correct	8 ms	7564 KB	Output is correct
18	Correct	7 ms	7564 KB	Output is correct
19	Correct	9 ms	7716 KB	Output is correct
20	Correct	9 ms	7760 KB	Output is correct
21	Correct	9 ms	7784 KB	Output is correct
22	Correct	16 ms	8184 KB	Output is correct
23	Correct	17 ms	8308 KB	Output is correct
24	Correct	17 ms	8308 KB	Output is correct
25	Correct	18 ms	8308 KB	Output is correct
26	Correct	16 ms	8344 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	116 ms	16900 KB	Output is correct
2	Correct	122 ms	17236 KB	Output is correct
3	Correct	144 ms	17236 KB	Output is correct
4	Correct	118 ms	17236 KB	Output is correct
5	Correct	170 ms	18056 KB	Output is correct
6	Correct	875 ms	28876 KB	Output is correct
7	Correct	240 ms	28876 KB	Output is correct
8	Correct	385 ms	28876 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	28876 KB	Output is correct
2	Correct	594 ms	28876 KB	Output is correct
3	Correct	1770 ms	42496 KB	Output is correct
4	Correct	1796 ms	42552 KB	Output is correct
5	Correct	1414 ms	42552 KB	Output is correct
6	Correct	442 ms	42552 KB	Output is correct
7	Correct	184 ms	42552 KB	Output is correct
8	Correct	29 ms	42552 KB	Output is correct
9	Correct	1562 ms	42552 KB	Output is correct
10	Correct	1323 ms	42552 KB	Output is correct

Subtask #4
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1870 ms	42704 KB	Output is correct
2	Correct	1967 ms	42704 KB	Output is correct
3	Correct	447 ms	42704 KB	Output is correct
4	Correct	1796 ms	42724 KB	Output is correct
5	Correct	2083 ms	42728 KB	Output is correct
6	Correct	183 ms	42728 KB	Output is correct

Subtask #5
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	7416 KB	Output is correct
2	Correct	7 ms	7516 KB	Output is correct
3	Correct	7 ms	7516 KB	Output is correct
4	Correct	8 ms	7516 KB	Output is correct
5	Correct	7 ms	7520 KB	Output is correct
6	Correct	8 ms	7520 KB	Output is correct
7	Correct	8 ms	7520 KB	Output is correct
8	Correct	7 ms	7520 KB	Output is correct
9	Correct	7 ms	7520 KB	Output is correct
10	Correct	7 ms	7520 KB	Output is correct
11	Correct	7 ms	7552 KB	Output is correct
12	Correct	7 ms	7552 KB	Output is correct
13	Correct	9 ms	7552 KB	Output is correct
14	Correct	8 ms	7552 KB	Output is correct
15	Correct	8 ms	7552 KB	Output is correct
16	Correct	8 ms	7564 KB	Output is correct
17	Correct	8 ms	7564 KB	Output is correct
18	Correct	7 ms	7564 KB	Output is correct
19	Correct	9 ms	7716 KB	Output is correct
20	Correct	9 ms	7760 KB	Output is correct
21	Correct	9 ms	7784 KB	Output is correct
22	Correct	16 ms	8184 KB	Output is correct
23	Correct	17 ms	8308 KB	Output is correct
24	Correct	17 ms	8308 KB	Output is correct
25	Correct	18 ms	8308 KB	Output is correct
26	Correct	16 ms	8344 KB	Output is correct
27	Correct	11 ms	42728 KB	Output is correct
28	Correct	11 ms	42728 KB	Output is correct
29	Correct	11 ms	42728 KB	Output is correct
30	Correct	30 ms	42728 KB	Output is correct
31	Correct	38 ms	42728 KB	Output is correct
32	Correct	30 ms	42728 KB	Output is correct
33	Correct	49 ms	42728 KB	Output is correct
34	Correct	44 ms	42728 KB	Output is correct
35	Correct	53 ms	42728 KB	Output is correct
36	Correct	484 ms	42728 KB	Output is correct
37	Correct	472 ms	42728 KB	Output is correct
38	Correct	490 ms	42728 KB	Output is correct
39	Correct	421 ms	42728 KB	Output is correct
40	Correct	523 ms	42728 KB	Output is correct
41	Correct	447 ms	42728 KB	Output is correct
42	Correct	403 ms	42728 KB	Output is correct
43	Correct	648 ms	42728 KB	Output is correct
44	Correct	456 ms	42728 KB	Output is correct
45	Correct	557 ms	42728 KB	Output is correct
46	Correct	546 ms	42728 KB	Output is correct
47	Correct	458 ms	42728 KB	Output is correct
48	Correct	560 ms	42728 KB	Output is correct
49	Correct	481 ms	42728 KB	Output is correct
50	Correct	447 ms	42728 KB	Output is correct

Subtask #6
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	7416 KB	Output is correct
2	Correct	7 ms	7516 KB	Output is correct
3	Correct	7 ms	7516 KB	Output is correct
4	Correct	8 ms	7516 KB	Output is correct
5	Correct	7 ms	7520 KB	Output is correct
6	Correct	8 ms	7520 KB	Output is correct
7	Correct	8 ms	7520 KB	Output is correct
8	Correct	7 ms	7520 KB	Output is correct
9	Correct	7 ms	7520 KB	Output is correct
10	Correct	7 ms	7520 KB	Output is correct
11	Correct	7 ms	7552 KB	Output is correct
12	Correct	7 ms	7552 KB	Output is correct
13	Correct	9 ms	7552 KB	Output is correct
14	Correct	8 ms	7552 KB	Output is correct
15	Correct	8 ms	7552 KB	Output is correct
16	Correct	8 ms	7564 KB	Output is correct
17	Correct	8 ms	7564 KB	Output is correct
18	Correct	7 ms	7564 KB	Output is correct
19	Correct	9 ms	7716 KB	Output is correct
20	Correct	9 ms	7760 KB	Output is correct
21	Correct	9 ms	7784 KB	Output is correct
22	Correct	16 ms	8184 KB	Output is correct
23	Correct	17 ms	8308 KB	Output is correct
24	Correct	17 ms	8308 KB	Output is correct
25	Correct	18 ms	8308 KB	Output is correct
26	Correct	16 ms	8344 KB	Output is correct
27	Correct	116 ms	16900 KB	Output is correct
28	Correct	122 ms	17236 KB	Output is correct
29	Correct	144 ms	17236 KB	Output is correct
30	Correct	118 ms	17236 KB	Output is correct
31	Correct	170 ms	18056 KB	Output is correct
32	Correct	875 ms	28876 KB	Output is correct
33	Correct	240 ms	28876 KB	Output is correct
34	Correct	385 ms	28876 KB	Output is correct
35	Correct	9 ms	28876 KB	Output is correct
36	Correct	594 ms	28876 KB	Output is correct
37	Correct	1770 ms	42496 KB	Output is correct
38	Correct	1796 ms	42552 KB	Output is correct
39	Correct	1414 ms	42552 KB	Output is correct
40	Correct	442 ms	42552 KB	Output is correct
41	Correct	184 ms	42552 KB	Output is correct
42	Correct	29 ms	42552 KB	Output is correct
43	Correct	1562 ms	42552 KB	Output is correct
44	Correct	1323 ms	42552 KB	Output is correct
45	Correct	1870 ms	42704 KB	Output is correct
46	Correct	1967 ms	42704 KB	Output is correct
47	Correct	447 ms	42704 KB	Output is correct
48	Correct	1796 ms	42724 KB	Output is correct
49	Correct	2083 ms	42728 KB	Output is correct
50	Correct	183 ms	42728 KB	Output is correct
51	Correct	11 ms	42728 KB	Output is correct
52	Correct	11 ms	42728 KB	Output is correct
53	Correct	11 ms	42728 KB	Output is correct
54	Correct	30 ms	42728 KB	Output is correct
55	Correct	38 ms	42728 KB	Output is correct
56	Correct	30 ms	42728 KB	Output is correct
57	Correct	49 ms	42728 KB	Output is correct
58	Correct	44 ms	42728 KB	Output is correct
59	Correct	53 ms	42728 KB	Output is correct
60	Correct	484 ms	42728 KB	Output is correct
61	Correct	472 ms	42728 KB	Output is correct
62	Correct	490 ms	42728 KB	Output is correct
63	Correct	421 ms	42728 KB	Output is correct
64	Correct	523 ms	42728 KB	Output is correct
65	Correct	447 ms	42728 KB	Output is correct
66	Correct	403 ms	42728 KB	Output is correct
67	Correct	648 ms	42728 KB	Output is correct
68	Correct	456 ms	42728 KB	Output is correct
69	Correct	557 ms	42728 KB	Output is correct
70	Correct	546 ms	42728 KB	Output is correct
71	Correct	458 ms	42728 KB	Output is correct
72	Correct	560 ms	42728 KB	Output is correct
73	Correct	481 ms	42728 KB	Output is correct
74	Correct	447 ms	42728 KB	Output is correct
75	Correct	140 ms	42728 KB	Output is correct
76	Correct	132 ms	42728 KB	Output is correct
77	Correct	157 ms	42728 KB	Output is correct
78	Correct	130 ms	42728 KB	Output is correct
79	Correct	177 ms	42728 KB	Output is correct
80	Correct	130 ms	42728 KB	Output is correct
81	Correct	1803 ms	42728 KB	Output is correct
82	Correct	1831 ms	42728 KB	Output is correct
83	Correct	1788 ms	42728 KB	Output is correct
84	Correct	1712 ms	42728 KB	Output is correct
85	Correct	1656 ms	42728 KB	Output is correct
86	Correct	1637 ms	42728 KB	Output is correct
87	Correct	1686 ms	42728 KB	Output is correct
88	Correct	1195 ms	42728 KB	Output is correct
89	Correct	1219 ms	42728 KB	Output is correct
90	Correct	1240 ms	42728 KB	Output is correct
91	Correct	1275 ms	42728 KB	Output is correct
92	Correct	1221 ms	42728 KB	Output is correct
93	Correct	1759 ms	42728 KB	Output is correct
94	Correct	1702 ms	42728 KB	Output is correct
95	Correct	1709 ms	42728 KB	Output is correct
96	Correct	1985 ms	42728 KB	Output is correct
97	Correct	1757 ms	42728 KB	Output is correct
98	Correct	948 ms	42728 KB	Output is correct
99	Correct	1810 ms	42728 KB	Output is correct
100	Correct	1740 ms	42728 KB	Output is correct
101	Correct	1081 ms	42728 KB	Output is correct
102	Correct	1581 ms	42728 KB	Output is correct
103	Correct	1500 ms	42728 KB	Output is correct
104	Correct	1602 ms	42728 KB	Output is correct
105	Correct	865 ms	42728 KB	Output is correct
106	Correct	1446 ms	42728 KB	Output is correct
107	Correct	1291 ms	42728 KB	Output is correct
108	Correct	1375 ms	42728 KB	Output is correct
109	Correct	1293 ms	42728 KB	Output is correct
110	Correct	1574 ms	42728 KB	Output is correct
111	Correct	1402 ms	42728 KB	Output is correct
112	Correct	1304 ms	42728 KB	Output is correct
113	Correct	1277 ms	42728 KB	Output is correct
114	Correct	1373 ms	42728 KB	Output is correct
115	Correct	1348 ms	42728 KB	Output is correct
116	Correct	1425 ms	42728 KB	Output is correct

답안 #51085

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 12.0 / 12.0

Subtask #3 15.0 / 15.0

Subtask #4 23.0 / 23.0

Subtask #5 30.0 / 30.0

Subtask #6 13.0 / 13.0

Subtask #1
7.0 / 7.0

Subtask #2
12.0 / 12.0

Subtask #3
15.0 / 15.0

Subtask #4
23.0 / 23.0

Subtask #5
30.0 / 30.0

Subtask #6
13.0 / 13.0