EyadBT's blog

[Gym] Aleppo Collegiate Programming Contest 2024
By EyadBT, history, 2 years ago, In English

We are happy to invite you to participate in 2024 Aleppo Collegiate Programming Contest that was held on the 27th of June in Aleppo, Syria.

The problems are authored and prepared by ahmad_alghadban, Ahmad7_7, Zaher, Go8, Hosen_ba, JaberSH1, Khaled_Mardini, SaeedSabbagh, Neodoomer, Yaman_Alwaza, OmarAlzakout, and me.

Thanks to Guess.Who, Kaitokid, Modar_Ali, ...._....__...___, yaser.harba, BallzCrasher, Harraaak, Future_Hustler, Hamzeh_Miqdad, KinanAyed, The_Hallak, skahl15, Khaled_Al_Awad, Grizoo, HeMoo, Anas_Da, Kh_Decode_1024, Shahd, KactusJack, Richtofen, AbeerB, yumna for testing the contest.

We would love to hear your feedback on the problems in the comments section. Hope you enjoy solving the problems!

  • Vote: I like it
  • +146
  • Vote: I do not like it

Comments Comments (25)
| Write comment?
»
2 years ago, hide # |
← Rev. 2  
Vote: I like it +39 Vote: I do not like it

as a tester

thank you uncles for that great gym

and give me upvotes ^_^

→ Reply
»
2 years ago, hide # |
 
Vote: I like it +40 Vote: I do not like it

As a problem setter ,I hope you enjoy the problems. good luck have fun (:

→ Reply
»
2 years ago, hide # |
 
Vote: I like it +42 Vote: I do not like it

as a tester thank you uncles for that great gym and thanks for Anas_Da for writing the comment. give me upvotes ^_^

→ Reply
»
2 years ago, hide # |
 
Vote: I like it +24 Vote: I do not like it

As a participant in the official contest, problems are great! Have fun everyone <3

→ Reply
»
2 years ago, hide # |
 
Vote: I like it +24 Vote: I do not like it

As a tester , It was a super-duper contest !

→ Reply
»
2 years ago, hide # |
 
Vote: I like it +51 Vote: I do not like it

As a problem setter, عجل بالله يا خاي وخدني لحلب

→ Reply
»
2 years ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

How to solve F? I tried max flow matching but TLE at test 11.

→ Reply
  • »
    »
    23 months ago, hide # ^ |
     
    Vote: I like it +11 Vote: I do not like it

    I solved it using binary search on the min value and Hopcroft-Karp-Karzanov algorithm for bipartite matching.

    Approach:

    • Binary Search on the Minimum Value

    • For each mid-value during the binary search, construct a bipartite graph between the two arrays:

      • add an edge from i to j if $$$a_i$$$ is divisible by $$$b_j$$$ and $$$a_i/a_j \ge mid$$$

    • After constructing the graph, apply Hopcroft-Karp-Karzanov algorithm to find the maximum matching in the bipartite graph.

      • If the matching size equals $$$n$$$, it means there exists a valid arrangement with the current mid-value.
    → Reply
»
2 years ago, hide # |
 
Vote: I like it +8 Vote: I do not like it

Great gym overall but was the nsqrtnlogn intended for D ?if so the tests are so weak because nsqrtnlogn won't even work for 1e5 with really good implementation

→ Reply
»
2 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

help me to solve this

G. Intersection Not Allowed
→ Reply
»
2 years ago, hide # |
 
Vote: I like it +17 Vote: I do not like it

As a castle problem setter, I hope you find the problems interesting <3.

→ Reply
»
2 years ago, hide # |
 
Vote: I like it +8 Vote: I do not like it

As a participant in the official contest................

→ Reply
»
2 years ago, hide # |
 
Vote: I like it +13 Vote: I do not like it

Great gym! Thanks to everyone who made any efforts to produce it.

→ Reply
»
2 years ago, hide # |
 
Vote: I like it +13 Vote: I do not like it

As A problem setter

درب حلب مشيييتو كلو سجر كلووو

→ Reply
»
2 years ago, hide # |
 
Vote: I like it +13 Vote: I do not like it

I wanna thank all the castles

testers participants and problem setters <3

→ Reply
»
2 years ago, hide # |
← Rev. 2  
Vote: I like it +5 Vote: I do not like it

as a no one <3, the problem setters is my uncles

→ Reply
»
2 years ago, hide # |
 
Vote: I like it -8 Vote: I do not like it

How to solve problem I? + will there be any editorial? EyadBT

→ Reply
  • »
    »
    2 years ago, hide # ^ |
     
    Vote: I like it +5 Vote: I do not like it

    Hints Think about R. R is only 10. So you can go and visit all the intger point of each circle. Maximum point can be 20*20 = 400.

    → Reply
»
2 years ago, hide # |
 
Vote: I like it +8 Vote: I do not like it

As a problem-setter <3

→ Reply
»
23 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Can someone tell me how to solve problems D, H and L

→ Reply