### atcoder_official's blog

By atcoder_official, history, 10 months ago,

We will hold AtCoder Beginner Contest 322.

We are looking forward to your participation!

• +35

 » 10 months ago, # |   +27 Note to self: Solve in this order A-B-D-E-C
•  » » 10 months ago, # ^ |   0 why?
•  » » » 10 months ago, # ^ |   +11 Because C is usually hard to write:(
•  » » » » 10 months ago, # ^ |   +5 It's not 'usually', it's 'always'!v_v
•  » » » » » 10 months ago, # ^ |   +5 Isn't it D?
•  » » » » » » 10 months ago, # ^ | ← Rev. 2 →   +5 No , it's always CEdit: yes it's D
•  » » » » » » » 10 months ago, # ^ |   0 I don't think the problems are very good.
•  » » » » 10 months ago, # ^ |   +5 I have to say I'm wrong……C is quite easy.
•  » » » » » 10 months ago, # ^ |   0 C is usually worth 300 points, but this time it is only worth 250 points. So, it is expected that C is easier this time.
•  » » » » » 10 months ago, # ^ | ← Rev. 2 →   0 Deleted.
•  » » » » » 10 months ago, # ^ |   0 Three Chinese are talking in English haha...now it's four
•  » » 10 months ago, # ^ |   0 Why? I get an Accepted verdict with just around 10 lines of code for problem C? Today's C problem seems quite straightforward.
•  » » » 10 months ago, # ^ |   0 Yes, you are right. Today's D problem is very hard!
•  » » 10 months ago, # ^ | ← Rev. 2 →   0 But, in fact, I will solve in this order: A-C-B-D-E
•  » » » 10 months ago, # ^ |   0 Because I think C is easier than B
•  » » » 10 months ago, # ^ |   0 Am I weird for wanting to solve it in the order A-C-B-F-E-D?
•  » » 10 months ago, # ^ |   0 C is quite easy today, even easier than B qwq.
•  » » » 10 months ago, # ^ |   0 I solved B way faster than C.I found C to be hard.
•  » » 10 months ago, # ^ |   0 this time C was easy as hell
 » 10 months ago, # |   0 I'm looking forward to seeing the problems of the contest! Atcoder has problems which are very interesting and useful for learning.
•  » » 10 months ago, # ^ |   0 True.
 » 10 months ago, # |   0 Yeah, looking forward to getting a positive delta:D
 » 10 months ago, # |   0 why 7 problems instead of 8?
•  » » 10 months ago, # ^ |   +2 It changed from ABC319. See the post archive.
 » 10 months ago, # |   0 I hope my performance can get 2100+.
 » 10 months ago, # |   0 Good luck with all the questions!
 » 10 months ago, # |   0 Good luck everyone ^^
 » 10 months ago, # |   +3 Posting this with no context
 » 10 months ago, # |   0 D,E are so much difficult :(
•  » » 10 months ago, # ^ |   0 Did you understand what E mean?
 » 10 months ago, # |   0 Writers of D and E I am coming to your house
•  » » 10 months ago, # ^ |   0 E was easy,D was difficult,problem like F is also present in codeforces edu section.
•  » » » 10 months ago, # ^ |   0 I kinda disagree D is easy but the implementation part is too much for an ABC-D problem and E is kinda of no brainer as well and the implementation also a bit too much
 » 10 months ago, # |   0 I guess today's test was a confidence booster
 » 10 months ago, # |   0 How can we solve E using DP ? what's the state and transition
•  » » 10 months ago, # ^ |   0 States were index and parameters. you can see my submission for ref.
•  » » 10 months ago, # ^ | ← Rev. 4 →   0 it's pretty easy it's knapsack type of dp where either you pick a plan or no but since you have atmost 5 parameters where you can add the A[I][J] you can hardcode those states and you will have a dp[N][6][6][6][6][6] and transition you have two options skip or add the a[i][0] to the first parameters a[i][1] ... to a[i][K] but you should be careful since we need to be atleast P you don't have to keep adding while it's above P so you can do this trick of max(a[i][0] + Par1 , P) where Par1 is the first parameter etc... Or you can use map as as DP array to store all the 6^5 possible states instead of hard coding them.
 » 10 months ago, # |   -9 What is the purpose for setting the problem D? It uses almost no algorithm!E and F is both easier than D in coding, and D takes me more time.I don't think problems like D is good.And also, F is an original problem in Luogu.
•  » » 10 months ago, # ^ |   +28 The purpose is to test your implementation skills and speed. These kinds of problems often require you to compose your code correctly into functions in order to save time spent writing code in the contest. I think they are good to have on occasion, but maybe better in contests that are a little longer.
•  » » » 10 months ago, # ^ |   0 True, but it is quite hard to write. Sad.
•  » » 10 months ago, # ^ |   0 Which problem in Luogu is F?
•  » » » 10 months ago, # ^ |   0 P2572
•  » » » » 10 months ago, # ^ |   0 thx, going to get double experiences now :)
•  » » » » » 10 months ago, # ^ |   0 In fact it is not the same one. Problem F is part of it:)
 » 10 months ago, # |   +5 fucking dirty D
