답안 #51082 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
51082	2018-06-16T03:22:08 Z	edisonhello	원 고르기 (APIO18_circle_selection)	C++11	87 / 100	3000 ms	42608 KB

circle_selection

#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>=10000){
            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	9 ms	7420 KB	Output is correct
2	Correct	13 ms	7524 KB	Output is correct
3	Correct	9 ms	7552 KB	Output is correct
4	Correct	9 ms	7552 KB	Output is correct
5	Correct	9 ms	7552 KB	Output is correct
6	Correct	8 ms	7552 KB	Output is correct
7	Correct	9 ms	7552 KB	Output is correct
8	Correct	9 ms	7552 KB	Output is correct
9	Correct	9 ms	7568 KB	Output is correct
10	Correct	10 ms	7568 KB	Output is correct
11	Correct	8 ms	7568 KB	Output is correct
12	Correct	8 ms	7640 KB	Output is correct
13	Correct	8 ms	7640 KB	Output is correct
14	Correct	11 ms	7640 KB	Output is correct
15	Correct	9 ms	7640 KB	Output is correct
16	Correct	8 ms	7640 KB	Output is correct
17	Correct	9 ms	7640 KB	Output is correct
18	Correct	10 ms	7640 KB	Output is correct
19	Correct	10 ms	7764 KB	Output is correct
20	Correct	10 ms	7764 KB	Output is correct
21	Correct	11 ms	7764 KB	Output is correct
22	Correct	18 ms	8176 KB	Output is correct
23	Correct	18 ms	8196 KB	Output is correct
24	Correct	19 ms	8196 KB	Output is correct
25	Correct	18 ms	8196 KB	Output is correct
26	Correct	18 ms	8196 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	152 ms	16804 KB	Output is correct
2	Correct	157 ms	17356 KB	Output is correct
3	Correct	147 ms	17356 KB	Output is correct
4	Correct	134 ms	17356 KB	Output is correct
5	Correct	167 ms	17956 KB	Output is correct
6	Correct	690 ms	28900 KB	Output is correct
7	Correct	199 ms	28900 KB	Output is correct
8	Correct	319 ms	28900 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	28900 KB	Output is correct
2	Correct	482 ms	28900 KB	Output is correct
3	Correct	1646 ms	42476 KB	Output is correct
4	Correct	1543 ms	42572 KB	Output is correct
5	Correct	1267 ms	42572 KB	Output is correct
6	Correct	407 ms	42572 KB	Output is correct
7	Correct	217 ms	42572 KB	Output is correct
8	Correct	39 ms	42572 KB	Output is correct
9	Correct	1659 ms	42572 KB	Output is correct
10	Correct	1181 ms	42572 KB	Output is correct

Subtask #4
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1518 ms	42572 KB	Output is correct
2	Correct	1453 ms	42572 KB	Output is correct
3	Correct	513 ms	42572 KB	Output is correct
4	Correct	1519 ms	42580 KB	Output is correct
5	Correct	1533 ms	42580 KB	Output is correct
6	Correct	198 ms	42580 KB	Output is correct

Subtask #5
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	7420 KB	Output is correct
2	Correct	13 ms	7524 KB	Output is correct
3	Correct	9 ms	7552 KB	Output is correct
4	Correct	9 ms	7552 KB	Output is correct
5	Correct	9 ms	7552 KB	Output is correct
6	Correct	8 ms	7552 KB	Output is correct
7	Correct	9 ms	7552 KB	Output is correct
8	Correct	9 ms	7552 KB	Output is correct
9	Correct	9 ms	7568 KB	Output is correct
10	Correct	10 ms	7568 KB	Output is correct
11	Correct	8 ms	7568 KB	Output is correct
12	Correct	8 ms	7640 KB	Output is correct
13	Correct	8 ms	7640 KB	Output is correct
14	Correct	11 ms	7640 KB	Output is correct
15	Correct	9 ms	7640 KB	Output is correct
16	Correct	8 ms	7640 KB	Output is correct
17	Correct	9 ms	7640 KB	Output is correct
18	Correct	10 ms	7640 KB	Output is correct
19	Correct	10 ms	7764 KB	Output is correct
20	Correct	10 ms	7764 KB	Output is correct
21	Correct	11 ms	7764 KB	Output is correct
22	Correct	18 ms	8176 KB	Output is correct
23	Correct	18 ms	8196 KB	Output is correct
24	Correct	19 ms	8196 KB	Output is correct
25	Correct	18 ms	8196 KB	Output is correct
26	Correct	18 ms	8196 KB	Output is correct
27	Correct	15 ms	42580 KB	Output is correct
28	Correct	12 ms	42580 KB	Output is correct
29	Correct	12 ms	42580 KB	Output is correct
30	Correct	30 ms	42580 KB	Output is correct
31	Correct	32 ms	42580 KB	Output is correct
32	Correct	29 ms	42580 KB	Output is correct
33	Correct	55 ms	42580 KB	Output is correct
34	Correct	50 ms	42580 KB	Output is correct
35	Correct	58 ms	42580 KB	Output is correct
36	Correct	492 ms	42580 KB	Output is correct
37	Correct	419 ms	42580 KB	Output is correct
38	Correct	355 ms	42580 KB	Output is correct
39	Correct	881 ms	42580 KB	Output is correct
40	Correct	891 ms	42580 KB	Output is correct
41	Correct	908 ms	42580 KB	Output is correct
42	Correct	260 ms	42580 KB	Output is correct
43	Correct	385 ms	42580 KB	Output is correct
44	Correct	399 ms	42580 KB	Output is correct
45	Correct	342 ms	42580 KB	Output is correct
46	Correct	400 ms	42580 KB	Output is correct
47	Correct	417 ms	42580 KB	Output is correct
48	Correct	418 ms	42580 KB	Output is correct
49	Correct	568 ms	42580 KB	Output is correct
50	Correct	446 ms	42580 KB	Output is correct

