hdu 1255 覆盖的面积 (Bruceforce)

Problem - 1255

　　暴力统计覆盖超过一次的区域。1y。

代码如下：

 #include <cstdio>
 #include <cstring>
 #include <cmath>
 #include <iostream>
 #include <algorithm>
 #include <set>

 using namespace std;

 typedef pair<double, int> PDBI;
 multiset<PDBI> pos;
 #define MPR make_pair
 #define FI first
 #define SE second
 const int N = ;
 double rec[N][];

 struct Mark {
     double x1, x2, y;
     bool end;
     Mark() {}
     Mark(double x1, double x2, double y, bool end) :
         x1(x1), x2(x2), y(y), end(end) {}
     bool operator < (Mark x) const { return y < x.y;}
 } mk[N << ];

 int main() {
     int n, T;
     cin >> T;
     while (T-- &&  cin >> n) {
         for (int i = ; i < n; i++) {
             for (int j = ; j < ; j++) {
                 cin >> rec[i][j];
             }
             if (rec[i][] > rec[i][]) swap(rec[i][], rec[i][]);
             if (rec[i][] > rec[i][]) swap(rec[i][], rec[i][]);
             mk[i << ] = Mark(rec[i][], rec[i][], rec[i][], false);
             mk[i <<  | ] = Mark(rec[i][], rec[i][], rec[i][], true);
         }
         sort(mk, mk + (n << ));
         pos.clear();
         if (mk[].end) {
             puts("WTF?!!");
             while () {}
         }
         pos.insert(MPR(mk[].x1, ));
         pos.insert(MPR(mk[].x2, -));
         multiset<PDBI>::iterator msi;
         double area = 0.0;
         for (int i = , end = n << ; i < end; i++) {
             msi = pos.begin();
             int cnt = ;
             double last, sum = 0.0;
             while (msi != pos.end()) {
                 double fi = (*msi).FI;
                 int se = (*msi).SE;
                 if (se > ) {
                     cnt++;
                     if (cnt == ) last = fi;
                 } else {
                     cnt--;
                     if (cnt == ) sum += fi - last;
                 }
                 msi++;
             }
             area += sum * (mk[i].y - mk[i - ].y);
             if (mk[i].end) {
                 pos.erase(pos.find(MPR(mk[i].x1, )));
                 pos.erase(pos.find(MPR(mk[i].x2, -)));
             } else {
                 pos.insert(MPR(mk[i].x1, ));
                 pos.insert(MPR(mk[i].x2, -));
             }
         }
         if (pos.size()) {
             puts("shit!");
             while () {}
         }
         printf("%.2f\n", area);
     }
     return ;
 }

——written by Lyon