### atcoder_official's blog

By atcoder_official, history, 4 weeks ago,

We will hold AtCoder Beginner Contest 358.

We are looking forward to your participation!

• +78

 » 4 weeks ago, # |   +4 exited
•  » » 4 weeks ago, # ^ |   0 excited
•  » » » 4 weeks ago, # ^ |   0 excited
 » 4 weeks ago, # |   +37 Only 550 pts G!
 » 4 weeks ago, # |   0 Hi, i am new to competitive programming and new to AtCoder. I am curious about the rating score of ABC questions, what are their equivalent codeforces rating scores? Is their a formula that can do the conversion? Thx
•  » » 4 weeks ago, # ^ |   +8
•  » » » 4 weeks ago, # ^ |   0 Thanks very much!
•  » » 4 weeks ago, # ^ |   0 I don't have any recollection of there being official ratings for AtCoder problems; Scores/Points are relative and do not capture ratings particularly. You can however refer to the following two in conjunction to get an idea:Kenkoooo:Atcoder-Problems and Silverfoxxxy:Rating-Converter
•  » » » 4 weeks ago, # ^ |   0 Thanks very much!
 » 4 weeks ago, # |   +26 I refuse to write solution for F even if i'm getting paid.
•  » » 4 weeks ago, # ^ |   0 Exactly. I had solution after 1 minute of thinking but just implementing it seemed messy so I gave up on it.
•  » » » 4 weeks ago, # ^ |   0 that's not even the main thing , thing is output format could have been better , they just could have asked to output pair of cells which have wall between them
•  » » » » 4 weeks ago, # ^ |   0 Yeah that's why I said implementing seemed messy. Format is weird. I didn't want to generate sequences of characters.
 » 4 weeks ago, # | ← Rev. 10 →   +4 What the fuck is the output format of problem F ???What's the meaning of and the connected component containing the vertices (1,M) and (N,M) consists only of this path. ???just for harder implementation ???
•  » » 4 weeks ago, # ^ |   0 For human-readable
 » 4 weeks ago, # | ← Rev. 2 →   +2
 » 4 weeks ago, # |   0 26 correct 2 WA on C any idea submission
•  » » 4 weeks ago, # ^ |   0 Just go through every possibility $O(2^N)$
•  » » 4 weeks ago, # ^ | ← Rev. 2 →   0 your way of computing minima is not correctex- 001 ,010,110you only need shop 1 and 3 to fill the mask but your approach is greedy picking which is wrong and you will end up taking 1,2,3 hint-use bitmask
 » 4 weeks ago, # |   0 any idea for g?
•  » » 4 weeks ago, # ^ |   0 you only stay in only one cell
•  » » 4 weeks ago, # ^ |   0 You try to go to a certain point on a board then just spam staying in that point.Because of that, you can try to dp here, like dp[u][T] is the maximum value you will receive when you use T turns to go from start to u (all points here are converted into 1-D coordination).
•  » » » 4 weeks ago, # ^ |   0 is $T$ fixed for certain $U$?
•  » » » 4 weeks ago, # ^ |   0 I considered for max value cell only, will fix it
•  » » » 4 weeks ago, # ^ | ← Rev. 2 →   0 But how do you calculate T ? I was lucky to get AC doing similar thing using BFS but just kept increasing turns till I got AC.
•  » » » » 4 weeks ago, # ^ |   0 T <= H * W I suppose so
•  » » » » » 4 weeks ago, # ^ |   0 Yep but is there any proof on why T <= H * W. Is it because the number of unique paths from a cell to any other cell bounded by H * W ?
•  » » » » » » 4 weeks ago, # ^ |   0 Try 1968D - Permutation Game first. You can use almost same arguments for this problem.
•  » » » » » » » 4 weeks ago, # ^ |   0 Alright , Thank you !
•  » » » » » » » 4 weeks ago, # ^ |   0 Same argument.. what do you mean, I still can not understand why the maximum number of steps to check is H*W and I can not find any formal proof, this drive me crazy.
•  » » 4 weeks ago, # ^ |   +1 f i x,y means when Takahashi goes i steps and stops at (x,y), how many fun value can he get.Takahashi may walk for some steps and stopped at a position forever.It's easy to solve f i x,y when i<=n*m. And it's can be proved that Takahashi may walk at most n*m times, so the answer is MAX (f i x,y + a x,y * (K-i))
 » 4 weeks ago, # |   +5
