[Rated, Prizes!] DYTECHLAB Cup 2022 Round Announcement [Div.1 + Div.2]
By low_, history, 6 months ago, In English

text

Hello Codeforces. Hoping you're having a wonderful day! ^_^

DYTECHLAB Cup 2022

This October, we invite you to the first ever Dytechlab Cup 2022 that will start on Oct/07/2022 17:35 (Moscow time). The problems were prepared by members of our company who share a passion for Competitive Programming. It is an open and rated round for both divisions.

The round will consist of 7 problems and will be 150 minutes long. We wish everyone good luck and have a positive delta!

Prizes

  • 1st place: US$200 cash prize
  • 2nd place: US$100 cash prize
  • 3rd place: US$50 cash prize

Also, we understand that contestants like dope MERCHANDISE, so we are giving away lots of them!

  • Top 20 will get a merchandise package which will include: a t-shirt with your Codeforces handle on it, a notebook, 2 pens, and a sports bag.
  • 30 merchandise packages, each including a t-shirt & 2 pens will be randomly distributed to 30 contestants ranking 21-200.
  • 100 merchandise packages, each including a sports bag & 2 pens will be randomly distributed to 100 contestants ranking 201-1500.
text text

All packages will include stickers in it, so you can stick them to your laptop and show your friends how hardworking you've been :p

Our appreciation goes to

Wish you the best and a very positive delta in this round!

UPD: score distribution is: $$$500 - 1000 - 1500 - 2000 - 2750 - 3500 - 3750$$$.

UPD2: Scripts to generate ranks of random prize winners. Seed $$$x$$$ will be the sum of score of the top 10 participants:

./genrandom_winners x

Scripts (genrandom_winners.cpp)

UPD3: Editorial.

The total score of top 10 is: $$$11460 + 9086 + 8829 + 8609 + 8380 + 8354 + 7511 + 6874 + 6775 + 6755 = 82633$$$. The list of ranks of prize winners is fixed and you can check using the published code above, using the total above as a seed. I will make a list the following days and contact the prizes winners! PLEASE NOTE that the list of real winners only finalized after the system detect & remove cheaters!

Congratulations to everyone and HAVE A GOOD WEEKEND!

UPD4: standings

Winners:

Place Participant
1 tourist
2 ksun48
3 orzdevinwang
4 inaFSTream
5 heno239

First to solve:

Task Participant
A manish17_
B tourist
C Y25t
D platelets
E EternalAlexander
F gisp_zjz
G rainboy

About Dytechlab & Job Opportunities

If you are interested in employment opportunities in Eastern Europe, Dubai, or South East Asia, please fill out the contact form below:

Contact form →

text

We are Dynamic Technology Lab, Pte Ltd. (DTL), a quantitative hedge fund engaging in global securities trading with multiple asset classes. Since our founding in 2009, from humble beginnings in a home garage, we are now a sizable, well-established financial institution with offices in Singapore, Shanghai, Beijing, and Hanoi. Our success is fueled by some of the most inquisitive minds who are relentless in their pursuit of innovation.

As a tech-focused Licensed Fund Management Company under the Monetary Authority of Singapore, DTL is dedicated to producing strong consistent returns for its investors by relying on mathematical and statistical models to drive its investment process.

Right now, we are looking for lots and lots of Engineering positions and are ready to bring opportunities to work in a quantitative trading environment for Engineers of all levels, all around the world!

Learn more about us on this blog or on our website!

Announcement of Dytechlab Cup 2022
 
 
 
 
  • Vote: I like it
  • +118
  • Vote: I do not like it

»
4 months ago, # |
  Vote: I like it -7 Vote: I do not like it

Auto comment: topic has been updated by low_ (previous revision, new revision, compare).

→ Reply
»
4 months ago, # |
  Vote: I like it -7 Vote: I do not like it

Auto comment: topic has been updated by low_ (previous revision, new revision, compare).

→ Reply
»
4 months ago, # |
  Vote: I like it -10 Vote: I do not like it

As a tester, I can assure that the problems are original and interesting. Good luck :)

→ Reply
»
4 months ago, # |
  Vote: I like it +16 Vote: I do not like it

As a coauthor, wish you the best and a very positive delta in this round!

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

As a tester and not a co-author, the problemset is very amazing and you should participate in the contest!

→ Reply
»
4 months ago, # |
  Vote: I like it +28 Vote: I do not like it

problems are

Spoiler
→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +29 Vote: I do not like it

    So you spent 28 minutes slove a?

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

      Around 15-20 minutes actually since I was interrupted while testing. I did suggest the setter add 1 more problem before A as it is pretty hard for A. But personally, I find this problem not as bad as others say, just misplaced.

      → Reply
»
4 months ago, # |
  Vote: I like it -28 Vote: I do not like it

Sir, a genuine question.

i don't have experience. i am currently a fresher.

Can i still apply for the job?

what are the things that you are looking in a candidate. Does codeforces ratings matters?

Please reply sir a humble request.

→ Reply
»
4 months ago, # |
  Vote: I like it +31 Vote: I do not like it

Hi! Unfortunately, contest coincides with BOI (balkan OI) (and RMI) contest day 2/closing ceremony.

I really would like to participate, and I think some other participants too.

Is it somehow possible for contest to be shifted 1-2 days? Or any other posibilities of participating for BOI/RMI participants?

TIA

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

    Why is this getting downvoted?

    → Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +13 Vote: I do not like it

    Hi. I'm so sorry your comment got downvoted so much. It has a great point!

    However since there are so many things going on around the world, contests conflicts are very unavoidable. We've spent a lot of thoughts on the contest dates, and found out that Oct 7th is the best option.

    Once again, I'm sorry that you (and a lot of contestants) are not going to make it because of BOI or RMI. We, at Dytechlab, really hope that you can virtual participate our contest afterwards.

    Good luck at BOI and RMI to all contestants involved ^_^

    Daniel.

    → Reply
    • »
      »
      »
      4 months ago, # ^ |
        Vote: I like it +19 Vote: I do not like it

      Thanks both for your wish and for answer! I'm sorry too that I can't participate, but thanks for your job for contest and good luck in hosting your contest :D

      Tim :)

      → Reply
    • »
      »
      »
      4 months ago, # ^ |
        Vote: I like it +24 Vote: I do not like it

      The contest takes place during working hours for people in the American time zones. Given how rare contests rated Div. 1s are (the next one is in a month), it would make more sense to schedule it on a weekend, when more people can participate.

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

        Weekend conflicts with Meta Hacker Cup round 3 and many other big contests like AtCoder's regular. Nevertheless, I'm very sorry for you or anyone won't be able to participate in ours!

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

          Thank you for your amazing work!

          Contest problems have a wonderful quality :)

          → Reply