•  » » 10 months ago, # ^ | ← Rev. 2 →   0 Comment deleted.
 » 10 months ago, # |   +9 Is there a way to do F other than lazy bashing? Also D is the most awful implementation I have had the misfortune of solving
 » 10 months ago, # |   0 D is a good problem , but i dont like it. hope never see some as it again
 » 10 months ago, # | ← Rev. 2 →   -6 what trash D and typical F......
 » 10 months ago, # |   +14 D is fkin implementationE is fkin DPF is fkin segtree template
 » 10 months ago, # |   +3 Problem F is so typical, it is even an exist problem.
 » 10 months ago, # |   0 Is there some elegant less code solution for D? Otherwise the problem is just implementation hell.
 » 10 months ago, # |   0 Sometimes you have to do some tedious works. D is just a reflection of life which is very educational.
 » 10 months ago, # |   -18 what's wrong with this round????? boring as shit.
 » 10 months ago, # |   0 Can anyone explain how (if possible) I can improve my method to work for D. Basically, I'm tiling in a checkerboard manner, with the observation that if a polyomino is even, the black and white squares will match, so polarity can either be Odd Odd Even or Even Even Even. Then I check if it's possible to match up to equate. This fails on sample 3 and 3 other random cases. I refuse to believe that there's a non-brute force method, so can someone improve my code to AC? Thanks.Here is a link to my submission:https://atcoder.jp/contests/abc322/submissions/46104612
 » 10 months ago, # |   -27 trash D
 » 10 months ago, # |   0 First time for me to write a 11-level nested for-loop in a contest!
•  » » 10 months ago, # ^ |   0 I wrote 7 level nested loop
 » 10 months ago, # |   -15 Implementation of D insulted my implementation skill or is it trash itself ?
 » 10 months ago, # |   0 The D and E are not very good,they don't have many thinking difficulty, but need a lot of code
•  » » 10 months ago, # ^ |   0 You are right
 » 10 months ago, # |   0 Why this contest felt like till C, there's nothing, and then the difficulty jumps sudden?
 » 10 months ago, # |   0 C is easy,true
 » 10 months ago, # |   -18 Immediately after looking at D, I didn't want to solve it.After looking at evima's video editorial, I just want to think that the task never existed in all history.Like seriously what is this abomination
 » 10 months ago, # |   0 Is there someone who can help me? I'm having trouble with this code not working in E.My E code
•  » » 10 months ago, # ^ |   0 I've got submission like you @@
 » 10 months ago, # | ← Rev. 2 →   0 F is an old problem (it is a easy version of SCOI2010 序列操作(SC, Sichuan, is a province of China)).I think E is better, the trick is not very very easy to think of.D is hard to write.
 » 10 months ago, # | ← Rev. 2 →   +6 Tests for problem D are a bit weak. For example, this submission is wrong because if all three pieces overlap at the same place, it will be judged as correct. The following test can hack it. #### #### #### #### #### #### #### #### #### #### #### #### upd: There is another problem with the code, I have no idea how it could possibly have passed. Hack: .#.# .... .... .... ###. .### #### ###. .... .... .... ...# 
•  » » 10 months ago, # ^ | ← Rev. 2 →   0 Lol, the irony that this guy wrote the alternate solution in official editorial 🤣
•  » » 10 months ago, # ^ |   +10 The given polyominoes are connected. In other words, the squares that make up a polyomino can be reached from each other by following only the squares up, down, left, and right. It seems that the first polyomino of the second hack violates the constraints.
 » 10 months ago, # |   0 :v D is a big problem when implementing, E is DP tricky
 » 10 months ago, # |   0 Some people cheat in problem F. Like this submission, it is nearly the same as the first article in the luogu tutorial.
•  » » 10 months ago, # ^ |   0 I agree.
•  » » » 10 months ago, # ^ |   +10 I disagree.
•  » » » » 10 months ago, # ^ |   0 I disagree too.
•  » » 10 months ago, # ^ |   0 I agree.
•  » » 10 months ago, # ^ |   0 I agree.
•  » » » 10 months ago, # ^ |   +1 I disagree.
•  » » 10 months ago, # ^ |   0 What are you guys expressing while opening more than one account at the same time. It seems to be that there are only 4 people in this comment(not including me).
 » 10 months ago, # |   0 C is easier than usual,D is harder than usual
 » 9 months ago, # |   0 Hello, in problem D editorial, there's proposition of using binary operation : https://atcoder.jp/contests/abc322/editorial/7311. To be honest, I didn't understand it at all. Can someone explain it further. Thank you,