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
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | adamant | 157 |
6 | awoo | 157 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | djm03178 | 153 |
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
Name |
---|
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.