»
4 months ago, # |
  Vote: I like it -20 Vote: I do not like it

Auto comment: topic has been updated by low_ (previous revision, new revision, compare).

→ Reply
»
4 months ago, # |
  Vote: I like it -28 Vote: I do not like it

Auto comment: topic has been updated by low_ (previous revision, new revision, compare).

→ Reply
»
4 months ago, # |
  Vote: I like it -20 Vote: I do not like it

As a tester, I hope everyone will like the problems as much as I do. Good luck winning some cash and merch!!

→ Reply
»
4 months ago, # |
  Vote: I like it -32 Vote: I do not like it

Auto comment: topic has been updated by low_ (previous revision, new revision, compare).

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

How much rank is needed to get an interview call?

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

Auto comment: topic has been updated by low_ (previous revision, new revision, compare).

→ Reply
»
4 months ago, # |
  Vote: I like it +3 Vote: I do not like it

The contest wait for 2 months to launch

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    We like to make early moves :D

    → Reply
»
4 months ago, # |
  Vote: I like it +3 Vote: I do not like it

What about the score distribution ?

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it -10 Vote: I do not like it

    Will be announced later today :p

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

How to determine the random prize winner?

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

    We were gonna just use random scripts with time seed to randomize winner indices on the sorted array of prize winners in each session.

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

      I think you should publish the seed to ensure transparency, and also select the seed in a way that ensures that it is not biased (i.e. the last submission number)

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

I noticed, many programmers like anime. Right?

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Not me :smile_sweat:. How does it relevant to this blog?

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

      Sorry for irrelevancy. It was just curiosity.

      → Reply
»
4 months ago, # |
  Vote: I like it +3 Vote: I do not like it

Auto comment: topic has been updated by low_ (previous revision, new revision, compare).

→ Reply
»
4 months ago, # |
  Vote: I like it +35 Vote: I do not like it

As a guest setter and tester, I leave no comment about the round.

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

    Thank you for your contribution! =)

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

Auto comment: topic has been updated by low_ (previous revision, new revision, compare).

→ Reply
»
4 months ago, # |
← Rev. 3   Vote: I like it -30 Vote: I do not like it

I like this Score Distribution : 500 — 1000 — 1500

→ Reply
»
4 months ago, # |
  Vote: I like it -19 Vote: I do not like it

Is it rated??

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

    Yes, Read the statement carefully. It is an open and rated round for both divisions.

    → Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it -6 Vote: I do not like it

    Yes, of course, see the title:

    [Rated, Prizes!] DYTECHLAB Cup 2022 Round Announcement [Div.1 + Div.2]

    so, it will be very:

    nice!

    → Reply
»
4 months ago, # |
  Vote: I like it -21 Vote: I do not like it

Is is going to be rated?

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +13 Vote: I do not like it

    Yes, of course, see the title:

    [Rated, Prizes!] DYTECHLAB Cup 2022 Round Announcement [Div.1 + Div.2]

    so, it will be very:

    nice!

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

Hope the statements would be clear this time!

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

What kind of contests is this? And what is its level??

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

    What kind of contests is this?

    It's the DYTECHLAB Cup 2022, from which you can infer that it is sponsored by DYTECHLAB

    And what is its level??

    Title says Div.1 + Div.2. Basically it's rated just like any other combined/global rounds.

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

Good luck everyone :)

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

there is interactive, isn't it? pray for "no interactive" :orz:

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

Auto comment: topic has been updated by low_ (previous revision, new revision, compare).

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

More DP problems can be expected form DTL?

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

What with prizes in Russia?

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

Any guess who is winning this round with the competition being so stiff these days for the first position . Let's enjoy this round as well !!. Good luck to everyone !!

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

As a participant, good luck to everyone. Hope the problemset will be great!

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

Just focus on first three problems for me. XD Good luck for everyone！

→ Reply
»
4 months ago, # |
  Vote: I like it +3 Vote: I do not like it

Can’t participate because I’m in school, but good luck to everyone participating!!!

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

Auto comment: topic has been updated by low_ (previous revision, new revision, compare).

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

    Around $$$10$$$ minutes left. The method of finding prize winners randomly is PUBLISHED.

    Please check them out!

    → Reply
»
4 months ago, # |
  Vote: I like it +3 Vote: I do not like it