Subtask #6
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	7420 KB	Output is correct
2	Correct	13 ms	7524 KB	Output is correct
3	Correct	9 ms	7552 KB	Output is correct
4	Correct	9 ms	7552 KB	Output is correct
5	Correct	9 ms	7552 KB	Output is correct
6	Correct	8 ms	7552 KB	Output is correct
7	Correct	9 ms	7552 KB	Output is correct
8	Correct	9 ms	7552 KB	Output is correct
9	Correct	9 ms	7568 KB	Output is correct
10	Correct	10 ms	7568 KB	Output is correct
11	Correct	8 ms	7568 KB	Output is correct
12	Correct	8 ms	7640 KB	Output is correct
13	Correct	8 ms	7640 KB	Output is correct
14	Correct	11 ms	7640 KB	Output is correct
15	Correct	9 ms	7640 KB	Output is correct
16	Correct	8 ms	7640 KB	Output is correct
17	Correct	9 ms	7640 KB	Output is correct
18	Correct	10 ms	7640 KB	Output is correct
19	Correct	10 ms	7764 KB	Output is correct
20	Correct	10 ms	7764 KB	Output is correct
21	Correct	11 ms	7764 KB	Output is correct
22	Correct	18 ms	8176 KB	Output is correct
23	Correct	18 ms	8196 KB	Output is correct
24	Correct	19 ms	8196 KB	Output is correct
25	Correct	18 ms	8196 KB	Output is correct
26	Correct	18 ms	8196 KB	Output is correct
27	Correct	152 ms	16804 KB	Output is correct
28	Correct	157 ms	17356 KB	Output is correct
29	Correct	147 ms	17356 KB	Output is correct
30	Correct	134 ms	17356 KB	Output is correct
31	Correct	167 ms	17956 KB	Output is correct
32	Correct	690 ms	28900 KB	Output is correct
33	Correct	199 ms	28900 KB	Output is correct
34	Correct	319 ms	28900 KB	Output is correct
35	Correct	8 ms	28900 KB	Output is correct
36	Correct	482 ms	28900 KB	Output is correct
37	Correct	1646 ms	42476 KB	Output is correct
38	Correct	1543 ms	42572 KB	Output is correct
39	Correct	1267 ms	42572 KB	Output is correct
40	Correct	407 ms	42572 KB	Output is correct
41	Correct	217 ms	42572 KB	Output is correct
42	Correct	39 ms	42572 KB	Output is correct
43	Correct	1659 ms	42572 KB	Output is correct
44	Correct	1181 ms	42572 KB	Output is correct
45	Correct	1518 ms	42572 KB	Output is correct
46	Correct	1453 ms	42572 KB	Output is correct
47	Correct	513 ms	42572 KB	Output is correct
48	Correct	1519 ms	42580 KB	Output is correct
49	Correct	1533 ms	42580 KB	Output is correct
50	Correct	198 ms	42580 KB	Output is correct
51	Correct	15 ms	42580 KB	Output is correct
52	Correct	12 ms	42580 KB	Output is correct
53	Correct	12 ms	42580 KB	Output is correct
54	Correct	30 ms	42580 KB	Output is correct
55	Correct	32 ms	42580 KB	Output is correct
56	Correct	29 ms	42580 KB	Output is correct
57	Correct	55 ms	42580 KB	Output is correct
58	Correct	50 ms	42580 KB	Output is correct
59	Correct	58 ms	42580 KB	Output is correct
60	Correct	492 ms	42580 KB	Output is correct
61	Correct	419 ms	42580 KB	Output is correct
62	Correct	355 ms	42580 KB	Output is correct
63	Correct	881 ms	42580 KB	Output is correct
64	Correct	891 ms	42580 KB	Output is correct
65	Correct	908 ms	42580 KB	Output is correct
66	Correct	260 ms	42580 KB	Output is correct
67	Correct	385 ms	42580 KB	Output is correct
68	Correct	399 ms	42580 KB	Output is correct
69	Correct	342 ms	42580 KB	Output is correct
70	Correct	400 ms	42580 KB	Output is correct
71	Correct	417 ms	42580 KB	Output is correct
72	Correct	418 ms	42580 KB	Output is correct
73	Correct	568 ms	42580 KB	Output is correct
74	Correct	446 ms	42580 KB	Output is correct
75	Correct	191 ms	42580 KB	Output is correct
76	Correct	149 ms	42580 KB	Output is correct
77	Correct	140 ms	42580 KB	Output is correct
78	Correct	134 ms	42580 KB	Output is correct
79	Correct	188 ms	42580 KB	Output is correct
80	Correct	134 ms	42580 KB	Output is correct
81	Correct	1555 ms	42580 KB	Output is correct
82	Correct	1554 ms	42580 KB	Output is correct
83	Correct	1424 ms	42584 KB	Output is correct
84	Correct	1399 ms	42584 KB	Output is correct
85	Correct	1404 ms	42584 KB	Output is correct
86	Correct	1502 ms	42608 KB	Output is correct
87	Correct	1478 ms	42608 KB	Output is correct
88	Execution timed out	3030 ms	42608 KB	Time limit exceeded
89	Halted	0 ms	0 KB	-

답안 #51082

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 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
0 / 13.0