Top Recent Blog Posts
By DeMen100ns, history, 8 days ago, In English
Before the round starts

1713A - Traveling Salesman Problem

Hint 1
Hint 2
Tutorial
Solution
Feedback

1713B - Optimal Reduction

Hint 1
Hint 2
Hint 3
Tutorial
Solution
Feedback

1713C - Build Permutation

Hint 1
Hint 2
Hint 3
Hint 4
Tutorial
Solution
Feedback

1713D - Tournament Coundown

Hint 1
Hint 2
Hint 3
Tutorial
Solution
Feedback

1713E - Cross Swapping

Hint 1
Hint 2
Hint 3
Tutorial
Solution
Feedback

1713F - Lost Array

Hint 0
Hint 1
Hint 2
Hint 3
Tutorial
Solution
Feedback

Read more »

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

By Makha, history, 22 hours ago, In English

The first day of IOI is going to start at 10th of August and I made this blog.

Read more »

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

By awoo, history, 2 days ago, translation, In English

1716A - 2-3 Moves

Idea: vovuh

Tutorial
Solution (vovuh)

1716B - Permutation Chain

Idea: BledDest

Tutorial
Solution (awoo)

1716C - Robot in a Hallway

Idea: BledDest

Tutorial
Solution (awoo)

1716D - Chip Move

Idea: BledDest

Tutorial
Solution (Neon)

1716E - Swap and Maximum Block

Idea: BledDest

Tutorial
Solution (BledDest)

1716F - Bags with Balls

Idea: BledDest

Tutorial
Solution (BledDest)

Read more »

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

By jerefigo, history, 37 hours ago, In English

We, the Argentine team (jignacioc, lucastarche, jerefigo and uliseslp) just arrived at the Rich Jogja hotel, after two days of international travel.

Read more »

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

By __BaD_mAn__, history, 27 hours ago, In English

Today I participated in the coding competition Codegoda hosted by Agoda. I'm not going to talk about their weird rules and coding environment. I just want to share some of my experiences regarding the problemset. In a word, worst experience ever. I just want to mention some things here that seem annoying to me and make me feel it was a waste of time participating in the contest.

Most of the problems require no more than 30 seconds of thinking to get the idea. The problemset was not standard. Expected more quality problems in such a big competition. In the problem of probability, it was mentioned to print up to 5 digits after the decimal point. What does it mean actually? Is it exactly 5 digits? Or at most 5 digits? If it is, then printing more than 5 digits should give wrong answer, right? I printed 10 digits and it passed 3 tests and gave wrong in the 4-th test case. I was thinking my idea/solution is wrong. Then wrote the bruteforce solution and wasted almost 1 hour finding out the actual problem. Printing 5 digits after the decimal point got passed all the public tests. Why it didn't give wrong answer verdict in the first 3 cases? Isn't it weird? They could clearly mention that we have to print exactly 5 digits.

The problem of checking whether two companies are from the same group or not is a very common problem of DSU/DFS. Why such a common well-known problem in such a contest? Are they taking speed test?

The problem of digit mapping was so annoying as we cannot copy/paste into the contest editor. It requires writing some similar types of lines multiple times. All you have to type so fast.

The problem of finding the best hotel within a budget range had a confusing statement. It was mentioned nowhere what should be printed if there is no hotel in the budget range given in each query. If it is guaranteed that at least one hotel exists in the budget range, then why it was not mentioned in the statement? Is there any issue in the dataset of this problem or any corner case? My fresh solution didn't pass after 3rd test -_-

I tried these 4 problems and found none of them interesting. Didn't try the other two problems. The problems are so poor compared to their magnificent advertisement. Overall it feels like a waste of time.

Read more »

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

By Ra16bit, history, 2 days ago, In English

Google Code Jam 2022 Virtual World Finals will take place today. They have published the list of finalists recently. For some reason SpyCheese and duality are not in the list. And there are 26 finalists this year (not 25), here they are:

