题目链接
题目分析
首先分析集合C中的不同点不会超过
105
个,因为每个
e
只会对应唯一的一个
然后将
Ac code
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define PI acos(-1)
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define INF64 0x3f3f3f3f3f3f3f3f
#define random(a,b) ((a)+rand()%((b)-(a)+1))
#define ms(x,v) memset((x),(v),sizeof(x))
#define scint(x) scanf("%d",&x );
#define scf(x) scanf("%lf",&x );
#define eps 1e-10
#define dcmp(x) (fabs(x) < eps? 0:((x) <0?-1:1))
#define lc o<<1
#define rc o<<1|1
using namespace std;
typedef long long LL;
typedef long double DB;
typedef pair<int,int> Pair;
const int MAX_V= 500+10;
const int MOD = 1e8;
const int maxn = 1000;const int maxm = 1000;
int tree[1000+10][1000+10];
void add(int x,int y,int val=1)
{
for(int i = y ; i<=maxm ; i+= i&-i)
{
for(int j=x ; j<=maxn; j+=j&-j)
{
tree[j][i] +=val;
}
}
}
int sum(int x,int y)
{
int s = 0;
for(int i=y ; i>0 ; i-=i&-i)
{
for(int j = x ; j>0 ; j-=j&-j)
{
s+=tree[j][i];
}
}
return s;
}
Pair b[100000+10];
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T;
int kase =0;
cin>>T;
while (T--) {
std::map<pair<int,Pair>, int> ma;
int n,m;
cin>>n>>m;
ms(b,0);
for(int i=0 ; i<n ; ++i){
int aa,bb;
cin>>aa>>bb;
if(b[bb].fi<aa){b[bb].fi = aa;b[bb].se = 1;}
else if(b[bb].fi ==aa)b[bb].se++;
}
for(int i=0 ; i<m ; ++i){
int c,d,e;
cin>>c>>d>>e;
if(b[e].fi){
ma[mp(b[e].fi,mp(c,d))]+=b[e].se;
}
}
ms(tree,0);
int ans =0;
for(std::map< pair<int,Pair>, int>::reverse_iterator it = ma.rbegin() ;it!=ma.rend() ; ++it){
int x = (*it).fi.se.fi,y = (*it).fi.se.se;
//std::cout << (it->fi).fi <<" "<<(it->fi).se.fi <<" "<<(it->fi).se.se <<" "<<(it->se)<< '\n';
int cnt = (sum(maxn,maxm)-sum(maxn,y-1)-sum(x-1,maxm)+sum(x-1,y-1));
ans += (cnt==0)*(it->se);
//std::cout << ans << '\n';
add(x,y);
}
std::cout <<"Case #"<<(++kase)<<": "<<ans << '\n';
}
//std::cout << "time "<< clock()/1000 <<"ms"<< '\n';
return 0;
}