•  » » 4 weeks ago, # ^ |   0 It's the same mistake that I did, and wasn't patient enough to even debug it after the contest so went through the editorial and just noticed that the dp table is going to have 3 states and I got what I was doing wrong, hope it provides you a hint :9
•  » » » 4 weeks ago, # ^ |   +3 yo same case , I also wasn't patient enough to debug and watched the editorial and yeah missed the crucial no of turns state
•  » » 4 weeks ago, # ^ | ← Rev. 2 →   +5 Shortest path to reach final cell is not enough.Consider this testcase - Spoiler5 5 1000 5 1 100 99 99 99 99 0 0 0 0 99 0 0 0 0 99 0 0 0 0 99 99 99 99 99 99 Answer is — 99989
•  » » » 3 weeks ago, # ^ | ← Rev. 3 →   0 but A[i][j] > 0 (never mind)
•  » » » 3 weeks ago, # ^ |   0 Thanks a lot!This is somewhat that is in testcase9
 » 4 weeks ago, # |   0 how E?
 » 4 weeks ago, # |   +23 Problem F is frustrating. I accept the other six problems quickly with no penalty, but I had wrong F for 5 times.
 » 4 weeks ago, # | ← Rev. 2 →   0 [deleted]
 » 4 weeks ago, # |   +4 Why does the C++ solution in the problem E's editorial unavailable?
•  » » 4 weeks ago, # ^ |   +5 Oh,sorry,maybe my internet has some problems.It is now available.
 » 4 weeks ago, # |   0 I think, I solved problem like today's F not long time ago, but don't remember, where. Anyone remember?Also, what happened with problem G? I've never seen anything such simple on this position.
•  » » 4 weeks ago, # ^ |   +8 G could have easily been a D/E imo.
 » 4 weeks ago, # |   +7 Anyone could hack my F please? I have been testing on it for about 1 hour but I don't know why it gets WA*3. #include #define int long long using namespace std; const int maxn=100+10; int n,m,k,a[maxn]; void solve(){ cin>>n>>m>>k; if(ka[(i-2)/4+1]?'|':'.'); } } else{ if((i/2)&1){ for(int j=1;j<=M;j++){ if(j&1) cout<<"+"; else cout<<(m-j/2+1<=a[(i-2)/4+1]?'-':'.'); } } else{ for(int j=1;j<=M;j++){ if(j&1) cout<<"+"; else cout<<(j/2==m?'.':'-'); } } } cout<>t; while(t--) solve(); return 0; } 
•  » » 4 weeks ago, # ^ |   +28 Your code fails when $n=3,m=5,k=13$. I am extremely sorry that you were disgusted by the authors!
•  » » » 4 weeks ago, # ^ | ← Rev. 3 →   +27 output: Yes +++++++++S+ +o.o.o.o.o+ +.+-+-+-+-+ +o|o.o|o|o+ +.+.+.+-+-+ +o.o|o.o.o+ +++++++++G+ 
•  » » » 4 weeks ago, # ^ |   +29 Thank you. I didn't notice that I can turn to the other side. And to be honest, I'm not disgusted XD anyway thanks a lot.
•  » » 4 weeks ago, # ^ |   +30 3 5 13 Yes +++++++++S+ +o.o.o.o.o+ +.+-+-+-+-+ +o|o.o.o.o+ +.+.+-+-+.+ +o.o|o|o|o+ +++++++++G+It seems that you filled the path in maze one row by one row, however, when n is odd, you can also fill the last row but your code did not.I also WA 3 for 5 times because of it, and it made me angry. However, after coming up with this situation, I accepted at once.I have a friend who is rank 45, he didn't passed the following testcase but also accepted F in 67 minutes.It is unfair, isn't it?3 3 9 Yes +++++S+ +o.o.o+ +.+-+-+ +o|o.o+ +.+.+.+ +o.o|o+ +++++G+
•  » » » 4 weeks ago, # ^ |   +23 You know that, I could pass the hack easily but I always got 1 RE. Luck is always unpredictable
 » 4 weeks ago, # |   +11 https://atcoder.jp/contests/abc358/submissions/54597481Could someone please tell why my D fails ???
•  » » 4 weeks ago, # ^ |   +3 don't use it only stores unique element let say a= 2,2,2,4,4,4and b= 2,2your approach will result in 2+4=6but optimal one is 2+2=4
•  » » 4 weeks ago, # ^ |   0 Use Multiset because element may repeat
 » 4 weeks ago, # |   +15 Can someone say why my Problem D is TLE Submission
•  » » 4 weeks ago, # ^ |   +18 You should use ms.lower_bound(b[i])
•  » » » 4 weeks ago, # ^ |   +10 can you please explain why does it make so much difference?
•  » » » » 4 weeks ago, # ^ |   +10 set:: lowerbound is a binary search for red and black trees, with a complexity of O (log n).std:: lower_bound for non randomly accessed containers, it is an iterator sequential search with a complexity of O (n).
 » 4 weeks ago, # |   +7 Can someone please debug my Problem G(18xAC,18xRE)Submission
