Hello CodeForces :D

I would like to invite you all to participate on Damascus-CPC 2018 contest on GYM. The contest was originally held in Syria, Damascus for Damascus University on May, 8, 2018.

Problem Setters && Testers :

Daniar Jarrous Daniar , Maala Mhrez XR_Maala , Joud Zouzou JoudZouzou , Fudail Hasan fudail225

Hussain Karra Fallah Tomah4wk , Farouk Hjabo fresher96 , Anas Kastatntin kastarino , Hussain Hussain sqr_hussain

Zain Alabedeen Ali ZieiN , Hasan Jaddouh kingofnumbers , Marsil Zakkour Marcil , Noman Jessri Noman.jessri and Mohammad Asaad .

**Contest Details**:

Time : May, 26, 2018 (12:00 hrs) (GMT+3). You can check your local time here.

Contest Length : 5 hours.

Number of Problems: 12 problems.

The contest difficulty should be similar to a Div2 Codeforces round.

I recommend participating as a team because it is a standard ACM-ICPC contest.

Hope you like the problems. Any feedback after the contest is appreciated!

Good luck and have fun !!

**UPD** : here is the Editorial

have fun :D

number of problemseters equals number of problems, it is (1 * 1);

How did you know the number of problemsetters?

ok, it was (Problem Setters && Testers ) :)

But there are 13 testers and setters

thanks, any other bugs ..

how to solve K?

How can we find the closest vertices to each u,v for each query? Should a simple djikstra be efficient enough?

First, find every vertice in the cycle(in 1). Then start bfs from each vertice in the cycle.

Ah i see.. thank you so much

That was the official solution but there is an easy one mentioned in the editorial , you can take a look at it now.

Could you please share your code?

Sure, https://ideone.com/ACAF2R :) It works on C++17

How to solve C? I am checking if A[i] == B[n-i-1] && A[n-i-1] == B[i], then steps are odd, else if A[i] == B[i] && A[n-i-1] == B[n-i-1] then steps are even. Incrementing steps accordingly. This does not seem to work. Thanks

Editorial is published

Auto comment: topic has been updated by Daniar (previous revision, new revision, compare).Can I view the test data? I wish to see why my B is incorrect :(

Sorry, tests are hidden but it's just random edges mostly

It was not interesting to solve any of the problems. I mean in official contest I would try to solve but here I have no intentions of upsolving any of the remaining problems. I hope damascus cpc will be more interesting in the future.

Maybe because you only solved the easy ones? :P

Dude, G and I are idealess. thank you for your efforts preparing and all. but it is just not interesting. I think a negative opinion should be accepted.

Ofcourse it is accepted, but your first comment didn't contain any helpful feedback on what needs to be improved. Anyways I'm sorry you didn't like the problems.

Thank you for your opinion and we respect it, but I don't really agree with you.

This problemset is prepared for a local university competition (most of the contestants are beginners i.e. green or even grey on codeforces ) and it's difficulty is similar to a Div-2 contest.

If you managed to solve most of the problems easily without thinking a lot or making any effort that's because you are a

Div-1ranked contestant with a very well knowledge of the basics, but that doesn't make the problems "idealess" .I think problems D , E and H are interesting and very good for a 3 stars rated gym contest but you probably didn't read or give enough time to think about them.

Can you please summarize the DSU on Tree approach used in the code of problem L?? I tried to understand it but not able to get it further in the code.