ABC 355 D - Intersecting Intervals

最新推荐文章于 2024-09-12 19:02:20 发布

King童年回忆

最新推荐文章于 2024-09-12 19:02:20 发布

阅读量495

点赞数 8

文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/2301_76723927/article/details/139212926

版权

Time Limit: 3 sec / Memory Limit: 1024 MB

Score : 400 points

Problem Statement

You are given N intervals of real numbers. The i-th $(1<=i<=N)$ interval is $[ Li,Ri ]$ Find the number of pairs $(i,j)$ $(1<=i<j<=N)$ such that the i-th and j-th intervals intersect.

Constraints

$2<=N<=5*10^5$
$0<=Li<Ri<10^9$
All input values are integers.

Input

The input is given from Standard Input in the following format:

$N$

$L1 L2$

$……$

$Ln Rn$

Output

Print the answer.

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
int main(){
	ll n;
	cin>>n;
	vector <int> l(n), r(n);
	for(int i=0; i<n; ++i){
		cin>>l[i]>>r[i];
	}
	sort(l.begin(),l.end());
	sort(r.begin(),r.end());
	ll ans=n*(n-1)/2;
	for(int i=0,j=0;i<n;++i){
		while(j<n&&r[j]<l[i])
			j++;
		ans-=j;
	}
	cout<<ans<<endl;
	return 0;
}