Problem F is interesting because it need DP and Greedy at same time. Problem G is just brute force to build a prepared data. So not very funny. Problem a little bit complex to implement. Nothing special for other problems.…
Of course a DP problem. But the interesting thing is, this problem need Greedy at same time. It's very easy to define DP state like:…
This round of Div2 is easier than average. Every problem is not so complex. Most of them are thinking or implementation problem. Not hard, just have many small logics.…
Solution Let's consider the scenario $n=2$. Because at most change two elements. So the most number of different points is 4.…
Solution Better to be classified as implementation problem. Lots of details. Get Lots of WA. Attention: You are not allowed to use leading zeros for $x$ and $y$.…
Solutions for A, B, C and D in Codeforces Round #712 Div2.…
Fixed two colors cross-painted until one of the colors fills the half of the map. After that, the remaining half can be filled with one of the remaining two colors base on the input.…
This round of Div3 is interesting. Problem G is a basic DP + number theory + very strict time limit. The problem F is a complex implementation problem. The problem D sounds like DP. But actually just a greedy and binary search problem. Interesting.…
蜀ICP备19018968号