O--O's blog

Invitation to TheForces Round #11 (DIV2.5-Forces) [New Round] [GYM]
By O--O, history, 20 months ago, In English

Hello, Codeforces!

We are happy to invite you to TheForces Round #11 (DIV2.5-Forces), which will take place on Apr/16/2023 18:05 (Moscow time)

Registration is open now.

You will have 150 minutes to solve 6 problems.

Note the duration is 2.5h and strongly recommend reading all problems once.

Discord Server (600+ people)

Contests' archive

Editorial is out.

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

Comments Comments (19)
| Write comment?
»
20 months ago, # |
  Vote: I like it +44 Vote: I do not like it

As the problem setter I hope you enjoy this round!

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

As a tester, I tested round as virtual participation.

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

Are editorials given for these contest's?

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

I have seen wuhudsm work on some of these problems for several months. They are of really high quality and I recommend participating.

As a tester
→ Reply
»
20 months ago, # |
  Vote: I like it +33 Vote: I do not like it

TheForces round orz!

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

Good luck to all and As a tester, give me negative contribution!

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

As a bogosort tester, the problems were great and I recommend everyone to participate in the round

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

As a tester, I sincerely hope you will enjoy!

Some of the questions may be harder than the former rounds and require thinking, but when you figure them out, it is a really good feeling!

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

As a tester, I hope all of you will enjoy the contest. Good Luck to All.

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

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

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

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

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

Please tell me, why my approach for c fails,

steps:-

  • i flipped the array $$$a$$$
  • now we need to check if
$$$c1(a,l1,r1)-c0(a,l1,r1)=c1(b,l2,r2)-c0(b,l2,r2)$$$
  • replace every zero with -1.
  • to satisfy the condition i took smallest possible and largest possible sum from both LHS and RHS.
  • let's say l1 and l2 are smallest possible LHS, RHS and r1 and r2 are biggest possible LHS and RHS.
  • now if range (l1, r1) intersect with (l2, r2) we print YES otherwise NO.

please give me a test case where this approach fails.

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

    1

    4 1 1 2 2

    0 0 1 1

    0 0 1 1

    Expected $$$NO$$$,but your code output $$$YES$$$.

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

Great contest again! Thanks!

→ Reply