树状数组 + 扫描线 ---- BZOJ1818[内部白点][树状数组+扫描线]

最新推荐文章于 2021-08-09 22:27:05 发布

黑夜和白天

最新推荐文章于 2021-08-09 22:27:05 发布

阅读量126

点赞数

分类专栏： # 树状数组 # 扫描线文章标签：算法

本文链接：https://blog.csdn.net/weixin_45630722/article/details/109286865

版权

树状数组同时被 2 个专栏收录

12 篇文章 0 订阅

订阅专栏

扫描线

6 篇文章 0 订阅

订阅专栏

题目链接

中文题目不再赘述

解题思路：很明显所谓把白点变成黑点，就可以看成两个线段的交点，那么求线段交点的个数我们就可以用扫描线，但是现在有一个问题就是可能你任取两点构成的线段线段的端点会重复计算那么我们可以将区间缩小左右端点直接统计有效区域

#include<bits/stdc++.h>
#define mid ((l + r) >> 1)
#define Lson rt << 1, l , mid
#define Rson rt << 1|1, mid + 1, r
#define ms(a,al) memset(a,al,sizeof(a))
#define log2(a) log(a)/log(2)
#define _for(i,a,b) for( int i = (a); i < (b); ++i)
#define _rep(i,a,b) for( int i = (a); i <= (b); ++i)
#define for_(i,a,b) for( int i = (a); i >= (b); -- i)
#define rep_(i,a,b) for( int i = (a); i > (b); -- i)
#define lowbit(x) ((-x) & x)
#define IOS std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INF 0x3f3f3f3f
#define LLF 0x3f3f3f3f3f3f3f3f
#define hash Hash
#define next Next
#define pb push_back
#define f first
#define s second
#define y1 Y
using namespace std;
const int N = 1e7 + 10, mod = 1e9 + 7;
const int maxn = 4e5 + 10;
const long double eps = 1e-5;
const int EPS = 500 * 500;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef pair<ll,ll> PLL;
typedef pair<double,double> PDD;
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args)
{
    read(first);
    read(args...);
}
int n;
PII Point[maxn];
vector<int> lisan;
inline int getid(int x) {return lower_bound(lisan.begin(),lisan.end(),x)-lisan.begin()+1;}

vector<int> G;
int minX[maxn], maxX[maxn];
int yLine[maxn];
struct Line {
   int x,  y, inorout;
   bool operator < (const Line & a) const {
      return x < a.x;
   }
}line[maxn];
int cnt = 0;
//..............................................
int BIT[maxn];

inline void add(int x, int val) {
   while(x < maxn) {
      BIT[x] += val;
      x += lowbit(x);
   }
}

inline int sum(int x) {
   int res = 0;
   while(x) {
      res += BIT[x];
      x -= lowbit(x);
   }
   return res;
}
//.....................................
int main()
{
   read(n);
   for(int i = 0; i < n; ++i) {
      int l, r;
      read(l,r);
      Point[i] = (PII){l,r};
      lisan.push_back(l);
      lisan.push_back(r);//离散化坐标
   }
   sort(lisan.begin(),lisan.end());
   lisan.erase(unique(lisan.begin(),lisan.end()),lisan.end());
   ms(minX,INF), ms(maxX,-INF);
   sort(Point,Point+n,[](PII a,PII b){return a.first < b.first;});
   for(int i = 0; i < n; ++ i) {
      int x = getid(Point[i].first), y = getid(Point[i].second);
      minX[x] = min(y,minX[x]);
      maxX[x] = max(y,maxX[x]);
      if(G.empty() || x != G.back()) G.push_back(x);
      if(!yLine[y]) yLine[y] = x;
      else {
         int l = yLine[y] + 1;
         int r = x - 1;
         if(l <= r) line[cnt ++] = {l,y,1}, line[cnt ++] = {r+1,y,-1};
         yLine[y] = x;
      }
   }
   sort(line,line+cnt);
   int ans = n;
   int poi = 0;
   for(auto x : G) {
      if(minX[x] == maxX[x]) continue;
      while(poi < cnt &&  (line[poi].x <= x)) add(line[poi].y,line[poi].inorout), poi ++;
      ans += sum(maxX[x] - 1) - sum(minX[x]);
   }
   cout << ans << endl;
   return 0;
}