LNight121's blog

By LNight121, history, 32 minutes ago, In English

Thanks to everyone who participated in this round! I hope you enjoyed the problems! Apologies for the overly simplistic Div2D and the trivial Div1D(and the statements with poor readability). I think that the whole difficulty of Div1D lies in how people hack the solutions of other participants: if nobody hacks, this problem is easier than Div1C, but if somebody hacks, it becomes hard. I will explain this in more detail in the tutorial below.

2288A - Youmu Konpaku and the Duel

Hint 1
Hint 2
Tutorial

2288B1 - Yukari Yakumo and the Boundary Stones (Easy Version) / 2287A1 - Yukari Yakumo and the Boundary Stones (Easy Version)

Hint 1
Tutorial

2288B2 - Yukari Yakumo and the Boundary Stones (Hard Version) / 2287A2 - Yukari Yakumo and the Boundary Stones (Hard Version)

Hint 1
Hint 2
Hint 3
Hint 4
Tutorial

2288C - Reimu Hakurei and the Youkai

Hint 1
Hint 2
Tutorial

2288D - Satori Komeiji and the Metro / 2287B - Satori Komeiji and the Metro

Hint 1
Hint 2
Tutorial

2288E - Cirno and the Math Problem / 2287C - Cirno and the Math Problem

Hint 1
Hint 2
Tutorial

2287D - Patchouli Knowledge and the String

Hint 1
Hint 2
Hint 3
Tutorial
Code with high-resolution clock
Code with sha-256

2287E1 - Marisa Kirisame and the Game (Easy Version)

My initial problem only had an $$$n \le 10^5$$$ version and an $$$n \le 500$$$ version; thanks to Error_Yuan for proposing this $$$n \le 10^4$$$ version.

Hint 1
Hint 2
Hint 3
Tutorial

The idea comes from the power level settings of some fantasy works. In many fantasy works every character has a power level, and the levels differ wildly (for example, Tier 10 is an ordinary human, while Tier 9 is a superhuman). In this setting I created this problem, so that you can see how a battle between two groups should happen in such a fantasy world, and what the best arrangement is if a group wants to defeat another group.

2287E2 - Marisa Kirisame and the Game (Hard Version)

Codex did not pass this problem during testing, which surprised me a lot.

Before reading, please go through the hints of 2287E1 - Marisa Kirisame and the Game (Easy Version), but no need read its tutorial, because what follows is completely different.

Hint 1
Hint 2
Hint 3
Hint 4
Tutorial

This problem was originally conceived as a two-attribute version (attack power and defense power), but I only know an $$$O(2^n)$$$ solution for it.

  • Vote: I like it
  • -1
  • Vote: I do not like it

»
7 minutes ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by LNight121 (previous revision, new revision, compare).

»
6 minutes ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

great A

»
6 minutes ago, hide # |
 
Vote: I like it +8 Vote: I do not like it

I wonder why Um_nik didn't fucking slime you out for such terrible problemsetting

»
4 minutes ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

WHY DP IN PROBLEM B

»
1 minute ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

Why $$$n \leq 10^5$$$ on multiple problems if the intended time complexity is $$$O(n)$$$ or $$$O(n \log n)$$$?

»
1 minute ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Isnt B1 just greedy? DP is a lil bit overkill

»
a moment ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Is it just me or this contest is kind of weird