We will hold AtCoder Beginner Contest 322.
- Contest URL: https://atcoder.jp/contests/abc322
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20230930T2100&p1=248
- Duration: 100 minutes
- Writer: Nyaan, PCTprobability, chokudai
- Tester: leaf1415, yuto1115
- Rated range: ~ 1999
- The point values: 100-200-250-400-475-550-600
We are looking forward to your participation!
Note to self: Solve in this order A-B-D-E-C
why?
Because C is usually hard to write:(
It's not 'usually', it's 'always'!
v_v
Isn't it D?
No , it's always C
Edit: yes it's D
I don't think the problems are very good.
I have to say I'm wrong……C is quite easy.
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.
Deleted.
Three Chinese are talking in English haha...now it's four
Why? I get an Accepted verdict with just around 10 lines of code for problem C? Today's C problem seems quite straightforward.
Yes, you are right. Today's D problem is very hard!
But, in fact, I will solve in this order: A-C-B-D-E
Because I think C is easier than B
Am I weird for wanting to solve it in the order A-C-B-F-E-D?
C is quite easy today, even easier than B qwq.
I solved B way faster than C.I found C to be hard.
this time C was easy as hell
I'm looking forward to seeing the problems of the contest! Atcoder has problems which are very interesting and useful for learning.
True.
Yeah, looking forward to getting a positive delta:D
why 7 problems instead of 8?
It changed from ABC319. See the post archive.
I hope my performance can get 2100+.
Good luck with all the questions!
Good luck everyone ^^
Posting this with no context
D,E are so much difficult :(
Did you understand what E mean?
Writers of D and E I am coming to your house
E was easy,D was difficult,problem like F is also present in codeforces edu section.
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
I guess today's test was a confidence booster
How can we solve E using DP ? what's the state and transition
States were index and parameters. you can see my submission for ref.
https://atcoder.jp/contests/abc322/submissions/46109065
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.
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.
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.
True, but it is quite hard to write. Sad.
Which problem in Luogu is F?
P2572
thx, going to get double experiences now :)
In fact it is not the same one. Problem F is part of it:)
fucking dirty D
Comment deleted.
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
D is a good problem , but i dont like it. hope never see some as it again
what trash D and typical F......
D is fkin implementation
E is fkin DP
F is fkin segtree template
Problem F is so typical, it is even an exist problem.
Is there some elegant less code solution for D? Otherwise the problem is just implementation hell.
Sometimes you have to do some tedious works. D is just a reflection of life which is very educational.
what's wrong with this round????? boring as shit.
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
trash D
First time for me to write a 11-level nested for-loop in a contest!
I wrote 7 level nested loop
Implementation of D insulted my implementation skill or is it trash itself ?
The D and E are not very good,they don't have many thinking difficulty, but need a lot of code
You are right
Why this contest felt like till C, there's nothing, and then the difficulty jumps sudden?
C is easy,true
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
Is there someone who can help me? I'm having trouble with this code not working in E.
My E code
I've got submission like you @@
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.
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:
Lol, the irony that this guy wrote the alternate solution in official editorial 🤣
It seems that the first polyomino of the second hack violates the constraints.
:v D is a big problem when implementing, E is DP tricky
Some people cheat in problem F. Like this submission, it is nearly the same as the first article in the luogu tutorial.
I agree.
I disagree.
I disagree too.
I agree.
I agree.
I disagree.
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).
C is easier than usual,D is harder than usual
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,