gainullin.ildar's blog

By gainullin.ildar, history, 3 months ago, In Russian,

На контесте в ЛКШ зашел следующий алгоритм:

Шафлим полуплоскости, перебираем пару, находим точку пересечения, бежим по всем полуплоскостям, когда встречаем полуплоскость в которой эта точка не лежит -> break; Дальше строим выпуклую оболочку всех точек, которые лежат во всех полуплоскостях.

Полуплоскостей было <= 2000.

Слабые тесты или матожидание времени работы быстрее куба?

Read more »

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

By gainullin.ildar, history, 6 months ago, In English,

Hello CodeForces Community,

I take this opportunity to cordially invite you to take part in the CodeChef May Lunchtime. It is an IOI Style contest which will last for 3 hrs.

The problems were set by gainullin.ildar (Ildar Gainullin) and tested by adamant (Alexander Kulkov) & Xsquare (Prateek Gupta). The rest of the panel members include:

  • Russian Translator: CherryTree (Sergey Kulik)
  • Mandarin Translator: huzecong (Hu Zecong)
  • Vietnamese translators: VNOI team

We hope you will enjoy the problems and welcome your feedback in the comments below.

Time: Saturday, 27th May, 2017 at 19:30 HRS — 22:30 HRS. (Indian Standard Time +5:30 GMT) Check your timezone here.

Contest link: https://www.codechef.com/LTIME48

Accepted Languages: https://www.codechef.com/wiki/list-compilers

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

Prizes: Top 10 performers in Global and Indian school 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  
  • +43
  • Vote: I do not like it  

By gainullin.ildar, history, 7 months ago, translation, In English,

Hi!

On April 23, 19:35 MSK will be held rated Tinkoff Challenge – Elimination Round.

Problems were prepared by me — Ildar Gainullin, Alexander alkurmtl Kurilkin and Nikolay KAN Kalinin.

Big thanks to Vladislav winger Isenbaev and Alexander AlexFetisov Fetisov for testing round, and also to Mike MikeMirzayanov Mirzayanov for systems Codeforces and Polygon.

Participants will be offered seven problems and two hours to solve them. Scoring will be announced a bit later.

This round is eliminational for Tinkoff Challenge.

Best 30 participants will be awarded with warm vests and other pleasant souvenirs like stickers and notepads. Best 100 participants will be invited to Moscow to visit Tinkoff's office with panoramic view on the city.

Best 20 participant who will be able to arrive will advance to Tinkoff Challange – Final Round.

We hope everyone will find interesting problem for themselves. We wish everyone a successful round and high ratings!

UPD. Scoring: 500 1000 1500 2000 2500 3000 3500

UPD. Editorial

Read more »

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

By gainullin.ildar, history, 11 months ago, In Russian,

Интересно, но на codeforces нельзя поискать слово string. Кто знает, почему так?

Read more »

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

By gainullin.ildar, history, 14 months ago, In Russian,

Интересно, но на codeforces нельзя поискать слово chess. Кто знает, почему так?

Read more »

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

By gainullin.ildar, history, 14 months ago, In English,

Please, help me to solve this problem https://ru.kattis.com/problems/fenceortho, i know that i can use Rotating Calipers method, using 4 calipers, but i can't intersect them.

I write calipers method storing point and angle of caliper, please help me how to find intersection point of 2 calipers.

Read more »

 
 
 
 

By gainullin.ildar, history, 14 months ago, translation, In English,

Сan you please tell the basic principle of solving such problems with mincost. And please write problems that are solved by this method. for example BubbleCup, task G was one of these.

Read more »

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

By gainullin.ildar, history, 19 months ago, In Russian,

Здравствуйте, на сайте есть множество задач в которых применимо Convex Hull Trick, но где о нем можно прочитать на русском языке я так и не нашел. Знающие люди, подскажите пожалуйста, где можно прочитать о CHT на русском языке?

Read more »

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