•  » » 4 weeks ago, # ^ |   +10 1≤K≤10^9You cannot open a vector whose size is related to K.
 » 4 weeks ago, # |   +3 In problem F, O(n^2) is enough guys; all you have to do is do very little HOLY CASEWORK!!!
•  » » 4 weeks ago, # ^ |   0 OTZ
 » 4 weeks ago, # |   +15 Do they make AI more difficult to understand the statement by modifying important information in Problem F many times?
•  » » 4 weeks ago, # ^ |   +10 That's right!
•  » » 4 weeks ago, # ^ |   +14 I don't think so. I had never seen the input format or the output format when I was trying to solve Problem F because it's too long, but I still understand what the problem want me to do. I think AI is smart, and it may easily understand what did the problem mean. If AI can solve Problem F with correct information, it can also accept Problem F with wrong format.ABC is for more than ten thousand people. If the question surface is wrong, it will make many people feel confusion. So I think it's no need to modifying importand information in order to make AI more difficult to understand Problem F.
 » 4 weeks ago, # |   0 E was such a good problem.
•  » » 4 weeks ago, # ^ |   0 How to do it ?
•  » » » 4 weeks ago, # ^ | ← Rev. 3 →   0 It's DP+Combinatorics.If you have n items, among which m are unique with quantities(q1, q2, q3... qm), the number of distinct ways to arrange these items is: n!/(q1!*q2!...qm!) - (1) Now for DP, there are two states [i,len] (i denotes the alphabet we're currently at and len denotes the length of our sequence so far). Now, at each step, we attempt to take as many elements of that alphabet as possible. Therefore, the recurrence relation is: dp[i][len]=sum(dp[i+1][len-j]*mod_inverse(j)) for j= 0 to min(c[i],len) and base case is dp[26][0]=1 For each state, by using mod_inverse at each step of calculation we've got denominator of eqn (1), to get the whole expression multiply it by len!.Summation of dp[0][len] is your answer for len=1 to k.Here's a link to my submission.
•  » » » » 4 weeks ago, # ^ | ← Rev. 2 →   0 Thanks mate.Amazing Solution.I appreciate your effort into writing this.
•  » » 4 weeks ago, # ^ |   0 yep it's good
 » 4 weeks ago, # |   0
•  » » 4 weeks ago, # ^ |   0 Precompute the mod inverse for each ${factorial_i}$.
•  » » » 4 weeks ago, # ^ |   0 thx
 » 4 weeks ago, # |   0 G is a nice follow up to the recent Atcoder problem : ABC344F : Earn to Advance. I also have a blog, hints and practice contest for the concepts used in the first problem.
•  » » 4 weeks ago, # ^ |   0 your articles are good.
•  » » 4 weeks ago, # ^ |   0 I dont see any relation between G and Time travel technique, can you help me to elaborate more?
•  » » » 4 weeks ago, # ^ |   0 It makes the observation trivial that there will only be one cell where you stay multiple cells. And this cell would be retrospectively fixed as the maximum valued cell that you encountered in your journey. Just like we did in ABC344F: Earn to Advance.
 » 4 weeks ago, # |   0 Can anyone tell me why am I having a TLE XD My code
•  » » 4 weeks ago, # ^ |   0 OK. I'm turning to C++.Same code in python and C++ led to 2209ms and 64ms.Almost got me crazy trying to optimize further in python :(
 » 4 weeks ago, # | ← Rev. 2 →   0 F is surprisingly neat if figure out the pattern, very fun to upsolve.
 » 4 weeks ago, # |   0 I don't like how I can go from TLE to a relatively fast AC in E simply by precomputing nck values.
•  » » 4 weeks ago, # ^ |   0 you don't need NCK values , you just have to calculate factorials and mod inverse of it
 » 4 weeks ago, # |   0 OMG i don't know why i did not try to solve G, got stuck in F, when i read G i thought some matrix exponentiation stuff so i left it. i should have tried G
 » 4 weeks ago, # |   0 Can problem G be solved using Dijkstra's Algorithm?
•  » » 4 weeks ago, # ^ |   +1 No shortest path is not enough, look at this comment
•  » » » 4 weeks ago, # ^ |   0 I see, thank you!
 » 4 weeks ago, # |   0 The G is pretty simple than usual rounds:D
 » 4 weeks ago, # |   0 you should swap between c and d
 » 4 weeks ago, # |   0 When would the official editorial of the round be released on the website?
 » 4 weeks ago, # |   0 I think G is easier than E.
 » 4 weeks ago, # |   0 ok
 » 4 weeks ago, # |   0 Who has stronger data to help me hack my code for F question please?I have tried all the known strong data.submission
 » 3 weeks ago, # | ← Rev. 2 →   0 Found a test that fails the fastest solution for task G. 1 9 341 480 28 4 98 84 2 67 57 100 The optimal solution is to take 98 * 34 = 3332, but merhorn's solution outputs 3330