这题根据题意,我们可以把N和M看成是坐标的X和Y,我们知道每个点的位置都不相同,如果要求道路的交点,在图上也就是求点的左上和右下点,我们对X,Y进行Y轴降序,Y相等X轴升序的排列,这样我们只需求左上的点,也就是左边的点,当然,因为是左上,所以相同Y轴的点是不算的,所以要记录一下前面出现的次数,每次减去他,就是答案。
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#define mem(a) memset(a, 0, sizeof(a))
#define maxn 1000
using namespace std;
int flag, vis[maxn + 5];
long long ress;
struct tree
{
long long sum;
}tr[maxn * 4 + 5];
struct point
{
int n;
int m;
}po[maxn * maxn + 5];
bool cmp(const struct point & a, const struct point & b)
{
if(a.m == b.m)
return a.n < b.n;
return a.m > b.m;
}
void build(int l, int r, int n)
{
tr[n].sum = 0;
if(l == r)
return;
int mid = (l + r) / 2;
build(l, mid, n * 2);
build(mid + 1, r, n * 2 + 1);
}
void add(int l, int r, int n, int x)
{
if(flag == 1)
return;
tr[n].sum++;
if(l == r&&l == x)
{
flag = 1;
return;
}
int mid = (l + r) / 2;
if(x <= mid)
add(l, mid, n * 2, x);
else
add(mid + 1, r, n * 2 + 1, x);
}
void res(int l, int r, int n, int x)
{
if(r == x)
{
if(l == 1)
ress += tr[n].sum;
else
{
ress += tr[n].sum;
res(1, maxn, 1, l - 1);
}
return;
}
int mid = (l + r) / 2;
if(x <= mid)
res(l, mid, n * 2, x);
else
res(mid + 1, r, n * 2 + 1, x);
}
int main(int argc, char *argv[])
{
int cas, n, m, i, o = 0;
long k;
scanf("%d", &cas);
while(cas--)
{
scanf("%d%d%ld", &n, &m, &k);
mem(tr);
mem(vis);
ress = 0;
build(1, maxn, 1);
for(i = 0;i < k;i++)
{
scanf("%d%d", &po[i].n, &po[i].m);
}
sort(po, po + k, cmp);
for(i = 0;i < k;i++)
{
flag = 0;
if(po[i].n - 1 != 0)
res(1, maxn, 1, po[i].n - 1), ress -= vis[po[i].m];
flag = 0;
add(1, maxn, 1, po[i].n);
vis[po[i].m]++;
}
printf("Test case %d: %lld\n", ++o, ress);
}
return 0;
}