Problems are hard for me ;(

→ Reply
»
4 months ago, # |
  Vote: I like it +270 Vote: I do not like it

I'm sorry but currently C is the worst problem I've seen.

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

I know what to do but can't code , what a shame on me ;-;

→ Reply
»
4 months ago, # |
  Vote: I like it +92 Vote: I do not like it

Why super long statements? Don't even want to read

→ Reply
»
4 months ago, # |
  Vote: I like it +39 Vote: I do not like it

Thanks for the round, hate it

→ Reply
»
4 months ago, # |
  Vote: I like it -10 Vote: I do not like it

Bad Python, Bad Python!

→ Reply
»
4 months ago, # |
← Rev. 2   Vote: I like it -8 Vote: I do not like it

In Problem E -> For each position in the line, calculate the probability that the ant begins in that position and survives. What do you mean by for each position?

→ Reply
»
4 months ago, # |
  Vote: I like it +47 Vote: I do not like it

At this point C is making me question my entire life

→ Reply
»
4 months ago, # |
  Vote: I like it +41 Vote: I do not like it

you should remove "+ Div.2" from title

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

They forgot to prepare "a" problem

→ Reply
»
4 months ago, # |
  Vote: I like it +47 Vote: I do not like it

Why Problem C???

→ Reply
»
4 months ago, # |
  Vote: I like it -16 Vote: I do not like it

from what i saw in the comments thanks for putting A problem it was a good indicator for me to quit ( don't say its bad round so, but for sure this one of most toughest rounds i saw)

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

    I couldn't code A, XD. given that i am able to solve div 2 C somewhat comfortably.

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

      agree i don't say im good enough but thinking for more than 45 minutes in how to implement A made me leave the contest even after i thought i was near to solve it in my opinion A wasn't in its place and i was lucky to not participate

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

    yep same, thank god i quit

    → Reply
»
4 months ago, # |
← Rev. 3   Vote: I like it +46 Vote: I do not like it

C might be the worst problem I have ever encountered, Problem A way too difficult for its position. Bad contest.

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

pure div1 round in the name of div2

→ Reply
»
4 months ago, # |
  Vote: I like it +52 Vote: I do not like it

POV: You join this company and you don't even understand your tasks

→ Reply
»
4 months ago, # |
← Rev. 2   Vote: I like it -11 Vote: I do not like it

i might get down voted for saying this but i don't really care at this point.

this was by far the worst contest i have ever participated in.

i also think that round should be at least unrated for Div2, i think more than half of the people who registered saw problem A and left.

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

    When i first saw $$$A$$$ I was scared, but it ended up being easy (because I managed to understand it quickly)

    The statement is a bit complicated, I don't know why..

    → Reply
»
4 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Sorry, but this is the worst contest I've ever participated in.
Also, C is the worst problem I've ever seen in a Codeforces contest. And A is the hardest A I've encountered.

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

    How have you arrived at your conclusion that C is worst?

    → Reply
»
4 months ago, # |
  Vote: I like it +35 Vote: I do not like it

reading forces.

→ Reply
»
4 months ago, # |
  Vote: I like it -18 Vote: I do not like it

bye bye

→ Reply
»
4 months ago, # |
  Vote: I like it +2 Vote: I do not like it

Div 1.00001

→ Reply
»
4 months ago, # |
  Vote: I like it +19 Vote: I do not like it

After a long, tough, but fruitful day at DTL, Ela goes home happily. She entertains herself by solving Competitive Programming problems. She prefers short statements, because she already read too many long papers and documentation at work. (Problem F)

Did Ela not participate in the problemsetting :thonk:

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

    Ela definitely did a great job that day and made her family, her boss, her company and the whole community proud!

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

difficult "A" forces

→ Reply
»
4 months ago, # |
  Vote: I like it +9 Vote: I do not like it

POV: writing solution for C in 10 minutes, then looking for a bug in code for an hour and a half (mixed up $$$x$$$ and $$$y$$$ somewhere)

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

There are so few people in the contest. Why is that？

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

    because of 'a' problem.

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

      A Is the question really that difficult?

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

        No, but words like "MEX of a multiset consisting of letters" prolly made newbies skip this round

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

Good first 3 tasks but too hard for being first 3. In C tried to handle not squared board case and lost 20 minutes XD

→ Reply
»
4 months ago, # |
  Vote: I like it +15 Vote: I do not like it

speedforces again

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

Problems are standard for Div 1 but relatively hard for Div 2 :(

→ Reply
»
4 months ago, # |
← Rev. 2   Vote: I like it +3 Vote: I do not like it

(deleted)

→ Reply
»
4 months ago, # |
← Rev. 2   Vote: I like it -11 Vote: I do not like it

I used to think that switching to Python from C++ in a competition would be almost impossible to happen.

This contest made me change my mind.

p.s. I think I have a partial solution to F, but I would have needed the whole 150 minutes for solving it completely

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

solved A, B, C. D was not clear to me sadly. I did not even understand the theory of reconnecting wires after 40min. I don't understand why the solution for the 3rd testcase is 154.

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

Can anyone give some hints to solve D? I was sensing some kind of DP in it.

→ Reply
»
4 months ago, # |
  Vote: I like it +19 Vote: I do not like it

For case 3 in problem D,who knows how to get 154?

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    Same experience as you

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

    Re-wire the edge of weight 22 as follows:

    2-5 -> 2-6 -> 2-7 -> 7-7 -> 7-4 -> 7-8 -> 1-8

    Then move along 1-8, these are 6 re-wirings and one movement along the edge of weight 22 = 7*22 = 154.

    → Reply
  • »
    »
    4 months ago, # ^ |
    ← Rev. 2   Vote: I like it +5 Vote: I do not like it 
    (2,5) -> (2,6) (22)
(2,6) -> (2,7) (44)
(2,7) -> (7,7) (66)
(7,7) -> (1,7) (88)
(1,7) -> (1,4) (110)
(1,4) -> (1,8) (132)

    Then send the data over the (1,8) link for 154.

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

    22*7 just think

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

    Hint : $$$22 \times 7 = 154$$$
    (Prime) factorizationing of solution is sometime useful

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

    You can cut the edge $$$[2,5]$$$ and link $$$2$$$ to $$$6,7,1$$$ successively. Then cut $$$[1,2]$$$ and link $$$1$$$ to $$$7,4,8$$$. After that you got edge $$$[1,8,22]$$$ and the tot cost is $$$7 * 22$$$

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

Can't even solve one question. :(

→ Reply
»
4 months ago, # |
  Vote: I like it +62 Vote: I do not like it

What's the meaning of D? I can't calculate the answer of the third sample over 2h .

→ Reply
»
4 months ago, # |
  Vote: I like it +38 Vote: I do not like it

C is a chore to do :( D was pretty cool

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

. anant

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

Nice problem I liked problem b let's hope for no fst

→ Reply
»
4 months ago, # |
  Vote: I like it +11 Vote: I do not like it

Didn't have enough time, but again E seems waaaay easier than D. Also is using built-in sqrt causing WA in B???

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

I'll say politely :

Spoiler
→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    It took me about 30 minutes to figure out that sqrt in C++ does not give me what I want.

    → Reply
    • »
      »
      »
      4 months ago, # ^ |
        Vote: I like it +1 Vote: I do not like it

      Yupp Same.it really hurts when you reach to solution's idea ,then a hardly observable wrong prevents u to get it in 1st time :""

      → Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +2 Vote: I do not like it

    define sqrt(n) sqrt((long double) n)

    Such define can help)

    → Reply
»
4 months ago, # |
← Rev. 3   Vote: I like it +35 Vote: I do not like it

I do not know if other people share my opinion, but I feel like problem A has become much harder than it should be. Problem A, in my opinion, should be solved by most people; otherwise, people might start getting discouraged, and this is of course not the intention of the people who prepare the contests.

→ Reply
»
4 months ago, # |
  Vote: I like it +3 Vote: I do not like it

Problem B: https://oeis.org/search?q=1%2C2%2C3%2C4%2C6%2C8%2C9%2C12%2C15%2C16%2C20&language=english&go=Search

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

    ...I think consulting the OEIS actually makes it harder than to simply exploit the property that there are exactly two luxury numbers between consecutive square roots. Proof: $$$(a + 1)^2 = a^2 + 2a + 1$$$, so the luxury numbers between $$$a^2$$$ and $$$(a + 1)^2$$$ are only $$$a^2 + a$$$ and $$$a^2 + 2a$$$.

    I suppose the OEIS might help with observing the pattern to begin with.

    On the topic of B, I hate precision errors in the C++ built-in sqrt() function >_>

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

      I think consulting the OEIS actually makes it harder

      I just added up the floored values of the inverse functions, which are $$$\lfloor \sqrt{x} \rfloor$$$, $$$\lfloor \frac{\sqrt{4x+1}-1}{2} \rfloor$$$ and $$$\lfloor \sqrt{x+1}-1 \rfloor$$$. In this sense, it definitely helped.

      I hate precision errors in the C++ built-in sqrt() function >_>

      This is exactly why I used Python for B, there's the isqrt function for $$$\lfloor \sqrt{x} \rfloor$$$ and it always works ;) Next time you see it, you'll know it!

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

        Or you could just use sqrtl function in c++ smh

        → Reply
»
4 months ago, # |
  Vote: I like it -12 Vote: I do not like it

wrong answer b problem pretest 4 cause using c++20 instead of c++17 wasted alot of time i want the c++20 submissions fixed to gain the rightful rank in the contest

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

    yes it should not be hacked

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

    Did you use a function like sqrt (or sqrtf, sqrtl)?

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

    pretest 4 was annoying, happened in Java as well. In java it was caused by imprecision of double for big numbers.

    For small numbers this works:

    long sqrtN = (long)floor(sqrt(n));

    for big numbers you have to adjust:

    long sqrtN = (long)floor(sqrt(n));
while(sqrtN*sqrtN < n) sqrtN++;
while((sqrtN)*(sqrtN) > n) sqrtN--;

    (this took me 20min, very annoying. I have no clue why the input is chosen in such a way, that some languages have an additional barrier)

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

In problem $$$B$$$, am I the only one who got WA and wasted a lot time because of using built_in sqrt() function instead of binary search ?

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

    Just figure it out in last 3 min but it says wrong answer not TLE as sqrt take root(x) time to compute then TLE should be there na

    → Reply
»
4 months ago, # |
← Rev. 4   Vote: I like it +54 Vote: I do not like it

I think the problem description of this competition is very unfriendly. I spent a lot of time reading the questions instead of solving them.

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

Can somebody please show me a case where I got the WA :((( 175029197. I got the WA on pretest 4 :(( Sorry for my bad English :(((

→ Reply
»
4 months ago, # |
  Vote: I like it +3 Vote: I do not like it

Anyone in B probelm is getting mistake at pretest 4 anyone did face same problem iam also not able to figure it out where it goes wrong

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

    You can try using sqrtl instead of sqrt. Better, use binary search to find square root.

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

      I wouldn't trust sqrtl either, although it seems to be precise enough. Use binary search to get the square root of a number.

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

    I never expected to get WA because of sqrt(), but I learned a good lesson, and I will use binary search next time.

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

It was a very strange round to me

→ Reply
»
4 months ago, # |
  Vote: I like it +61 Vote: I do not like it

Please don't do contests anymore.

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

Whats the logic behind problem A?

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

    First, count the number of occurrences of each letter.

    Then for each compartment, try to fit in one book of each letter, starting with a and moving up. Decrease the count accordingly. If you reach a letter with a count of 0, then that letter is the largest possible MEX for this compartment (there's no way to get a higher MEX if this letter is completely absent by the time you arrive at this compartment). Then move to the next compartment (even if you didn't finish filling up the previous one, since the MEX would not change and you want more books available for later compartments).

    If you were able to fill up a compartment (i.e., with the first $$$n/k$$$ letters), then the $$$(n/k + 1)$$$-th letter is the largest possible MEX for this compartment.

    My submission: 174993937

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

    just make a function to find mex for n/k length substring ,find minimum character which you can't make at any index or stack as per question and just add n/k mex into new string and output it.

    → Reply
»
4 months ago, # |
  Vote: I like it +16 Vote: I do not like it

Bruh, They are making A so bad these days that B seems easy to understand and solve. Why complicate with such a big problem statement for a starting problem and involve all sort of confusing stuff.

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

Why the number of participants is so low? How is this going to affect rating range?

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

On question F, I mistakenly thought that 1 is also a prime number, and I didn't have time to revise it in the end.

→ Reply
»
4 months ago, # |
  Vote: I like it +8 Vote: I do not like it

WTF is pretest 3 for C??

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

    I don't know, since I got AC in my first attempt, but an edge case to consider is when the corner of the L-shape is in the corner of the board. Then no diagonal jumps are possible, and the only reachable tiles are in either the common row or the common column of the three locusts.

    Aside from that, there aren't really any other edge cases, I think. As long as L-corner isn't a board corner, the reachable locations are those whose row number or column number have the same parity as the common row or common column respectively of the locusts, or locations that have the same chessboard color as the cells of the diagonally-aligned locusts. Maybe some cases here weren't covered in pretest 2?

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

      That's exactly what i did...XD Btw..congrates on getting AC!

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

        Consider the case where locusts are placed on (1,1), (1,2), (2,2) in a board of let's say, 6*6. Note that, the statement: "the only reachable tiles are in either the common row or the common column of the three locusts" won't be true here, even when "one of the three locusts is in the corner of the board".

        The only edge case is when "there is no diagonal jump possible". Only then this statement: "the only reachable tiles are in either the common row or the common column of the three locusts" holds true.

        Hope that helps you.

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

          My bad, I actually meant that the corner locust is in the corner of the board. Thank you for pointing this out.

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

          in (1,1), (1,2), (2,1) what should be the next move as here nor the diagonal movement is possible nor the "plus" movement as it would lead to its distortion. Please guide me if I am wrong.

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

      holy f**k I doubted myself on that the three locusts could totally disband into two locusts and one apart. sad thing...

      → Reply
    • »
      »
      »
      4 months ago, # ^ |
        Vote: I like it +1 Vote: I do not like it

      I got all of those cases right but still WA 3 >:<

      → Reply
»
4 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Are we supposed to know that the built-in square root function does not work as intended? Spent over an hour thinking of ll overflow and wrong solution and whatnot, was an extremely unenjoyable two hours for me

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

    True.. I even stress tested B until I convinced myself to do a binary search instead

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

    never trust floats. I calculated it like this with no binsearch:

    x = sqrt(a);
while(x*x<a) x++;
while(x*x>a) x--;

    It doesn't get tle because sqrt is precise enough, but probably is better to have some sqrt with binary search implemented

    → Reply
»
4 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Kept getting WA in problem B because of $$$sqrt()$$$ 🥲

→ Reply
»
4 months ago, # |
  Vote: I like it +3 Vote: I do not like it

The only time I do well, my solution to B FST...

:(

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

How are we getting 154 in sample 3 of problem D?

→ Reply
»
4 months ago, # |
← Rev. 2   Vote: I like it -39 Vote: I do not like it

B hacked due to inbuit sqrt fuction

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +66 Vote: I do not like it

    Using the inbuilt sqrt function is incorrect since it is not precise enough. Incorrect code should be hacked.

    → Reply
»
4 months ago, # |
  Vote: I like it +15 Vote: I do not like it

caseforces

→ Reply
»
4 months ago, # |
  Vote: I like it +79 Vote: I do not like it

Such a ride!

I'm humbled for your support & participation for today's contest!

I've read all of your comments, one by one, and took them with my head held up high. It's a great experience and pleasure to serve the community with this Rated-for-everyone contest.

There's a lot to learn from from this experience, so all I could say now is thanks to all who were with me throughout the long journey, and see y'all next time!

Have a good night, haven't slept properly for days :icant:

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +106 Vote: I do not like it

    Good job, thanks for making the contest.

    Everyone's experience is subjective, but unsatisfied people would be more prone to share it, so don't take it to heart if there are more negative than positive comments. Other than problem C, I found it a pretty cool contest and I thank you for making it. Get some well-deserved sleep.

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

    Hello sir, can you please check out this comment. I tried to hack one solution and I think there is still some problem in system tests of problem B. Correct me if I am wrong.

    Apologies for repeated comment.

    → Reply
»
4 months ago, # |
← Rev. 2   Vote: I like it +33 Vote: I do not like it

Did you missed a problem between E and F and a problem before A ?

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +32 Vote: I do not like it

    I think they accidentally swapped A and B.

    → Reply
»
4 months ago, # |
  Vote: I like it -14 Vote: I do not like it

Tasks A and C were very unpleasant. So much casework...

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +31 Vote: I do not like it

    A is slightly annoying, but I don't see any casework.

    → Reply
»
4 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Finally won't be a specialist after 10 months.

→ Reply
»
4 months ago, # |
  Vote: I like it +3 Vote: I do not like it

What should be the right answer for following testcase for problem B

1
2 999999999999999999

In my opinion correct answer should be 2999999996. I tried to hack solution 174996872 on above testcase. The above submission is giving 2999999997. But still it gave me unsuccessful hack verdict.

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

    Yes , my answer is also 2999999996.

    → Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it -10 Vote: I do not like it

    2999999997 is the correct answer

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

    I don't know why the solution give 2999999996 in codeforces's judgement.

    → Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +38 Vote: I do not like it

    In my opinion correct answer should be 2999999996.

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

what's problem with java in problem B. i have wrote same code in C++(Accepted) and java(WA). wasted 40min :/

C++ solution: https://codeforces.com/contest/1737/submission/175008748

Java Solution: https://codeforces.com/contest/1737/submission/174996178

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

    Since the precision of the double type in Java is guaranteed to be at most 15 digits, there may be cases where digits are dropped.(I got the same WA.)

    For example Math.sqrt(999999999999999999L) → output : 1.0E8.

    → Reply
»
4 months ago, # |
← Rev. 3   Vote: I like it +65 Vote: I do not like it

Problem D and E are great , I think.

Problem A is very boring I think , it just tests foreign participants's English reading abilities，and take long time to solve it , and it's harder than B . That's confusing to put this problem at A.

And why not to put explanation to sample 3 in D ? Very petty ! It helps a lot to participants。

(As a Chinese student , my English is bad. TaT)

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +64 Vote: I do not like it

    I got stuck on sample 3 of problem D for almost two hours.

    → Reply
»
4 months ago, # |
← Rev. 5   Vote: I like it +57 Vote: I do not like it

The Problem E is copied from a Chinese OJ.

https://noip.ac/rs/show_problem/3225

(The problem isn't available for everyone,so I post the image of the statement)

x8DAUI.png

Only the output format is not the same.

x8Dt2T.png

You may calculate the input result with n=5 in the input with the method of output.

So the contest is unfair and it should be unrated.

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +24 Vote: I do not like it

    Problem B was also copied from AMC math competition. I will send link here once I find it.

    → Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it -50 Vote: I do not like it

    Make it unrated due to problem theft MikeMirzayanov

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

    It sounds reasonable.

    But I don't know why people are downvoting you.

    → Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +45 Vote: I do not like it

    But if there is no evidence that the problem was intentionally copied, the round is unlikely to be unrated .

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

    Is the sample input the same? The OJ doesn't load for me.

    → Reply
    • »
      »
      »
      4 months ago, # ^ |
        Vote: I like it +1 Vote: I do not like it

      No , the output format is not the same. And it is single test.

      → Reply
    • »
      »
      »
      4 months ago, # ^ |
        Vote: I like it +12 Vote: I do not like it

      The input and output format not same.

      → Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +18 Vote: I do not like it

    Why is the problem not available for everyone?

    → Reply
    • »
      »
      »
      4 months ago, # ^ |
        Vote: I like it +28 Vote: I do not like it

      That's from a contest of a course that is not free.

      → Reply
      • »
        »
        »
        »
        4 months ago, # ^ |
          Vote: I like it +62 Vote: I do not like it

        Oh. I really don't like contests that are not free :(

        → Reply
      • »
        »
        »
        »
        4 months ago, # ^ |
          Vote: I like it +8 Vote: I do not like it

        The author is not from china, is other place this problem?

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

          Actually this problem is almost the same as UVALive7505. It seems to come from Asia ec final 2015 but I’m not sure because I can’t get the problem set from icpc.global.

          I believe the writer didn’t mean to copy this problem and I’ll feel sad if the contest is unrated. If it happens, it will be the second time for me to participate in a round unrated for unsolved problem for me, and in just few weeks.

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

      This is a private online judge.

      → Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    Maybe the problem writer might not mean to copy the problem.But some people have seen this problem.

    → Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +150 Vote: I do not like it

    Cant blame the author for Chinese problem database already having all problems in advance that will appear in next 10 years

    → Reply
  • »
    »
    4 months ago, # ^ |
    ← Rev. 3   Vote: I like it +128 Vote: I do not like it
    1. It's a non-public accessed link.
    2. The problem originates from a MATH problem by a senior member in our company, which has been using internally for years to assess company members + researchers. Now he wants to convert the idea into a CP problem and contribute it to the public domain. The ones who knows about it before during company activities are not active in the community, and the ones knowing it recently are not allowed to participate. The idea of this and the math problem is the same, but the way to approach and solve the 2 problems is fundamentally different.
    3. I see that people paying to see this problem as well :) do you want to explain it or give contact of who ever did it to us:)?
    → Reply
    • »
      »
      »
      4 months ago, # ^ |
        Vote: I like it +3 Vote: I do not like it

      what do you mean by your last statement?

      → Reply
  • »
    »
    4 months ago, # ^ |
    ← Rev. 2   Vote: I like it -26 Vote: I do not like it

    Nice experience :)

    → Reply
»
4 months ago, # |
  Vote: I like it +34 Vote: I do not like it

C was a crap

→ Reply
»
4 months ago, # |
  Vote: I like it -22 Vote: I do not like it

Problem B was copied from a math contest

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

    Provide the link please

    → Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +17 Vote: I do not like it

    I don't think this will make difference.

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

    It feels like this idea is very common.

    → Reply
    • »
      »
      »
      4 months ago, # ^ |
      ← Rev. 4   Vote: I like it -6 Vote: I do not like it

      Then why include the question? I feel like the question is more of a knowledge check that we know sqrtl (which frankly, I didn't), than a math problem.

      These knowledge checks are really annoying (ex. checking parity of negative numbers with x % 2 == 0), and they turn a good problem into a test problem. I understand that authors want the contest to be educational, but why not just include it in the pretest? It feels like they purposefully want to make us fail FST.

      Imagine thinking about a problem for an hour, finally passing all pretests, just to fail system test because of some weird C++ behavior that you have never even heard of...

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

Thank god O(n^3) was enough to pass D.

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

Guys, is problem D related something to Dijkstra algorithm?

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

The problem statements are so bad jfc. Bet authors are used to friendzoned by girls and wrote walls of text explaining his feelings.

→ Reply
»
4 months ago, # |
← Rev. 2   Vote: I like it +122 Vote: I do not like it

I was very surprised to see $$$n \leq 500$$$ in problem D, my solution is $$$\mathcal{O}(m \log m)$$$ using just Djikstra, and it'd be simple to improve to $$$\mathcal{O}(m)$$$ as everything is run on unweighted graphs.

First, compute for every vertex $$$v$$$ three values: $$$\text{so_dist}[v]$$$, $$$\text{si_dist}[v]$$$ and $$$\text{bo_dist}[v]$$$, where the first is the (unweighted) distance to the source (node $$$1$$$), the second is the unweighted distance to the sink (node $$$n$$$), and the third is the unweighted triangle distance between the source, sink and node $$$v$$$: the minimum of $$$\text{dist}[1][x] + \text{dist}[n][x] + \text{dist}[v][x]$$$ over all nodes $$$x$$$. The first two are easy to compute in $$$\mathcal{O}(m)$$$ with a BFS, the third can also be done with a BFS: add a new source, and an edge with length $$$\text{dist}[1][x] + \text{dist}[n][x]$$$ to node $$$x$$$, then compute the length of the shortest path from the new source to $$$v$$$ for every $$$v$$$. Since the distances can only be up to $$$3n$$$, this is also easy in $$$\mathcal{O}(m)$$$.

Then, loop over edges. For edge $$$(a, b, w)$$$, you have four offers for the answer:

  • $$$(\text{so_dist}[a] + \text{si_dist}[b] + 1) \cdot w$$$,
  • $$$(\text{si_dist}[a] + \text{so_dist}[b] + 1) \cdot w$$$,
  • $$$(\text{bo_dist}[a] + 2) \cdot w$$$,
  • $$$(\text{bo_dist}[b] + 2) \cdot w$$$.

The answer is the minimum offer over all edges.

This holds, since after the operations WLOG the path we take is a direct edge from $$$1$$$ to $$$n$$$. If at some point during the operations the two endpoints of that edge were in the same vertex, the answer is at least $$$\min\left((\text{bo_dist}[a] + 2) \cdot w, (\text{bo_dist}[b] + 2) \cdot w\right)$$$, otherwise it is the minimum of the other two terms.

Submission: 174999462. My code uses Djikstra instead of BFS, but as mentioned above, BFS is an easy replacement.

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +38 Vote: I do not like it

    I apologize for some issues involving task D.

    Let me tell you a bit about our last 24 hours.

    We didn't write a brute force solution until last night (it is partly my fault since I was too confident about the main ideas). In our previous (of course, fake) solution, only two cases were considered: $$$(\text{dist_1}[a] + \text{dist_n}[b] + 2) \cdot w$$$, and $$$(\text{dist_1}[b] + \text{dist_n}[a] + 2) \cdot w$$$, and nobody was aware of the triangle path in the third sample test.

    And that is ridiculous. About dozen GM (incl. LGMs) tested this problem last week, and no one noticed that tricky case too. We didn't have enough time to find a good solution for $$$n \le 10^5$$$, so Floyd algo was utilized instead. Thanks for sharing your ideas (ty), but imo the problem will be too hard for an ordinary D if the constraints were raised like that.

    → Reply
    • »
      »
      »
      4 months ago, # ^ |
        Vote: I like it +1 Vote: I do not like it

      A bit later than ideal but great job on essentially saving this contest at the last minute. Authors, write your brute force solutions!

      D was one of the best problems in the round (probably harder than E, even with the small constraint).

      → Reply
»
4 months ago, # |
← Rev. 2   Vote: I like it +26 Vote: I do not like it

Problem D is hard to understand in my opinion. The output of the third test case is quite unclear. But I guess once figuring it out the procedure of the third test case, the solution will be obvious.

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

Can anyone please give me some hints about problem D. Seems like some modification of Floyd-Warshall.

→ Reply
»
4 months ago, # |
  Vote: I like it -7 Vote: I do not like it

A is basically a reading exam. B is total garbo. No logic whatsoever. Literally just have to print and find pattern of 3 C problem statement 1/10. Solution is just case work.

wondering if authors obsure the simple problems with text bc he stole problems elsewhere

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +65 Vote: I do not like it

    C is also a reading exam.

    And D is the hardest reading exam, OK? I spent two hours understanding D.

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

      What could be the possible rating for C ? Any guesses

      → Reply
»
4 months ago, # |
  Vote: I like it +28 Vote: I do not like it

Why is A too hard in every single round? Newbies just give up and the number of participants decreases, which makes all participants' performance and delta lower

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

    Trap to make newbiews give up T_T

    → Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    It also skews the rating of the problems. Imagine somebody new to Codeforces starts trying to solve problems, looks for the most recent 800-level problem, and finds this Problem A >_>

    (and yes, I think it is justified for one to look for recent 800-level problems as opposed to sorting by #solves, since the latter tends to favor ancient outdated problems that are not a good indication of what to expect in present contests; but if recent 800-level problems are as hard as this, there is no actually good solution to this predicament...)

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

      Why do you say that participants rating or problem's rating decreases because of newbies leaving? It makes little sense if any at all

      That said, A still should not discourage half of the participants.

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

        A participant's rating depends on how well they performed relative to how other participants performed (as well as other factors like their current rating). Similarly, the rating of a problem depends on the performance of participants on that problem.

        However, only those who have made a submission would be considered as active participants. For example, let's say, hypothetically, that only 10% of those who intended to participate in the contest would have been able to solve D. But of the remaining 90%, let's say two-thirds of them were not able to solve A quickly and decided to quit the contest so that it is not rated for them (fearing that their rating would drop). So only 40% of the original number of people are actually considered, so those who solved D would be considered as being 25% (instead of the actual 10%). Being one of the 25% of participants that solved a problem is not as notable as being one of the 10% of participants that solved it, and the rating changes reflect that as well.

        Similarly, let's suppose that only 10% of participants were able to solve A in ten minutes. But then most of the other participants decided to quit because they couldn't solve A fast enough and it would hurt their rating if they made a submission. So maybe, as a result, it turns out that the 10% who solved A in ten minutes end up becoming say, 90% of the participants that are considered (made a submission). So now A's rating is based on this excellent performance of 90% of the participants solving it in 10 minutes, and it might get a rating of 800 or 900 as a result, as if it's a really easy problem, when it's actually a much harder problem that caused many to ragequit.

        These may be extreme examples, and the A here isn't as hard as some of the other recent A problems, but the point still stands that making A hard enough to discourage a significant portion of the participants ends up skewing the contest results, and its impact on participant rating changes and problem rating evaluation.

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

    I'm so happy that I didn't give up even though a took me about one hour:'

    → Reply
»
4 months ago, # |
  Vote: I like it +2 Vote: I do not like it

this C gave me cancer

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

can anyone please give me a hint about B

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

    $$$(a + 1)^2 = a^2 + 2a + 1$$$

    How many luxury numbers are there between $$$a^2$$$ and $$$(a + 1)^2$$$?

    → Reply
»
4 months ago, # |
  Vote: I like it +3 Vote: I do not like it

What is the criteria of random distribution of the goodies :)

I am eagerly waiting for the first "random" merchandise packages.

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

Can Any One Explain the logic of Problem B of using Binary Search .Because I blank in this Question

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

    if x * x > y, then you know x is bigger than floor(sqrt(y))

    You try to find the biggest x, that is not bigger than floor(sqrt(y))

    → Reply
»
4 months ago, # |
  Vote: I like it +9 Vote: I do not like it

What is wrong with problem C statement, I took 1 hour just to understand statement(maybe my skill issues)!!! There is nowhere mentioned whether it is necessary for all three cricket to stay together till end or not? and that jump over statement.

→ Reply
»
4 months ago, # |
  Vote: I like it +32 Vote: I do not like it

The sqrt function of C++ just destroyed the contest for me.

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +9 Vote: I do not like it

    It was already destroyed for me, but sqrt destroyed it even more :)

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

    is hacking phase going on ? because many people used sqrt but they are not hacked while I was hacked .

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

    I expected that sqrt is the problem because once double didn't even catch just 0.5 after number smaller than 10^9 so i checked by doubling the sqrt to see how retarded is this function's value

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

      Is hacking still on @Jhin ?

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

        No this isn't educational round or div3'4

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

          then why solution is showing hacked ??

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

            It must have been hacked during contest maybe last minute and you didn't notice

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

              yes I closed my laptop after I solved the third one :(

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

    Same for me. Could have become an Expert today, but alas!!!

    Nevertheless got to know about sqrtl func

    → Reply
»
4 months ago, # |
  Vote: I like it -13 Vote: I do not like it

Don't make competitive programming problems ever again

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

I think that recently problem A become more difficult and take more time, so it's so frustrating.

→ Reply
»
4 months ago, # |
  Vote: I like it +3 Vote: I do not like it

In problem b, c++ builtin sqrt does not work (sqrtl need to be used), spent 1 hour there. overall the contest was pretty bad for me.

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

    Builtin sqrt did work. You can checkout my submission

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

    or you can use c++17 i also wasted all of my time. i don't know why it's working fine in c++17.

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

      i have used c++!7 still hacked !! 1 200274443973227574 485348695690455822 actual answer : 747448170

      → Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Same, I got AC on the pretests and WA on test 11 after contest ended. Changed to sqrtl and got AC :/

    → Reply
»
4 months ago, # |
  Vote: I like it +24 Vote: I do not like it

The contest was enjoyable. Problem D was quite fun, and I also enjoyed E. I think it is easy for people's view of the contest to be obscured if they only looked at ABC.

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

D and E were really great, although i couldn't solve but had fun trying those

→ Reply
»
4 months ago, # |
← Rev. 2   Vote: I like it +1 Vote: I do not like it

I wasted all the contest trying to know why B doesn't work. After the contest I changed the compiler from 20 to 17 then it worked.

The contest was very bad for me.

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

    bro i have used c++17 during contest i was hacked

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

      try this : 1 200274443973227574 485348695690455822 actual answer : 747448170

      → Reply
»
4 months ago, # |
  Vote: I like it +135 Vote: I do not like it

D is amazing! E is also nice. Thanks for the round!

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

I tried to solve question 2.5hrs but couldn't solve it. Ratings will decrease.

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

I'm actually glad that pretest 4 destroyed precision issues in C++ sqrt, since otherwise, solutions that depended on sqrt would get pretests passed, and likely would get FST, since I'd expect there to be some hacks that exploit sqrt precision.

That being said, I have doubts on whether it is appropriate for a B problem to require a more accurate way of calculating square root (like binary search), or a similarly complicated approach to solving this problem without computing square roots.

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    I have used sqrt and passed all the system tests.

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

    I didn't use any method to get sqrt, I just used some pattern and found it based off that.

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

    I have used sqrt but it was accepted for me

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

    In the second half of the match, I replaced sqrt with binary search, which dropped my ranking from 700+ to 1400+, but it was proven after the match that what I had originally done (sqrt) wa in the 11th test point.

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

I made a stupid mistake on C. I considered the edge case as having the 'missing' square on (zero-indexed) the 4 coordinates of (1,1) or (1,n-2), (n-2,1) and (n-2,n-2).

Instead, I should ALSO check if the 4 corner coordinates are occupied.

→ Reply
»
4 months ago, # |
  Vote: I like it +1 Vote: I do not like it

I have noted a glitch in the codeforces compiler leading to my failed on main test cases verdict. In the question B , whose link is this, my solution which passed on pretests is this

After running on main tests , it showed wrong answer on main tests 11 .

I checked the error and found it is giving wrong answer in this test case : 77921270569329490 377318254283917957 Its correct output is : 1005355647 while my code on codeforces compiler gave the output : 1005355648

I copied my code and ran it on every online compiler I know as well as my local compiler and everywhere it gave the correct answer, while in codeforces inbuilt compiler it gave wrong answer.

I tried to dig further in it and found that it is not even printing the square root of 77921270569329490 correctly (which is 279143817, but its giving 279143816), which is taken care in all other compilers.

This glitch lead my answer to fail in main test cases.

If the moderator is viewing this, please check my submission on different compiler or do something about it. I do not want my rating to go down for no reason while it could have gone up.

→ Reply
  • »
    »
    4 months ago, # ^ |
      Vote: I like it +1 Vote: I do not like it

    This happened to me.

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

    In fact, this may be a reasonable error. Because the accuracy of sqrt is not guaranteed.

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

Finished C 8 seconds before contest end and wasn't able to submit because CF was loading like a shit. RIP rating :(

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

Before this contest, I thought that if a solution to a problem "count number of numbers between l and r that satisfy a property" works for l=1 and on random test cases, then it always works. This contest gave about 1000 counterexamples to that.

→ Reply
»
4 months ago, # |
  Vote: I like it +1 Vote: I do not like it

Never be using sqrt again. Ac with sqrtl() and wa on main test with sqrt. But pretest was passed with sqrt.
My day is ruined :(

→ Reply
»
4 months ago, # |
  Vote: I like it -51 Vote: I do not like it

unpleasant contest unfortunately copied problems from other sites problem E is copied from a Chinese OJ.

https://noip.ac/rs/show_problem/3225

problem B is coped from oeis

https://oeis.org/search?q=1%2C2%2C3%2C4%2C6%2C8%2C9%2C12%2C15%2C16%2C20&language=english&go=Search

problem with compilers C17 and C20 problem B

make it unrated such a waste of time

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

my code is giving right answer on my computer but getting wrong answer on test case 11 when submitted. What's happening? pleased see the code and tell me why is this happening?

https://codeforces.com/submissions/tanvir942316

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

I just have one question for myself why the f### did I participated in this round T_T

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

When will the rating change? Is this round unrated?

→ Reply
»
4 months ago, # |
← Rev. 3   Vote: I like it