Given n integer coordinates of the form (x, y) and Q queries in which a pair (a, b) is given. For each query output the number of coordinates whose x<=a AND y<=b.
Q<100000 N<1000 1<= x, y, a, b <= 1000
Given n integer coordinates of the form (x, y) and Q queries in which a pair (a, b) is given. For each query output the number of coordinates whose x<=a AND y<=b.
Q<100000 N<1000 1<= x, y, a, b <= 1000
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
2D partial sum DP will do the job.
DP[i][j] - the number of points with x <= i and y <= j. The recurrence is easy.DP[i][j] = DP[i-1][j] + DP[i][j-1] - DP[i-1][j-1].Thanks :)
How to solve if there is query is of OR form i.e. (x<=a || y<=b)?
Using 2D prefix sum you could actually answer any query of type — "How many points exists in range xi <= x <= xf && yi <= y <= yf." After building your 2D Prefix Table you would need to get the sum in a given rectangle. That can be done using the following formula: dp[xf][yf] — dp[xf][yi — 1] — dp[xi — 1][yf] + dp[xi — 1] + dp[yi — 1].
sort by X, fenwick tree by Y, NlogN
$$$Q \log N$$$ or how do you answer queries?
Of course, N in my message is (N+Q)
I am stuck in a similiar problem actually. And 2D Prefix Sum can't be done due to Memory restrictions. Could you explain a little further how Sorting + Fenwick would work ? If I sorted by X and the Fenwick by Y, how would I be sure that the corresponding Y in the Fenwick belong to the points in the range [0 — X] ? Thanks !
Try problem 652D - Nested Segments (it is almost the same), read editorial and comments below the editorial.
You can strengthen the problem into an online version: dynamically insert and query. For that, use 2D BIT.