Da7doo7's blog

By Da7doo7, history, 15 months ago, In English

Hello, Codeforces!

I am happy to invite you to participate in Tishreen + SVU Collegiate Programming Contest 2023 which was held on Tuesday, June 20, 2023, at 11:00.

The problems were authored and prepared by LastDance_NotLastOfMe, ApraCadabra, CaMOUFlage, purp4ever, FzArK, Geo_Ghaffar, Nihad_Nabelsi, Tinky-Winky, Ali_ZaiBug, Experto_Besherunom, MaherSefo, and me.

I would like to thank our testers:

Vectors_Master, BabaVoss, Mohanad_Nahhal, Ayham_Dabah, Yousef-Elwan, Saleh_Nawar, Aasa-chan, little-fermat, KoKai, Shawerma, Miraculous_100, I_will_keep_trying, Shahed_Bawadekji.

And a special thanks to EleCursity, who helped us coordinate the contest onsite.

We would love to hear your feedback about the contest. Hope you enjoy solving the problems! wish you the best of luck!

Announcement of Tishreen + SVU CPC 2023
  • Vote: I like it
  • +158
  • Vote: I do not like it

| Write comment?
»
15 months ago, # |
  Vote: I like it +107 Vote: I do not like it

As a problem-setter, give me Pringles.

»
15 months ago, # |
  Vote: I like it +92 Vote: I do not like it

As a problem-setter, I really recommend the problemset for any team who likes solving problems. :)

»
15 months ago, # |
  Vote: I like it +76 Vote: I do not like it

The moment we've been waiting for is finally here! Best of luck to all the participants.

orz

»
15 months ago, # |
  Vote: I like it +78 Vote: I do not like it

As a contestant in this contest, I would like to thank you all for this enjoyable contest.

»
15 months ago, # |
Rev. 2   Vote: I like it +76 Vote: I do not like it

Finally I can say "Siiiiiii" XD

Have fun and ENJOY solving

»
15 months ago, # |
Rev. 2   Vote: I like it +71 Vote: I do not like it

As a problem-setter , I can assure you that the problems are interesting and I encourage you to try solving them all. Have fun!

»
15 months ago, # |
  Vote: I like it +38 Vote: I do not like it

I'm not a contestant . I'm not a problem-setter . I'm not a Tester
Yet I still want to farm Contribution

»
15 months ago, # |
  Vote: I like it +73 Vote: I do not like it

It was a nice experience , I wish the best for all participants.

»
15 months ago, # |
  Vote: I like it +22 Vote: I do not like it

Will an editorial be published? Nice problems btw :)

  • »
    »
    15 months ago, # ^ |
      Vote: I like it +21 Vote: I do not like it

    We are currently working on the editorial, but it may take some time before we can publish it.

    Thank you!

»
15 months ago, # |
  Vote: I like it +6 Vote: I do not like it

i will solve all of the problems soon :)

»
15 months ago, # |
  Vote: I like it +8 Vote: I do not like it

Nice problem set. Try to solve every problem.

»
15 months ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve K ?

sample

my idea was ..say i have the answer of node 6 which is ( 6*1 + 1*2 )

and now i want to calculate the answer of node 10

then it will be ans[10]=(10*1 + ans[6])

but here ans[6] has to be ( 6*2 + 1*3 not 6*1 + 1*2 )

how to do this efficiently?

  • »
    »
    15 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    You can't find the answer of some node depending on the answer of its parent node (as far as I know).

    I kindly ask you to wait until we prepare and publish the editorial.

»
15 months ago, # |
  Vote: I like it +8 Vote: I do not like it

Is there any tutorial coming soon ?

  • »
    »
    15 months ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    Yes, but this month is particularly hectic for us due to exams and graduation projects so it may take some time.

»
15 months ago, # |
  Vote: I like it +29 Vote: I do not like it

Finally solved all, thank you for this fantastic problemset!!

»
15 months ago, # |
Rev. 10   Vote: I like it +29 Vote: I do not like it

104487I - Link into the Vrains was by far my favourite from the set. It blew my mind how all the observations tied together at the end, making for a very elegant reduction with a simple (and more powerful) solution.

Statement


Hint 1
Click me


Hint 2
Click me


Hint 3
Click me


Hint 4
Click me


Hint 5
Click me


Hint 6
Click me


Hint 7
Click me


Hint 8
Click me (part 1)
Click me (part 2)
Click me (part 3)
Click me (part 4)


Hint 9
Click me (part 1)
Click me (part 2)
Click me (part 3)


And there you have it! A solution to the original problem after some (imo) very cool reductions. In fact, this problem can be solved simultaneously for every $$$k$$$ from $$$1$$$ to $$$n$$$ with the current constraints (216906416).


Addendum
But wait...

If you've seen a similar problem or have come up with a different approach to this problem, do share!

»
15 months ago, # |
  Vote: I like it 0 Vote: I do not like it

on fire

»
12 months ago, # |
  Vote: I like it +3 Vote: I do not like it

Hi Da7doo7, thanks for the problemset, are there any updates on the editorial? at least publish the completed ones.

»
6 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Hi .can anyone help me to solve A?