Nezzar's blog

By Nezzar, history, 3 years ago, In English

Thanks for joining us today! Here is the editorial for today's problems:

1478A - Nezzar и разноцветные шары

Tutorial
Solution

1478B - Nezzar и счастливые числа

Tutorial
Solution

1478C - Nezzar и симметричный массив

Tutorial
Solution

1477A - Nezzar и доска

Tutorial
Solution

1477B - Nezzar и бинарная строка

Tutorial
Solution

1477C - Nezzar и красивая карта

Tutorial
Solution

1477D - Nezzar и тайные перестановки

Tutorial
Solution

1477E - Nezzar и турнир

Tutorial
Solution

1477F - Nezzar и шоколадные плитки

Tutorial
Solution

Full text and comments »

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

By Nezzar, history, 3 years ago, In English

Good morning/afternoon/evening, Codeforcers!

We (Nezzar, triple__a, Nanako) are very excited to present to you Codeforces Round 698 (Div. 1) and Codeforces Round 698 (Div. 2), which will take place in Jan/28/2021 17:35 (Moscow time).

There will be 6 tasks waiting for you to be solved in 135 minutes!

We would also want to thank:

Score distribution will be announced at $$$n$$$ $$$(0 \leq n < + \infty)$$$ minutes before round starts.

We hope you high performance with a lot of points earned during contest!

UPD1 $$$n$$$ is chosen to be $$$300$$$.

Score distribution is

Div. 2: 500-1000-1500-1500-2000-2500

Div. 1: 500-1000-1500-2250-2750-4000

UPD2 The contest is ended despite CodeForces under attack from DDoS midway. Thanks all for joining!

Here is the editorial: Editorial

UPD3

Congratulations to the winners!

Div 1:

  1. maroonrk
  2. panole
  3. tourist
  4. Rewinding
  5. boboniu (The only contestant who solved F during contest time!)

div 2:

  1. bahu
  2. yplane
  3. islingr
  4. chen__zexing
  5. ChuTian

People who were first to solve each task:

D2A: pj423

D2B: Zeyush

D2C: BelieveInYou

D2D/D1A: IgorI

D2E/D1B: SSRS_

D2F/D1C: Benq

D1D: Um_nik

D1E: tourist

D1F: boboniu

Full text and comments »

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

By Nezzar, history, 8 years ago, In English

We are going to organize a competition, but we cannot find any resources that help us to write external validator to check if the output is close enough to the expected answer. Can someone provide us some working validator files or give us some idea on how to work?

Any testlib solution will be appreciated.

Full text and comments »

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

By Nezzar, history, 9 years ago, In English

Problem link: https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&category=562&page=show_problem&problem=4319

basically you are required to find a maximal independent set out of a very special graph, but I cannot find any usage on the property of the graph. Can someone give hints/solutions about this problem? Million thanks!

Full text and comments »

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