As a tester, give me contribution

Fun fact: the round was prepared by school students

салют всем своим) раунд будет получше, чем рег, уверяю вас. gl to everyone!

As a tester, https://youtu.be/dQw4w9WgXcQ?si=9l7Xy-tIMOu0pzc1

as a tester, i can confirm this round is based

As no one more than a simple participant, gl to everyone

Hope to become expert again:)

Capybaraaaa

I hope this competition suits me better and helps me become a candidate master.

Is the contest heavily focused on geometry problems? T.T

capybara

I hope it goes well.

Thanks to the authors and testers for the effort! Looking forward to the round, GLHF everyone

I hope I become specialist after this contest

Good luck to everyone!

Capybara Capybara Capybara :)

I hope the round will not be based on the Sharygin International Geometry Olympiad.

Capyborus

as junior, it will be agood practice

Stuck between 1000 — 1010 for a month. Hoping to get a goode positive delta so that I can reach pupil fast.

Another hope.

As a tester, this was an unexpected penguin pfp meetup

As a tester, these guys have cooked. GLHF to everyone!

Last Div-2 promised world peace. This one will make sure it prevails☮️

GLHF

we are in Iran. please help us

Good luck everyone!

Good luck guys

Hope my rating can reach 2000 by this contest!

how can i be a tester??

when will the score distribution with number of subtask be shared

I hope I hit pupil after this round.

Thanks for the announcement! Geometry-based rounds are always interesting and challenging. Looking forward to the contest. GLHF to everyone participating!

Hope for another 1750 D :)

Is using yuantiji allowed by codeforces rules?

how does people get selected to write contest or become testers?

The score distribution will be announced later.

when will "later" come?

I want to be a specialist... I am currently suffering a great pressure on this division 2 contest.

As a tester, https://youtu.be/dQw4w9WgXcQ?si=9l7Xy-tIMOu0pzc1

score distribution?

Has the score distribution been announced?

"The round is based on the Sharygin International Geometry Olympiad"

Don't say you weren't warned

could someone give me a sheet of tissue? Because I feel that I want to cry

Will the score distribution be released within the next hour?

When score distribution?

GLHF everyone!, also just a quick question, how do people get to be testers? I'd love to contribute to the platform more.

The score distribution is released

OH NO Geometry, here we go again!

king kong ain't got shit on me

D1 will be tough nut to creck

Good luck guys! Hope to make it to expert.

Автокомментарий: текст был обновлен пользователем yanb0 (предыдущая версия, новая версия, сравнить).

The problem statement of B2 is really BAD,the problem itself is fine,also so many solves on D1 lol.

Best round imo

AM I NOOB OR WAS THIS HARD AF? :(

I hate constructives.

Such a badly written contest (not problem wise).

Doesn't greedy work for E or is it my bad?

wtf problem B is ...very bad problem statement for B

100/100 to the problem framing of B, spent nearly half an hour to get what was written exactly.

somehow misread every single problem

Should have tried to solve D1 first . Was able to solve till C2 but due to scoring distribution did not end with good rank

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

I saw this one user omdutt2004,

looks very sus, cheating since many contests, reported many times but still not banned, cheated today too !!

for B, why the first one passed but the second one didn't?

passed

def solve():
    n, x = [int(e) for e in input().split()]
    mx = 0
    for _ in range(n):
        a, b, c = [int(e) for e in input().split()]
        x -= a*(b-1)
        mx = max(mx, a*b-c)
    if x <= 0:
        print(0)
        return
    if mx == 0:
        print(-1)
        return
    if mx > x: print(1)
    else: print((x+mx-1)//mx)
 
for _ in range(int(input())): solve()

WA on testcase 9

def solve():
    n, x = [int(e) for e in input().split()]
    mx = 0
    for _ in range(n):
        a, b, c = [int(e) for e in input().split()]
        x -= a*(b-1)
        mx = max(mx, a*b-c)
    if x <= 0: print(0)
    elif mx == 0: print(-1)
    else: print(ceil(x/mx))
 
for _ in range(int(input())): solve()

Personally i found C1 much easier than B

Fun contest, especially C1/C2. I just guessed random strategies until I found one that works locally for both even and odd numbers in a reasonable amount of time.

I think E is much more easier than D2.

I am curious about the note of the problem B.

Before the update of the statement, the note of B is:

"In the sixth test case, the frog can reach point $$$10$$$, for example, as follows: jump $$$6$$$ times using type $$$2$$$ and $$$1$$$ time using type $$$1$$$."

I used 20 minutes to seek where is the 2nd type of jump, and the 6th case of the sample is

1 10
2 2 1

and the meaning of $$$n$$$ is "the number of types of jumps".

The announcement of the statement of B was updated didn't refer this change, and when I asked about it I just got "no comment" after I have sent it 10 minutes.

I can only say that this statement is a complete disaster.

I hate the writer of problem B. Misread B for like 1 hour :(

Before contest, I expected to come back to pupil, but I turned out I'm coming back to newbie