hdu 1542 Atlantis

线段树+离散化+扫描线

照模板敲的

理解的还不是很好

 

// File Name: hdu1542.cpp
// Author: Toy
// Created Time: 2013年03月12日 星期二 19时29分13秒

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <cctype>
#include <cmath>
#include <string>
#include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#define L(x) x << 1
#define R(x) x << 1 | 1

using namespace std;

struct node {
    int st, ed, c;
    double m;
}ST[802];

struct line {
    double x, y1, y2;
    bool s;
}Line[205];

double y[205], ty[205];

void build ( int root, int st, int ed ) {
    ST[root].st = st;
    ST[root].ed = ed;
    ST[root].c = 0;
    ST[root].m = 0;
    if ( ed - st > 1 ) {
    int mid = ( st + ed ) / 2;
    build ( L ( root ), st, mid );
    build ( R ( root ), mid, ed );
    }
}

inline void updata ( int root ) {
    if ( ST[root].c > 0 ) ST[root].m = y[ST[root].ed - 1] - y[ST[root].st - 1];
    else if ( ST[root].ed - ST[root].st == 1 ) ST[root].m = 0;
    else ST[root].m = ST[L ( root )].m + ST[R ( root )].m;
}

void insert ( int root, int st, int ed ) {
    if ( st <= ST[root].st && ed >= ST[root].ed ) {
    ST[root].c++;
    updata ( root );
    return;
    }
    if ( ST[root].ed - ST[root].st == 1 ) return;
    int mid = ( ST[root].ed + ST[root].st ) / 2;
    if ( st < mid ) insert ( L ( root ), st, ed );
    if ( ed > mid ) insert ( R ( root ), st, ed );
    updata ( root );
}

void Delete ( int root, int st, int ed ) {
    if ( st <= ST[root].st && ed >= ST[root].ed ) {
    ST[root].c--;
    updata ( root );
    return;
    }
    if ( ST[root].ed - ST[root].st == 1 ) return;
    int mid = ( ST[root].st + ST[root].ed ) / 2;
    if ( st < mid ) Delete ( L ( root ), st, ed );
    if ( ed > mid ) Delete ( R ( root ), st, ed );
    updata ( root );
}

int Correspond ( int n, double t ) {
    int low, high, mid;
    low = 0; high = n - 1;
    while ( low < high ) {
         mid = ( low + high ) / 2;
         if ( t > y[mid] ) low = mid + 1;
         else high = mid;
    }
    return high + 1;
}

bool cmp ( line l1, line l2 ) {
    return l1.x < l2. x;
}

int main ( ) {
    //freopen ( "input.txt", "r", stdin );
    //freopen ( "output.txt", "w", stdout );
    int n, i, num, l, r, c = 0;
    double area, x1, x2, y1, y2;
    while ( scanf ( "%d", &n ) != EOF && n ) {
    for ( i = 0; i < n; ++i ) {
        cin >> x1 >> y1 >> x2 >> y2;
        Line[2 * i].x = x1, Line[2 * i].y1 = y1, Line[2 * i].y2 = y2, Line[2 * i].s = 1;
        Line[2 * i + 1].x = x2, Line[2 * i + 1].y1 = y1, Line[2 * i + 1].y2 = y2, Line[2 * i + 1].s = 0;
        ty[2 * i] = y1, ty[2 * i + 1] = y2;
    }

    n <<= 1;
    sort ( Line, Line + n, cmp );
    sort ( ty, ty + n );
    y[0] = ty[0];

    for ( i = num = 1; i < n; ++i ) 
        if ( ty[i] != ty[i - 1] ) y[num++] = ty[i];
    build ( 1, 1, num );
    area = 0;
    for ( i = 0; i < n - 1; ++i ) {
        l = Correspond ( num, Line[i].y1 );
        r = Correspond ( num, Line[i].y2 );
        if ( Line[i].s ) insert ( 1, l, r );
        else Delete ( 1, l, r );
        area += ST[1].m * ( Line[i + 1].x - Line[i].x );
    }
    printf ( "Test case #%d\nTotal explored area: ", ++c );
    printf ( "%.2f\n\n", area );
    }
    return 0;
}