poj 2932 Coneology（扫描线+set）

Coneology

Time Limit: 5000MS		Memory Limit: 65536K
Total Submissions: 3574		Accepted: 680

Description

A student named Round Square loved to play with cones. He would arrange cones with different base radii arbitrarily on the floor and would admire the intrinsic beauty of the arrangement. The student even began theorizing about how some cones dominate other cones: a cone A dominates another cone B when cone B is completely within the cone A. Furthermore, he noted that there are some cones that not only dominate others, but are themselves dominated, thus creating complex domination relations. After studying the intricate relations of the cones in more depth, the student reached an important conclusion: there exist some cones, all-powerful cones, that have unique properties: an all-powerful cone is not dominated by any other cone. The student became so impressed by the mightiness of the all-powerful cones that he decided to worship these all-powerful cones.

Unfortunately, after having arranged a huge number of cones and having worked hard on developing this grandiose cone theory, the student become quite confused with all these cones, and he now fears that he might worship the wrong cones (what if there is an evil cone that tries to trick the student into worshiping it?). You need to help this student by finding the cones he should worship.

Input

The input le specifies an arrangement of the cones. There are in total N cones (1 ≤ N ≤ 40000). Cone i has radius and height equal to R_i, i = 1 … N. Each cone is hollow on the inside and has no base, so it can be placed over another cone with smaller radius. No two cones touch.

The first line of the input contains the integer N. The next N lines each contain three real numbers R_i, x_i, y_i separated by spaces, where (x_i, y_i) are the coordinates of the center of the base of cone i.

Output

The first line of the output le should contain the number of cones that the student should worship. The second line contains the indices of the cones that the student should worship in increasing order. Two consecutive numbers should be separated by a single space.

Sample Input

5
1 0 -2
3 0 3
10 0 0
1 0 1.5
10 50 50

Sample Output

2
3 5

Source

MIT Programming Contest 2005

【思路】

扫描线

将一个园最左点与最右点看作事件，按从左向右的顺序扫描。

如果扫描到最左点则判断在其上方和下方且最近的圆的包含关系，当不被上下两圆包含时累计答案。

如果最右点则删除该圆。

用set组织数据以实现查找与删除的功能。

【代码】

 #include<set>
 #include<map>
 #include<cmath>
 #include<cstdlib>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #define mp(a,b) make_pair(a,b)
 #define FOR(a,b,c) for(int a=(b);a<=(c);a++)
 #define pr pair<double,int>
 using namespace std;

 const int N = +;

 double x[N],y[N],r[N];
 pr l[N*]; int tot;
 set<pr> S;
 set<pr> ::iterator it;
 int n,ans,vis[N];

 bool inside(int a,int b) {
     return (x[a]-x[b])*(x[a]-x[b])+(y[a]-y[b])*(y[a]-y[b])<=r[b]*r[b];
 }

 int main() {
     scanf("%d",&n);
     FOR(i,,n) scanf("%lf%lf%lf",&r[i],&x[i],&y[i]);
     FOR(i,,n) {
         l[++tot]=mp(x[i]-r[i],i);
         l[++tot]=mp(x[i]+r[i],i+n);
     }
     sort(l+,l+tot+);
     FOR(i,,tot) {
         int now=l[i].second;
         if(now<=n) {
             it=S.lower_bound(mp(y[now],now));
             if(it!=S.end() && inside(now,it->second)) continue;
             if(it!=S.begin() && inside(now,(--it)->second)) continue;
             vis[now]=; ans++;
             S.insert(mp(y[now],now));
         }
         else
             S.erase(mp(y[now-n],now-n));
     }
     printf("%d\n",ans);
     FOR(i,,n) if(vis[i]) printf("%d ",i);
     return ;
 }