https://www.luogu.com.cn/record/184045574

#include<bits/stdc++.h>
using namespace std;
int n;
struct node{
	int g,s,b;
	int gp,sp,bp;
	int id;
}a[230000];
bool cmp1(node a,node b){
	return a.g>b.g;
}
bool cmp2(node a,node b){
	return a.s>b.s;
}
bool cmp3(node a,node b){
	return a.b>b.s;
}
bool cmp4(node a,node b){
	return a.id<b.id;
}
int main(){
	ios::sync_with_stdio(false);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].g>>a[i].s>>a[i].b;
		a[i].id=i;
	}
	sort(a+1,a+n+1,cmp1);
	for(int i=1;i<=n;i++){
		if(a[i].g==a[i-1].g and i!=1) a[i].gp=a[i-1].gp;
		else a[i].gp=i;
	//	cout<<a[i].gp<<" ";
	}
//	cout<<"\n";
	sort(a+1,a+n+1,cmp2);
	for(int i=1;i<=n;i++){
		if(a[i].s==a[i-1].s and i!=1) a[i].sp=a[i-1].sp;
		else a[i].sp=i;
	//	cout<<a[i].sp<<" ";
	}
//	cout<<"\n";
	sort(a+1,a+n+1,cmp3);
	for(int i=1;i<=n;i++){
		if(a[i].b==a[i-1].b and i!=1) a[i].gp=a[i-1].bp;
		else a[i].bp=i;
	//	cout<<a[i].bp<<" ";
	}
//	cout<<"\n";
	sort(a+1,a+n+1,cmp4);
	for(int i=1;i<=n;i++){
		cout<<min({a[i].gp,a[i].bp,a[i].sp})<<"\n";
	}
	return 0;
}

这个蒟蒻连橙题都A不了，嘲讽这个蒟蒻/cf/cf