HOME
PROBLEM
STATUS
CONTEST
练习
积分
趣味
正式
DIY
RANK
荣誉榜
活跃榜
现役榜
组队榜
DISCUSS
CHALLENGE
MALL
Register
Login
Jam's problem again
TimeLimit:2500MS MemoryLimit:65536KB
64-bit integer IO format:
%I64d
未提交
|
登录后收藏
Problem Description
Jam like to solve the problem which on the 3D-axis,given $N(1 \leq N \leq 100000)$ points $(x,y,z)(1 \leq x,y,z \leq 100000)$
If two point such as $(x_i,y_i,z_i)$ and $(x_j,y_j,z_j) \ x_i \geq x_j \ y_i \geq y_j \ z_i \geq z_j$, the bigger one level add $1$
Ask for the each level of the point.
Input
The first line is $T(1 \leq T \leq 15)$ means $T$ Case
For each case
The first line is $N$ means the number of Point and next there are $N$ line, each line has $(x,y,z)$
Output
Output with N line,each line has one number means the lever of point
SampleInput
1 4 10 4 7 10 6 6 8 2 5 7 3 10
SampleOutput
1 1 0 0
Submit
题目统计信息
详细
总AC数
2
通过人数
2
尝试人数
2
总提交量
2
AC率
100.00%
标签——3054
name
rating
递归
1535
树状数组
1535
基础
1017
AC该题后可以添加标签
贴完标签可以获得20ACB。
并且可以获得本题所有提交代码查看权限。
点击标题可以显示标签。
如果你还没认真思考过这题,请不要查看标签
如果您已经通过了该题,请务为该题贴上标签
出处
【每日一题】2022年8月
T^T Online Judge
[
BUG反馈
] [
FAQ
] [
闽ICP备17026590号-1
]
当前版本:
3.24
系统时间: