Given n 2d points
(x,y) , x<=1e5 , y<=1e5
n<=1e5
find the number of triplet such that all x's are different and all y's are different
ex: valid triplet is (1 , 3) , (2 , 2) , (3 , 1)
pLease share some ideas how to solve it
Thanks in advance
→ Pay attention
→ Streams
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
Unequal triplet 2d point
Revision en2, by Snapper_001, 2023-04-04 10:06:30
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Snapper_001 | 2023-04-04 10:06:30 | 60 | ||
| en1 |
|
Snapper_001 | 2023-04-04 09:50:52 | 225 | Initial revision (published) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/22/2024 09:49:32 (l2).
Desktop version, switch to mobile version.
Supported by
