题面:
代码:
//因为相等的也算,所以要去重且统计相等的有多少个
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
#include<queue>
#define ll long long
#define llu unsigned ll
using namespace std;
const int maxn=200100;
struct node
{
int x,y,z;
int cnt,ans,id;
bool operator == (const node &b)
{
return x==b.x&&y==b.y&&z==b.z;
}
}a[maxn];
bool cmp1(const node &a,const node &b)
{
if(a.x!=b.x) return a.x<b.x;
if(