GCJ Handle CF Handle Country CF Rating Finals before Best place before
Gennady.Korotkevich tourist Belarus 3771 8 Seven times GCJ World Champion (2014-2020)
Benq Benq United States 3513 2 5th @ GCJ 2021
Um_nik Um_nik Ukraine 3539 1 8th @ GCJ 2021
simonlindholm simonlindholm Sweden 2739 3 7th @ GCJ 2017
KalininN KAN Russia 3014 3 7th @ GCJ 2020
jiangly jiangly China 3688 0
Radewoosh Radewoosh Poland 3406 3 5th @ GCJ 2019
y0105w49 y0105w49 Canada 2867 0
ksun48 ksun48 Canada 3452 2 2nd @ GCJ 2020
molamola molamola. South Korea 3082 2 11th @ GCJ 2019
xll114514 MiracleFaFa China 3466 2 6th @ GCJ 2017
yutaka1999 yutaka1999 Japan 3190 2 10th @ GCJ 2020
CauchySheep slime China 3498 1 4th @ GCJ 2021
ImBarD Vercingetorix Russia 2929 0
lumibons lumibons Germany 2976 0
ACRushTC ACRush China 3047 7 Two times GCJ World Champion (2008, 2009)
qwerty787788 qwerty787788 Ukraine 2735 2 12th @ GCJ 2019
mhq mhq Belarus 2967 0
Snuke snuke Japan 3251 1 22nd @ GCJ 2017
ecnerwala ecnerwala United States 3318 3 3rd @ GCJ 2019 and 2020
dacin21 dacin21 Switzerland 2682 3 6th @ GCJ 2019
BigBag BigBag Ukraine 2765 0
Golovanov399 Golovanov399 Russia 2973 1 23rd @ GCJ 2018
NyaanNyaan Nyaan Japan 2720 0
zemen zemen Russia 2945 2 2nd @ GCJ 2017
mnbvmar mnbvmar Poland 3166 2 4th @ GCJ 2019

Best of luck to all the finalists!

Read more »

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

By IGM_BY_2023, history, 46 hours ago, In English
 
 
 
 
  • Vote: I like it
  • +100
  • Vote: I do not like it

By adamant, history, 21 hour(s) ago, In English

Hi everyone!

There is a well-known result about bipartite graphs which is formulated as follows:

In any bipartite graph, the number of edges in a maximum matching equals the number of vertices in a minimum vertex cover.

Knowing it you can easily find the size of a minimum vertex cover in a given bipartite graph. But what about actually recovering such cover? Well... There is an algorithm to it, but it's lengthy and not very motivated, so I constantly forget its details. However, there is a simple alternative, which is easily reproduced from scratch, even if you forget specific details.

Besides, there is another well-known result which is formulated as follows:

A bipartite graph has a perfect matching if and only if every subset $$$\alpha$$$ of one part has a neighborhood $$$\beta$$$ in the other part such that $$$|\beta| \geq |\alpha|$$$.

This result can be proven with a similar approach. It is likely known to those familiar with the topic, but still might be of interest to someone.

Read more »

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

By Fanofparliament56, history, 10 hours ago, In English

Hello everyone , hope all you are fine.

I have tried usco guide that's just ausum, but one small problem was there, I want to submit problems on usco like this -> http://www.usaco.org/index.php?page=viewproblem2&cpid=95

But not able to register I have tried with my 7 different emails, also I have tried to forget passwad but didn't work, they are not sending me mail, I have checked all spams and inboxes, can anyone guide me to submit answers there I am starting with cp, thank you all for your support. Thank you

UPDATE:- This Problem has been Resolved by using Different Address, But even after having account some of them might not be submitable, I would like to Express my Thank to DeMen100ns, lequangtrung123, b4nanacream, Abito to make this Solution Possible. also you can contact here-> bcdean@clemson.edu

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By chokudai, history, 2 days ago, In English

We will hold LINE Verda Programming Contest(AtCoder Beginner Contest 263).

The point values will be 100-200-300-400-500-500-600-600. We are looking forward to your participation!

Read more »

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