1151 Atlantis 解题报告

 让人很崩溃的一题，我觉得自己用错方法了，居然写了3000+B的代码,写完都ft了...虽说比波哥的快了32ms,但是他的只有2500-B的代码啊,加上他爱开空行的习惯真不懂我比他多写了多少,ft again. 出乎意料的顺利地几乎1y ,出了个pe,ft once more

下面是代码

#include<algorithm> #include<stdlib.h> #include<stdio.h> #include<math.h> using namespace std; #define M 110 #define MUL -1 struct TNode{ int left,right; int up,down; double area; }; TNode sq[4*M]; float x[2*M],y[2*M]; int xsz,ysz; int findx(double want) { int left(0),right(xsz); int mid = (left + right) >> 1; while(fabs(x[mid] - want) > 10e-4) { if(x[mid] > want) right = mid; else left = mid; mid = (left + right) >> 1; } return mid; } int findy(double want) { int left(0),right(ysz); int mid = (left + right) >> 1; while(fabs(y[mid] - want) > 10e-4) { if(y[mid] > want) right = mid; else left = mid; mid = (left + right) >> 1; } return mid; } void Build(int s,int t,int step) { sq[step].left = s; sq[step].right = t; sq[step].up = 0; sq[step].down = 0; sq[step].area = 0.0; if((s + 1) == t) return; int mid = (s + t) >> 1; Build(s,mid,step*2); Build(mid,t,step*2+1); } void Insert(int s, int t,int step,int u,int d) { if(sq[step].left == s && sq[step].right == t && sq[step].up != MUL) { if(u >= sq[step].down) { //如果这个位置 之前的square与现在插入的square不相交则将面积记录下来,更新up和down sq[step].area += ( x[sq[step].right] - x[sq[step].left]) * (y[sq[step].down] - y[sq[step].up]); sq[step].up = u; sq[step].down = d; } else sq[step].down = d; return; } if(sq[step].up != MUL) { sq[step*2].up = sq[step].up; sq[step*2+1].up = sq[step].up; sq[step*2].down = sq[step].down; sq[step*2+1].down = sq[step].down; sq[step].up = MUL; } int mid = (sq[step].left + sq[step].right ) >> 1; if(mid >= t) Insert(s,t,step*2,u,d); else if(mid <= s) Insert(s,t,step*2+1,u,d); else { Insert(s,mid,step*2,u,d); Insert(mid,t,step*2+1,u,d); } } double res(0.0); void Count(int step) { if(sq[step].up != MUL) { res += (x[sq[step].right] - x[sq[step].left]) * (y[sq[step].down] - y[sq[step].up]); res += sq[step].area; } else { res += sq[step].area; Count(step*2); Count(step*2+1); } } struct Map{ double x1,y1,x2,y2; bool operator()(Map a,Map b) { if(a.y1 == b.y1) return a.y2 < b.y2; else return a.y1 < b.y1; } }; int main() { int n,time(1); Map map[M]; while(scanf("%d",&n) && n) { res = 0.0; for(int i = 0; i < n; i++) { scanf("%f%f%f%f",&(x[i]),&(y[i]),&(x[i+n]),&(y[i+n])); map[i].x1 = x[i]; map[i].x2 = x[i+n]; map[i].y1 = y[i]; map[i].y2 = y[i+n]; } //先对map进行排序 sort(map,map+n,Map()); //将x和y里面的重复的值去掉 sort(x,x+2*n); sort(y,y+2*n); int index = 1; for(int i = 1; i < 2*n ; i++) if(x[i] != x[i-1]) x[index++] = x[i]; xsz = index; index = 1; for(int i = 1; i < 2*n; i++) if(y[i] != y[i-1]) y[index++] = y[i]; ysz = index; //建树 Build(0,xsz-1,1); for(int i = 0; i < n; i++) //按下标插入 Insert(findx(map[i].x1),findx(map[i].x2),1,findy(map[i].y1),findy(map[i].y2)); Count(1); printf("Test case #%d/n",time++); printf("Total explored area: %.2f/n/n",res); } return 0; } // suikay 348K 0MS G++