답안 #51083 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
51083	2018-06-16T03:23:37 Z	edisonhello	원 고르기 (APIO18_circle_selection)	C++11	87 / 100	3000 ms	42600 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>=30000){
            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	8 ms	7416 KB	Output is correct
2	Correct	10 ms	7528 KB	Output is correct
3	Correct	8 ms	7552 KB	Output is correct
4	Correct	8 ms	7552 KB	Output is correct
5	Correct	9 ms	7552 KB	Output is correct
6	Correct	11 ms	7564 KB	Output is correct
7	Correct	8 ms	7584 KB	Output is correct
8	Correct	8 ms	7584 KB	Output is correct
9	Correct	8 ms	7584 KB	Output is correct
10	Correct	8 ms	7628 KB	Output is correct
11	Correct	8 ms	7628 KB	Output is correct
12	Correct	8 ms	7628 KB	Output is correct
13	Correct	10 ms	7628 KB	Output is correct
14	Correct	8 ms	7628 KB	Output is correct
15	Correct	8 ms	7628 KB	Output is correct
16	Correct	9 ms	7628 KB	Output is correct
17	Correct	9 ms	7628 KB	Output is correct
18	Correct	9 ms	7628 KB	Output is correct
19	Correct	10 ms	7756 KB	Output is correct
20	Correct	11 ms	7820 KB	Output is correct
21	Correct	10 ms	7908 KB	Output is correct
22	Correct	18 ms	8180 KB	Output is correct
23	Correct	17 ms	8208 KB	Output is correct
24	Correct	18 ms	8224 KB	Output is correct
25	Correct	17 ms	8224 KB	Output is correct
26	Correct	17 ms	8224 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	146 ms	16840 KB	Output is correct
2	Correct	158 ms	17300 KB	Output is correct
3	Correct	140 ms	17300 KB	Output is correct
4	Correct	148 ms	17300 KB	Output is correct
5	Correct	177 ms	17944 KB	Output is correct
6	Correct	653 ms	28980 KB	Output is correct
7	Correct	196 ms	28980 KB	Output is correct
8	Correct	274 ms	28980 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	9 ms	28980 KB	Output is correct
2	Correct	458 ms	28980 KB	Output is correct
3	Correct	1525 ms	42440 KB	Output is correct
4	Correct	1418 ms	42580 KB	Output is correct
5	Correct	1318 ms	42580 KB	Output is correct
6	Correct	444 ms	42580 KB	Output is correct
7	Correct	175 ms	42580 KB	Output is correct
8	Correct	33 ms	42580 KB	Output is correct
9	Correct	1486 ms	42580 KB	Output is correct
10	Correct	1341 ms	42580 KB	Output is correct

Subtask #4
23.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1732 ms	42580 KB	Output is correct
2	Correct	1705 ms	42580 KB	Output is correct
3	Correct	510 ms	42580 KB	Output is correct
4	Correct	1671 ms	42580 KB	Output is correct
5	Correct	1692 ms	42580 KB	Output is correct
6	Correct	262 ms	42580 KB	Output is correct

Subtask #5
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	7416 KB	Output is correct
2	Correct	10 ms	7528 KB	Output is correct
3	Correct	8 ms	7552 KB	Output is correct
4	Correct	8 ms	7552 KB	Output is correct
5	Correct	9 ms	7552 KB	Output is correct
6	Correct	11 ms	7564 KB	Output is correct
7	Correct	8 ms	7584 KB	Output is correct
8	Correct	8 ms	7584 KB	Output is correct
9	Correct	8 ms	7584 KB	Output is correct
10	Correct	8 ms	7628 KB	Output is correct
11	Correct	8 ms	7628 KB	Output is correct
12	Correct	8 ms	7628 KB	Output is correct
13	Correct	10 ms	7628 KB	Output is correct
14	Correct	8 ms	7628 KB	Output is correct
15	Correct	8 ms	7628 KB	Output is correct
16	Correct	9 ms	7628 KB	Output is correct
17	Correct	9 ms	7628 KB	Output is correct
18	Correct	9 ms	7628 KB	Output is correct
19	Correct	10 ms	7756 KB	Output is correct
20	Correct	11 ms	7820 KB	Output is correct
21	Correct	10 ms	7908 KB	Output is correct
22	Correct	18 ms	8180 KB	Output is correct
23	Correct	17 ms	8208 KB	Output is correct
24	Correct	18 ms	8224 KB	Output is correct
25	Correct	17 ms	8224 KB	Output is correct
26	Correct	17 ms	8224 KB	Output is correct
27	Correct	14 ms	42580 KB	Output is correct
28	Correct	14 ms	42580 KB	Output is correct
29	Correct	13 ms	42580 KB	Output is correct
30	Correct	35 ms	42580 KB	Output is correct
31	Correct	37 ms	42580 KB	Output is correct
32	Correct	31 ms	42580 KB	Output is correct
33	Correct	57 ms	42580 KB	Output is correct
34	Correct	55 ms	42580 KB	Output is correct
35	Correct	67 ms	42580 KB	Output is correct
36	Correct	499 ms	42580 KB	Output is correct
37	Correct	423 ms	42580 KB	Output is correct
38	Correct	418 ms	42580 KB	Output is correct
39	Correct	2903 ms	42580 KB	Output is correct
40	Correct	2920 ms	42580 KB	Output is correct
41	Correct	2800 ms	42580 KB	Output is correct
42	Correct	303 ms	42580 KB	Output is correct
43	Correct	427 ms	42580 KB	Output is correct
44	Correct	327 ms	42580 KB	Output is correct
45	Correct	347 ms	42580 KB	Output is correct
46	Correct	381 ms	42580 KB	Output is correct
47	Correct	356 ms	42580 KB	Output is correct
48	Correct	352 ms	42580 KB	Output is correct
49	Correct	352 ms	42580 KB	Output is correct
50	Correct	421 ms	42580 KB	Output is correct

Subtask #6
0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	7416 KB	Output is correct
2	Correct	10 ms	7528 KB	Output is correct
3	Correct	8 ms	7552 KB	Output is correct
4	Correct	8 ms	7552 KB	Output is correct
5	Correct	9 ms	7552 KB	Output is correct
6	Correct	11 ms	7564 KB	Output is correct
7	Correct	8 ms	7584 KB	Output is correct
8	Correct	8 ms	7584 KB	Output is correct
9	Correct	8 ms	7584 KB	Output is correct
10	Correct	8 ms	7628 KB	Output is correct
11	Correct	8 ms	7628 KB	Output is correct
12	Correct	8 ms	7628 KB	Output is correct
13	Correct	10 ms	7628 KB	Output is correct
14	Correct	8 ms	7628 KB	Output is correct
15	Correct	8 ms	7628 KB	Output is correct
16	Correct	9 ms	7628 KB	Output is correct
17	Correct	9 ms	7628 KB	Output is correct
18	Correct	9 ms	7628 KB	Output is correct
19	Correct	10 ms	7756 KB	Output is correct
20	Correct	11 ms	7820 KB	Output is correct
21	Correct	10 ms	7908 KB	Output is correct
22	Correct	18 ms	8180 KB	Output is correct
23	Correct	17 ms	8208 KB	Output is correct
24	Correct	18 ms	8224 KB	Output is correct
25	Correct	17 ms	8224 KB	Output is correct
26	Correct	17 ms	8224 KB	Output is correct
27	Correct	146 ms	16840 KB	Output is correct
28	Correct	158 ms	17300 KB	Output is correct
29	Correct	140 ms	17300 KB	Output is correct
30	Correct	148 ms	17300 KB	Output is correct
31	Correct	177 ms	17944 KB	Output is correct
32	Correct	653 ms	28980 KB	Output is correct
33	Correct	196 ms	28980 KB	Output is correct
34	Correct	274 ms	28980 KB	Output is correct
35	Correct	9 ms	28980 KB	Output is correct
36	Correct	458 ms	28980 KB	Output is correct
37	Correct	1525 ms	42440 KB	Output is correct
38	Correct	1418 ms	42580 KB	Output is correct
39	Correct	1318 ms	42580 KB	Output is correct
40	Correct	444 ms	42580 KB	Output is correct
41	Correct	175 ms	42580 KB	Output is correct
42	Correct	33 ms	42580 KB	Output is correct
43	Correct	1486 ms	42580 KB	Output is correct
44	Correct	1341 ms	42580 KB	Output is correct
45	Correct	1732 ms	42580 KB	Output is correct
46	Correct	1705 ms	42580 KB	Output is correct
47	Correct	510 ms	42580 KB	Output is correct
48	Correct	1671 ms	42580 KB	Output is correct
49	Correct	1692 ms	42580 KB	Output is correct
50	Correct	262 ms	42580 KB	Output is correct
51	Correct	14 ms	42580 KB	Output is correct
52	Correct	14 ms	42580 KB	Output is correct
53	Correct	13 ms	42580 KB	Output is correct
54	Correct	35 ms	42580 KB	Output is correct
55	Correct	37 ms	42580 KB	Output is correct
56	Correct	31 ms	42580 KB	Output is correct
57	Correct	57 ms	42580 KB	Output is correct
58	Correct	55 ms	42580 KB	Output is correct
59	Correct	67 ms	42580 KB	Output is correct
60	Correct	499 ms	42580 KB	Output is correct
61	Correct	423 ms	42580 KB	Output is correct
62	Correct	418 ms	42580 KB	Output is correct
63	Correct	2903 ms	42580 KB	Output is correct
64	Correct	2920 ms	42580 KB	Output is correct
65	Correct	2800 ms	42580 KB	Output is correct
66	Correct	303 ms	42580 KB	Output is correct
67	Correct	427 ms	42580 KB	Output is correct
68	Correct	327 ms	42580 KB	Output is correct
69	Correct	347 ms	42580 KB	Output is correct
70	Correct	381 ms	42580 KB	Output is correct
71	Correct	356 ms	42580 KB	Output is correct
72	Correct	352 ms	42580 KB	Output is correct
73	Correct	352 ms	42580 KB	Output is correct
74	Correct	421 ms	42580 KB	Output is correct
75	Correct	160 ms	42580 KB	Output is correct
76	Correct	161 ms	42580 KB	Output is correct
77	Correct	161 ms	42580 KB	Output is correct
78	Correct	204 ms	42580 KB	Output is correct
79	Correct	265 ms	42580 KB	Output is correct
80	Correct	139 ms	42580 KB	Output is correct
81	Correct	1574 ms	42580 KB	Output is correct
82	Correct	1517 ms	42580 KB	Output is correct
83	Correct	1542 ms	42580 KB	Output is correct
84	Correct	1388 ms	42580 KB	Output is correct
85	Correct	1488 ms	42600 KB	Output is correct
86	Correct	1596 ms	42600 KB	Output is correct
87	Correct	1470 ms	42600 KB	Output is correct
88	Execution timed out	3064 ms	42600 KB	Time limit exceeded
89	Halted	0 ms	0 KB	-

답안 #51083

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