We will hold AISing Programming Contest 2021（AtCoder Beginner Contest 202）.
- Contest URL: https://atcoder.jp/contests/abc202
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20210522T2100&p1=248
- Duration: 100 minutes
- Number of Tasks: 6
- Writer: Kodaman, sheyasutaka, YoshikaMiyafuji
- Tester: physics0523
- Rated range: ~ 1999
- The point values will be 100-200-300-400-500-600.
We are looking forward to your participation!
The upcoming ARC , i.e. on this Sunday , clashes with Google Kickstart , Can't it be preponed or postponed?
First time I was able to solve more than 3 questions!!
How to solve D? Thanks.
Here is what I believed to be a straightforward approach:
Understand that kth lexicographically shortest string means that there will be $$$total — k$$$ strings that will be lexicographically greater than it. An alternate way of saying that is that you have to leave $$$total — k$$$ strings behind. Let us call this number $$$remaining$$$. It is not difficult to compute that,
Now iterate over every position from 0 to n-1, and keep track of the remaining number of a and b. In every position, we have 2 possibilities. Putting either a, or b. Now if we put an 'a' in the current position, how many strings are we immediately getting ahead of? Those many in which there would be a 'b' in the current position, right? That number is,
Now, if it is OK to leave behind those many strings, we put an 'a' here, and accordingly update the remaining Else, we put a 'b'. How do we understand if it is OK to put an 'a'? The condition is,
What if once remaining becomes 0? Well, that means we have no more strings to leave behind. We can then simply create the lexicographically shortest string possible from that position. That is by printing all b's first and then the a's. But it is also fine to go with the flow and check manually as I did.
Here is my submission following this approach.
this is my depth first search for E. I am maintaining a map for every node in which I have kept a count of number of having a distance x from the node.
But I am getting tle on few test cases to help me how to optimize it.
submission link : https://atcoder.jp/contests/abc202/submissions/22827434
vector<map<int,int>> l(nax); void dfss(int u , int p = -1){ for(auto x : edges[u]){ if(x != p){ dfss(x,u); } } l[u][0] = 1; for(auto x : edges[u]){ if(x != p){ for(auto y : l[x]){ l[u][y.first+1] += y.second; } } } }You can use a count array and solve the queries offline.
All you need is the euler tour of the tree.
The entire problem will be solved in linear time. code
Wow, I feel so lucky to get the first place! I recently came across a problem very similar to F, which I think might be the reason.
could you explain your thought process for F, I got that we have to use DP somehow with triangle decompositions and the fact that triangle area*2 is integer, but what was the main cracking hint for you for this question.
can you please explain your solution and share the link to a similar problem?
Interesting technique for E in the editorial!
I wonder if anyone else answered the queries offline using small-to-large merging (https://codeforces.net/blog/entry/67696). For each node
u, we can track the multiset of depths of descendents ofu, and use this to answer the queries involvingu. Then the multiset foruis the union of the multisets of its children, plus a singleton set with the depth ofu. In fact this is almost exactly the same as the linked problem, where the colour of a node is its depth.I did it offline with small to large merging — https://atcoder.jp/contests/abc202/submissions/22827419
I did the same. Luckily, I had solved a problem with the same technique today itself. I think it can be done with Euler tour+ binary search as well but this way seemed much more easier to code.
PS.-Just saw that the editorial has much more cleanly implemented the Euler tour method, contrary to my expectations.
Wow, there's already a detailed official English editorial (https://atcoder.jp/contests/abc202/editorial). Is that going to be the case for ABCs going forward?
For the last 10 contests I have seen that editorials are available as soon as contest ends.
Can somebody help me identify my mistake in E? My solution uses the same idea as the one from the editorial. https://atcoder.jp/contests/abc202/submissions/22829588
Edit: I found the issue — I was binary searching for "out[u]" on the out time array... but have to do both binary searches (in[u] + out[u]) on the in time array
https://atcoder.jp/contests/abc202/submissions/22839873
It's been six months. I'll share my approach for E. An easy observation is that we only have to count the # of nodes in subtree of U with depth D from the root. First, find the dfs_order & depths & subtree_size of the tree in one dfs. Then, we can perform offline queries with MO's algorithm to count # of nodes in range with depth D My submission
I solved E with the help of merge-sort tree. We can create a pair of entry time and distance for every node and sort them on the basis of entry time. Then after handling some cases (i.e when Di is less than distance of root from Ui.), we just have to count number of values equal to D in the range entry time[u] and exit time[u] for which I used merge sort tree.
__hermit__ can you please share you submission, Thanks!
sure, (A bit ugly code though)
i Really dont understand D problem . Can anyone Elaborate more cleaarly . How can we put 'a' in ith place ?
You may follow this
Bruh how toal is C(a+b,a) why not C(a+b,b). Also i didnt understand remaining>=nCr(a+b−1,b−1). How ?
Was D harder than usual???
Is there any plan for atcoder rounds to be later in the morning (like 7). the usual times (4am, 5am, and at best 6am) are too early for me and presumably other west coasters.
probably set as per Japanese Standard Time. It's around evening for them.
Can anyone explain the solution of problem F based on Graham Scan? The editorial Atcoder provided says almost nothing detail about it.
This is my solution on F, hopefully it will be clear enough :)
Sort the points from the top-most one to the bottom-most one (in case of same y, sort from the right-most to the left-most). Afterwards, apply a "custom convex hull" for each prefix of points in the sorted array (the last point in the prefix is the lowest point in the convex hull). Before convex hull, mind Pick’s theorem. This tells us that we are actually interested in the parity of the number of integer points on polygon’s perimeter.
Sort the points according to Graham Scan. Afterwards, store
dp[i][j][k]— the number of partial polygons starting from the lowest point and ending with the j-i segment, having k = (number of integer coordinates on the perimeter) % 2. In fact, there will be no Graham Scan, but a dp building which can be understood easier if you refer to Graham Scan.For building this dp, we will iterate 0 <= k < j < i < n, and update
dp[j][i][nr % 2] += power(2, interior[i][j]) * dp[k][j][0]anddp[j][i][(1+nr)%2] += power(2, interior[i][j]) * dp[k][j][1], wherenris the parity of the number of integer coordinates on the j-i segment. Also,interior[i][j]is a coefficient which denotes the number of points which can be taken in the answer set without altering the convex hull containing the i-j segment. This can be precomputed at the beginning of the convex hull. Basically, any k such that i < k < j which is interior to the polygon should be counted.Finally, any dp[k][j] (0 < k < j < n), such that k-j-0 is a valid ending of the Graham Scan, can be considered in the final answer. The final complexity for this solution is O(N^4) with proper precomuputation.
Wow, this is great! Thanks a lot bro ^v^~
How to solve F？