FiveSixFiveFour's blog

By FiveSixFiveFour, history, 2 months ago, In English

As Israeli contestants posted both the APIO 2019 Discussion Thread & the APIO 2020 Discussion Thread, I feel obligated to post this year's discussion thread :D

This year, APIO 2021 is hosted again by Indonesia. For most of the participating countries, APIO 2021 serves as one of the main "TST"s (Team Selection Tests) for IOI 2021 (including Israel). The competition's official website is located Here.

The competition is IOI style, 5 hours long. A maximum of 50 submissions is allowed for each problem. A participant's final score is the sum of the scores the participant got on each problem. A participant's score for a problem is the sum of the scores the participant gained in each subtask of the problem. A participant's score for a subtask is the maximum grade the participant's submissions achieved for that subtask.

APIO Problems are of high quality and are considered good practice for those who wish to participate in IOI.

This thread is intended for discussing results. Furthermore, after APIO 2021 Open Contest ends, this thread shall also be used for discussing the solutions to the problems given in the competition.

Note: Before jonathanirvings writes a comment like this yet again, please note that discussing solutions before APIO 2021 Open Contest ends is prohibited. However, discussing results should be allowed as the official window (based on the official website) has ended.

Read more »

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

By FiveSixFiveFour, history, 3 months ago, In English

Hello Codeforces!

Today was Codeforces Round #720 (Div.2), in which I solved problem D — Nastia Plays with a Tree. As I find my solution different from the solutions I heard of after the contest, I will explain it in detail in this blog post. I will note that you still might find value in reading this if you solved the problem, as my proposed solution also maintains at every stage the graph being a forest (i.e I don't create any cycles).

The Solution

Solution By FiveSixFiveFour

This was very challenging to implement during the contest yet eventually I got AC 10 minutes before the end of the round. Thanks for the contest! :D

Read more »

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

By FiveSixFiveFour, history, 5 months ago, In English

Dear codeforces community. Lately, I have started participating in some division 1 rounds, and I experience a weird issue. Suppose some Div1's problems are >= 2100 in difficulty. Then most purples after reading the problems choose to quit and not do the round. The purples that do choose to do the round, might not even solve the first problem, but the main issue is that a round is only rated for you if you submit. The latest codeforces div1 round (round #707) had about 1300 registered participants, but only ~700 submitted something, and only ~620 solved a problem. So solving problem A with bad timing causes you to be last place, despite doing better than half of the participants.

I suggest that a round should be rated for a user if he views one of the problems of the round as a registered participants. Was this suggested before? I think atcoder had some contests that worked that way but I am not sure.. Any way, the current system causes low div1's to simply quit, causing the people that do submit and succeed to lose massive amounts of rating.

I would appreciate discussing the issue in the blog's comment section.

Thanks, FiveSixFiveFour

Read more »

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

By FiveSixFiveFour, history, 8 months ago, In English

The same announcement, Expert posted 6 hours before Master. Expert got -10, Master got +74.

Your comments?

https://codeforces.com/blog/entry/85359

35 hours ago:

https://codeforces.com/blog/entry/85354

41 hours ago (6 hours before the above post):

Read more »

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

By FiveSixFiveFour, history, 8 months ago, In English

Congratulations 1-gon for achieving the #1 spot in the top contributor leaderboards!

Read more »

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

By FiveSixFiveFour, history, 8 months ago, In English

Opening this thread to discuss Romanian Masters of Informatics (RMI) 2020 Problems & Results.

Hope everybody had a great competition!

http://rmi.lbi.ro/rmi_2020/

Read more »

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

By FiveSixFiveFour, history, 8 months ago, In English

Opening this thread to discuss XII International Autumn Tournament in Informatics (IATI) Problems.

Hope everybody had a great competition!

https://iati-shu.org/en/home/

Read more »

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

By FiveSixFiveFour, history, 9 months ago, In English

As round 696 is getting closer, our chad Um_nik finally achieved 6969 followers on codeforces! Congratulations!

Read more »

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

By FiveSixFiveFour, history, 10 months ago, In English

I think it would be cool if a user would be able to make a paragraph about themselves and make it appear on their codeforces profile.

Was this feature suggested before? I see no issue implementing it within a few days and it would be cool for it to be added.

Read more »

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

By FiveSixFiveFour, history, 11 months ago, In English

Opening this thread for discussion of APIO 2020.

Not really sure whether the problems themselves can be discussed yet (open contest) but the competition has officially ended :)

Edit 1: APIO 2020 Scientific Committee note: "As you mentioned, please refrain from publicly discuss APIO 2020 problems as there will still be an APIO 2020 open contest (public). We can publicly discuss the problems once the open contest has finished."

Feel free to discuss results, we'll only be able to discuss problem content after the open contest ends.

Edit 2: Should be good now :)

Read more »

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