hloya_ygrt's blog

By hloya_ygrt, history, 3 months ago, translation, In English,

Hello CodeForces Community!

After serving the lip smacking August Long Challenge, CodeChef is back with August Cook-Off 2017 (https://www.codechef.com/COOK85)! Hop on for five challenging problems and 2.5 hours of rigorous programming!

Joining me on the problem setting panel are:

  • Problem Setters: Melnik (Daniil Melnichenko) and hloya_ygrt (Yura Shilyaev)
  • Problem Tester: kingofnumbers (Hasan Jaddouh)
  • Admin: kingofnumbers (Hasan Jaddouh)
  • Editorialist: Melnik (Daniil Melnichenko) and hloya_ygrt (Yura Shilyaev)
  • Russian Translator: Melnik (Daniil Melnichenko) and hloya_ygrt (Yura Shilyaev)
  • Mandarin Translator: huzecong (Hu Zecong)
  • Vietnamese Translator: VNOI Team
  • Language Verifier: (Priyank jaini)

I hope you will enjoy solving them. Please give your feedback on the problem set in the comments below, after the contest.

Now, without further ado, please allow me to share the contest details with you real quick:

Time: 20th August 2017 (2130 hrs) to 21st August 2017 (0000 hrs). (Indian Standard Time — +5:30 GMT) — Check your timezone.

Details: https://www.codechef.com/COOK85

Registration: You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to register in order to participate.

Prizes: * Top 10 performers in Global and Indian category will get CodeChef laddus, with which the winners can claim cool CodeChef goodies. Know more here: https://www.codechef.com/laddu. (For those who have not yet got their previous winning, please send an email to winners@codechef.com)

Good Luck! Hope to see you participating!!

Read more »

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

By hloya_ygrt, history, 6 months ago, translation, In English,

811A - Vladik and Courtesy

Hint
Tutorial

811B - Vladik and Complicated Book

Hint
Tutorial

Challenge. Can you solve the problem with n, m ≤ 106?

811C - Vladik and Memorable Trip

Hint 1
Hint 2
Tutorial

Challenge. Can you solve the problem with n, a[i] ≤ 105? Try to use the fact, that .

811D - Vladik and Favorite Game

Hint 1
Hint 2
Tutorial

Challenge. Assume this problem: let's change all dangerous cells on walls, i.e such cells, in which it is just impossible to enter. Now you have to generate such string from moves 'L', 'R', 'U', 'D', that without dependance on possible button breakage of pairs 'L'/'R' and 'U'/'D', as in original problem, will visit finish cell. Of course, it is not necessary to stop at finish cell, you just have to visit it at least once.

811E - Vladik and Entertaining Flags

Hint
Tutorial

Read more »

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

By hloya_ygrt, history, 6 months ago, translation, In English,
Tutorial is loading...
Setter's code

First accepted Zhigan.

Tutorial is loading...
Setter's code

First accepted polygonia.

Tutorial is loading...
Setter's code

First accepted div2: Lyn.

First accepted div1: lewin.

Tutorial is loading...
Setter's code

First accepted div2: polygonia.

First accepted div1: V--o_o--V.

Tutorial is loading...
Setter's code

First accepted div2: xsup.

First accepted div1: anta.

Tutorial is loading...
Setter's code

First accepted: ksun48.

Tutorial is loading...
Setter's code

First accepted: ___.

Read more »

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

By hloya_ygrt, history, 6 months ago, translation, In English,

Hello everyone!

This Saturday May 20, 21:05 MSK rated Codeforces Round #415 takes place.

As for our previous round 384, the problems were set by Kiril kefaa Gulin and Yura hloya_ygrt Shilyaev. And this time Daniil Melnik Melnichenko joined us! Many thanks to coordinator Alex netman Vistyazh for help in preparations of the round, and also to Mike MikeMirzayanov Mirzayanov for Codeforces and Polygon systems.

While everyone is waiting for second half of "SKAM" series season, we offer you to solve problems, main characters of which would be stunning girl Noora and well-known to you from 794F - Leha and security system hacker Leha!

As always, participants of both divisions will be given 5 problems and 2 hours to solve them. Scoring will be announced before the round.

We hope you'll like our round! I wish everyone good luck and high rating!

UPD: Please pay attention that round was rescheduled.

UPD2: Scoring in each division is standart 500 — 1000 — 1500 — 2000 — 2500

UPD3: We are extremely sorry about the issue with problem C, but since it affected not many participants, round remains rated. At the same time, we can remove your unnecessary submissions and if you were affected, we can make round unrated for you. Please contact KAN with this question.

UPD4: Congratulations to the winners! Editorial will be posted tomorrow.

Div1:

  1. Radewoosh

  2. izrak

  3. mnbvmar

  4. ershov.stanislav

  5. V--o_o--V

  6. Um_nik

  7. Arterm

Div2:

  1. polygonia

  2. Delsin

  3. utsav.delhi2

  4. Cypi

  5. altruist

  6. Anachor

  7. shadowatyy

UPD5: Editorial is available http://codeforces.com/blog/entry/52099.

Read more »

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

By hloya_ygrt, history, 11 months ago, translation, In English,

Hi cf, I want to show you a small, but funny script.

It loads the submission of some codeforces user and builds a graph showing the number of 'Accepted' verdicts each month (graph's desighn is really similar to cf rating ones). I had used Flot to draw the graphs.

Examples:

As you can see from the second screenshot, Flot can zoom the graph, you can search for only 2016 year results, for example.

How to download and install it?

Windows: The program which loads the data is build in exe, so you don't have to install python interpreter.

  • Download windows zip from dropbox.

  • Unzip, open the folder. We need just two files from a lot of shit there: main.exe (programm for adding or deleting users from graph) and Result.html (result graph, open in any browser and enjoy).

Linux/ Mac:

  • Download another zip from dropbox

  • Unzip, open the folder. To add or delete a user from graph, using python2.7 run main.py, and open Result.html in any browser to see the result graph.

Read more »

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

By hloya_ygrt, history, 11 months ago, translation, In English,
Tutorial is loading...
Setter's code
Tutorial is loading...
Setter's code
Tutorial is loading...
Setter's code
Tutorial is loading...
Setter's code
Tutorial is loading...
Setter's code

Read more »

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