TheForces Round #32 (2^5-Forces) Editorial

Revision en7, by Yugandhar_Master, 2024-07-21 19:52:27

Thanks for your participation, hope you enjoy the problems.(Sorry for the inconvenience caused with the problem E and F1, actually the intended solutions runs very fast like for $$$E$$$ $$$2s$$$ and for $$$F1$$$ $$$2.5s$$$).

A: Short Query

Idea:Yugandhar_Master

solution
code(C++)

B: Minimum MEX

Idea:Yugandhar_Master

solution
code(C++)

C: Range Contradiction

Idea:Yugandhar_Master

solution
code(C++)

D: Eleven

Idea:Yugandhar_Master

solution
code(C++)

E: Not a Segment Tree

Idea:Yugandhar_Master

solution
code(C++)

F2: Award from Wuhudsm(Hard Version)

Idea:Yugandhar_Master

solution
code(C++)

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en10 English Yugandhar_Master 2024-07-27 04:11:21 212
en9 English Yugandhar_Master 2024-07-21 20:42:41 67
en8 English wuhudsm 2024-07-21 19:57:07 0 (published)
en7 English Yugandhar_Master 2024-07-21 19:52:27 4 Tiny change: ' like for E $2s$ and for F1 $2.5s$).\' -> ' like for $E$ $2s$ and for $F1$ $2.5s$).\'
en6 English Yugandhar_Master 2024-07-21 19:51:57 63
en5 English Yugandhar_Master 2024-07-21 19:39:16 98
en4 English Yugandhar_Master 2024-07-21 18:01:01 10
en3 English Yugandhar_Master 2024-07-21 17:30:42 31139 Tiny change: 'odd times}$ -> $(even+odd ' -> 'odd times} \rightarrow (even+odd '
en2 English Yugandhar_Master 2024-07-21 14:06:12 13 Tiny change: '[A](https://' -> '[A: Short Query](https://'
en1 English wuhudsm 2024-07-21 13:51:01 18842 Initial revision (saved to drafts)