#include <bits/stdc++.h>
using namespace std;
#define int long long
const int Max = 2e5+5;
#define rep(i, a, b) for(register int i = a;i <= b;i++)
#define min(a, b) (a<b?a:b)
int n, g[Max] = {-1}, s[Max] = {-1}, b[Max] = {-1}, x[Max], y[Max], z[Max];
bool cmp(int l, int r){return l > r;}
map<int, int> m, p, q;
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin >> n;
	rep(i, 1, n)cin >> g[i] >> s[i] >> b[i], x[i] = g[i], y[i] = s[i], z[i] = b[i];
	sort(g+1, g+n+1, cmp);
	sort(s+1, s+n+1, cmp);
	sort(b+1, b+n+1, cmp);
	rep(i, 1, n)
		if(g[i] != g[i-1])m[g[i]] = i;
	rep(i, 1, n)
		if(s[i] != s[i-1])p[s[i]] = i;
	rep(i, 1, n)
		if(b[i] != b[i-1])q[b[i]] = i;
	rep(i, 1, n)
		cout << min(m[x[i]], min(p[y[i]], q[z[i]])) << endl;
	return 0;
}

95分TLE

同样代码977ms勉强AC