Grizoo's blog

[GYM] Aleppo Collegiate Programming Contest 2026
By Grizoo, 4 weeks ago, In English

We would like to invite you to participate in the Aleppo Collegiate Programming Contest 2026, which was held on September 3 in Aleppo, Syria.

The problems were authored and prepared by: Mohammad_Hacker, Khaled_Al_Awad, rasoulist, and me.

Also, we would like to deeply thank everyone who tested the problems

Um_nik, jeroenodb, __baozii__, pashka, Arpa, ApraCadabra, Wael_Zaiback, ali2005_syr, Khalwsh, Sersawy, Tamatem.1, MUZAN, _SHAHIN, Ali_Azzam, Mr_Bald, pharaok, MEDAAA, BluoCaroot, Moatazoleq, M0N, Whoname, ezraft, Wageeh, Mousa, Homz, MTSS, rafieefatemeh, Mezo_ZK, Alaatnt, I_m_a_newbi, MHMD_3R, Monzer_DA, MazenXv, AmmarShereer, A.M.X, Ali_taste, plastmassovyi_mir, GM_Dan4Life, Danasaur, lujain_sh, MEEDL7, BachTrack, The_Kaghed, A_New_Jaafari, Bash., alaa-_-, kareem_Bizreh, Alaaalshahror, abdulrahman_204, Omar_Al_Midani, assmaa.qa, Aminaainia05, Mrs.Bee, ASPER, Haidar.alhakeem, M0ZA7ER, HashemSi

Whether you want to yell at thank the problem setters, just look for the ones in gray. (Oh, and replace Apraham with rasoulist—it's only an 800-rating difference, basically nothing!)

We hope you enjoy the problems, GLHF!

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

»
4 weeks ago, hide # |
 
Vote: I like it +18 Vote: I do not like it

As a Tester i really enjoyed writing "as a tester" <3 .

The problem set is awesome, and I'd say it's definitely worth your time.

→ Reply
»
4 weeks ago, hide # |
 
Vote: I like it +20 Vote: I do not like it

As a contestant, problem D is the one of the best problems I have solved in my entire life. And BTW I was running from school to home 14 years ago ;)

→ Reply
»
4 weeks ago, hide # |
 
Vote: I like it +14 Vote: I do not like it

As a contestant , I think that problem D is the perfect stress test for felol :)

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

As a tester,hamoosh is not hamooshing any more

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

As a Tester the problem setters are your uncles. And the problems are very awesome.

وحلبية حلبيةةة

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

As a contestant , I think that problem A should be a very black problem so i could submit the extreme problem on it with no problem

→ Reply
»
4 weeks ago, hide # |
 
Vote: I like it +22 Vote: I do not like it

→ Reply
»
4 weeks ago, hide # |
 
Vote: I like it +12 Vote: I do not like it

tester as a

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

As a super volunteer, the competition was an amazing and enjoyable experience, filled with anxiety, exhaustion, enthusiasm, and the energy of code.

→ Reply
»
4 weeks ago, hide # |
 
Vote: I like it +18 Vote: I do not like it

As a tester, I don't know what to say except great problems.

→ Reply
»
4 weeks ago, hide # |
 
Vote: I like it +7 Vote: I do not like it

thanks guys

I appreciate your efforts

→ Reply
»
4 weeks ago, hide # |
 
Vote: I like it +10 Vote: I do not like it

As Abu Dujanah I can confirm that theINVINCIBLE is a fulol.

→ Reply
»
4 weeks ago, hide # |
 
Vote: I like it +6 Vote: I do not like it

Very nice problems!

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

As a Tester...

damn that felt good.

the problem setters are GOATed btw.

and Apraham must be a paid actor in the photo.

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

As a tester, the problem set was extremely fun to test! High quality problems, GLHF everyone!

→ Reply
»
4 weeks ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

if ( taste is a tester && Grizoo is a problem setter) great problemset

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

What is the intended complexity for F?

I did a $$$O(n \sqrt{n\log n})$$$ and it surprised me how fast it worked: 390ms

→ Reply
  • »
    »
    4 weeks ago, hide # ^ |
    ← Rev. 2  
    Vote: I like it +6 Vote: I do not like it

    UPD: A simple brute force $$$O(n^2)$$$ passes in 546ms, so it seems that testcases are just incredibly weak.

    (The case with max n and 1 2 3 ... n (or any permutation) already breaks this brute force)

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

    $$$O(n\sqrt{n}\log n)$$$ ran in 359ms for me

    → Reply
    • »
      »
      »
      3 weeks ago, hide # ^ |
       
      Vote: I like it 0 Vote: I do not like it

      Isn't yours actually at least $$$O(n \sqrt n \log n)$$$ ?

      I tested it with a custom test and it took 15 seconds while my submission took 300ms.

      I think it's just that test data is still weak and wasn't prepared for the heuristics you added.

      It's not the same approach at all.

      → Reply
      • »
        »
        »
        »
        3 weeks ago, hide # ^ |
        ← Rev. 2  
        Vote: I like it 0 Vote: I do not like it

        Yeah, tests are weak it seems

        → Reply
        • »
          »
          »
          »
          »
          3 weeks ago, hide # ^ |
           
          Vote: I like it 0 Vote: I do not like it

          I said at least because there is a case that achieves that complexity, and that's the one that took 15 seconds.

          The case is simple, it's $$$K= \sqrt{2Q}$$$ and $$$a=$$$ 1 2 3 .. K 1 ... N%K.

          Then the queries are all possible pairs $$$1\le l \lt r \le K$$$.

          This makes the minimum frequency $$$O(\sqrt{N})$$$ for every query and all occurences of v have at least one valid subarray, so it will run the binary search for each of the $$$O(\sqrt{N})$$$ occurences.

          I just think the test cases weren't adapted to this kind of solutions that use this minimum frequency + memoization heuristic.

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

as a tester, the problems are awesome and the Mkaw3 problem is the best

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

As a coach, thank you (:

→ Reply
»
4 weeks ago, hide # |
 
Vote: I like it +6 Vote: I do not like it

As a tester, the problems were quality.

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

As a tester, it was an honor to be a tester. Really nice problemset, huge thanks to the setters

→ Reply