We will hold Daiwa Securities Co. Ltd. Programming Contest 2023(AtCoder Beginner Contest 331).
- Contest URL: https://atcoder.jp/contests/abc331
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20231202T2100&p1=248
- Duration: 100 minutes
- Writer: kyopro_friends, Nyaan, evima, chokudai
- Tester: yuto1115, nok0
- Rated range: ~ 1999
- The point values: 100-200-300-450-450-525-625
We are looking forward to your participation!
Atcoder beginner contests are really great.
I hope I can get better grades than before......
me too
D with 450 points… seems scary
Yeah……Maybe i will solve E first.
Guess the order of difficulty among A,B,C,D :)
I guess A < B < C < D.
Good luck to everyone!
D is more scary than E……
我是菜狗
me too
Maybe you should use English instead of Chinese that this is a English website.
I just want to express my powerless feeling. QAQ
You just want to make Chinese think you are vegetable(:)
how did you make your contribution into a negative number?
D seems pretty complex and difficult...
Problem F is exactly same as this.
Solution can be found online anywhere, one of the solution is — Solution
What is mistake in F https://atcoder.jp/contests/abc331/submissions/48142191
$$$D$$$ is such a heavy implementation problem ,I took a lot of time in it to solve ,like finding stupid bugs and typos killed a lot of time of mine, then went to $$$E$$$ just to find that it's just a submission bait which I speed ran implementation in last 4 mnts but missed out by fucking 3 seconds , such a stupid performance in the end which could have been a far better contest if I executed implementation well fuck!!
Lol I got nervous and solved B by DP, turns out it has better time complexity and almost O(1) space
my solution was $$$O(N^3)$$$ and you did it speaks of bad contest giving style where you overkill an easy problem and kill time , best thing of Atcoder Beginner Contests is that they help you increase speed and improve implementation skills
because I got nervous personally easier for me to think dp than brute force or greedy
I solved B by DFS.
I think only problem D and G were smart anyone agree?
you solved $$$G$$$?
Atcoder please do not directly copy the CSES problem.
+1 They just copied problem F from Palindrome Queries
What is mistake in this soln for F https://atcoder.jp/contests/abc331/submissions/48142191
D should definitely be worth more points than E
I think this too
How did you solve E?
E is like E in last Atcoder beginner contest, just add one point:
Enumerate the main dish and find the most expensive side dish, then update the answer.
I have solved it using segment tree with update. https://atcoder.jp/contests/abc331/submissions/48142030
hint: The answer is among the L+1 largest pairs.
I just use simple multiset idea for every element in B make a multiset of elements of A that are not allowed for that B, then from a global multiset of all the values in A remove those from it. Do this for every element in B and take cur + end element of multiset.
One thing to take care: Don't do this is B has all the elements of A, then it should be skipped as it can't be paired
I think it's very easy idea maybe
This work and not TLE because L <= min(1e5, N*M-1)
What? Three almost SAME ideas?
And I can explain that complexity of using just normal set is $$$O(L \log M)$$$.
Instead of enumerating solve B in O(n)
That was smart approach.
Why so many Gs (and Ex when there was Ex) are math?
Is it just me or most of them are about finding the expected number?
why expected value questions are asked most frequently, i am just bad at probability..
+1, adding Centroid Decomp, HLD, CHT or flows sometimes would be good at G.
cause math so good
Problem F was copied from CSES. Even the title. 😒
Problem A was the hardest TBH.
Here is my screencast (just typing)
You type faster than I think.
Problem F can be passed by force.
no sense between the title and problem statement on problem B.
Can someone provide a better explanation for G. The editorial is too tough to understand.
I do think so.