My editorial for 319E Ping Pong

Revision en1, by Behrad., 2024-10-14 16:28:07

Hello Codeforces community, This is an editorial for an 11-year-old problem in CF, and the official editorial still has it TODO, so yeah, why not?

319E - Ping-Pong

I'll use step-by-step guides to show case the path to finding the solution to this problem, and hope it'll be helpful to other people.

1. The intervals are given offline.

In this subtask, let's assume that the intervals are given two us, and the queries are asked after all the intervals are given.

1.1. $$$n \le 1000$$$

Tags segment tree, dsu, coordinate compression, ping pong 319e

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en18 English Behrad. 2024-10-18 18:59:10 256
en17 English Behrad. 2024-10-14 18:25:47 30
en16 English Behrad. 2024-10-14 18:24:37 2738 Tiny change: '(long)">\n\n~~~~~\n#' -> '(long)">\n~~~~~\n#'
en15 English Behrad. 2024-10-14 18:20:38 4
en14 English Behrad. 2024-10-14 17:31:17 0 (published)
en13 English Behrad. 2024-10-14 17:31:02 139
en12 English Behrad. 2024-10-14 17:28:34 78
en11 English Behrad. 2024-10-14 17:26:44 4
en10 English Behrad. 2024-10-14 17:26:01 4
en9 English Behrad. 2024-10-14 17:25:24 4 Tiny change: 'e minimum _l_ in all of' -> 'e minimum $l$ in all of'
en8 English Behrad. 2024-10-14 17:24:16 735
en7 English Behrad. 2024-10-14 17:17:23 714 Tiny change: 'similar.\n' -> 'similar.\n\n\n## $n \le 10^5$'
en6 English Behrad. 2024-10-14 17:05:23 220
en5 English Behrad. 2024-10-14 17:02:53 443 Tiny change: ' are asked.\nLet's assum' -> ' are asked;\nAlso let's assum'
en4 English Behrad. 2024-10-14 16:54:46 616
en3 English Behrad. 2024-10-14 16:48:30 265 Tiny change: 'e minimum _l_ in all of' -> 'e minimum l in all of'
en2 English Behrad. 2024-10-14 16:42:28 812
en1 English Behrad. 2024-10-14 16:28:07 572 Initial revision (saved to drafts)