Thank you atcoder for the wonderful weekend !!

I wish it will be a good round！

Why so easy A,B,C,D,E?

Why so much hate in this world cry

Get AC on A, B, C, D, E and WA only on the last of the 60 tests of the F...

![ ]()

How to solve F!

How to solve problem E?

why greedy for F fails? anyone Please?

this F is not very hard,i think,but has a number of details to deal with.

i finally got accepted after 5 tries with a loooooooooooooong code.

Got 457 lines of code in F)

E anyone?

I had a lot of TLEs with my solutions for this contest. For example, here is my code for problem E (C++):

#include <iostream>
#include <cmath>
#include <vector>
#include <algorithm>

using namespace std;

int main(){
		int N, count=0;
		cin>>N;
		int att[N];
		
		for(int i=0; i<N; i++){
			cin>>att[i];
		}
		
		for(int i=0; i<N-1; i++){
			
			for(int j=i+1; j<N; j++){

				if(abs((i+1)-(j+1))==(att[i]+att[j])){
					count++;
				}
			}
		}
		
		cout<<count;
	}
	

I got AC for half of the test cases, and TLE for the other half. Can anyone tell me why?

Also, if someone can tell me what might generally be the case when AtCoder grading returns a TLE, please let me know. Thanks in advance!

What is the approach for F?

I tried defining each of the 8 choice possibilities (For AB choose A first or B if both remain, similary for AC and BC) at the start and check if it works. Do you have to do something like this at each step and maintain an 8 * n DP or something like that?

For F I did complete search using recursion and it passed. Can anybody explain why?

can someone help me in problem D ?

English Editorail of F

Three Variables Game • When A + B + C = 0, N is 1 or more, so the answer is No. • When A + B + C = 1, at least one of the two variables is zero at any time, so the action on each turn is uniquely determined. • When A + B + C> = 2, the answer is No if the variables added and subtracted in the first turn are both zero, otherwise the answer is Yes. In the latter case, you can keep one of the variables being added positive by taking the following strategy each turn. {When one of the variables to add and subtract is zero and the other is positive, add one to the one that is zero and subtract one from the other. (A + B + C = 2, the variables to add and subtract are both 1, and when the character string of the next turn and the character string of the current turn are different, not the last turn, the character addition and subtraction of the next turn is performed. Add 1 to the variable you plan to do and subtract 1 from the other. {Otherwise, select appropriately

What wrong in my code for the problem D

x=int(input())
value=0
index=0
hashmap=dict()
while value<int(1e9)+1:
    value=pow(index,5)
    hashmap[value]=index
    index+=1
#print(hashmap)    

for i in range(1,64):
    b1=x+int(pow(i,5))
    b2=x+int(pow(-i,5))
    if hashmap.get(b1)!=None:
        print(hashmap[b1],i)
        break
    if hashmap.get(abs(b2))!=None:
        print(hashmap[abs(b2)],-i)
        break     

the language of D and E was so clear still couldn't solve it, got WA on last test case of E and TLE on D. I like atcoder's format easy language difficult task .makes these problems more approachable. Thanks Atcoder

Please help me with problem E and F

Yay I full solved all 6 problems with 0 incorrect attempts!

Timing was slow though :(

I thought the problem statement on B was not clearly defined. Otherwise, it was such a great contest! got WA on both D and E because I did not take long. Feel like killing myself :( Gonna upsolve F now.

I solved D by expressing A^5 — B^5 as (a − b)(a^4 + a^3*b + a^2*b^2 + a*b^3 + b^4).

At this point, I iterated over all possible divisors. Since a-b < (the term consisting of all positives), I only had to check the divisors less than sqrt(X). Then, once a-b was set, I binary searched to find the value of b (if any) to satisfy the expression.

My final runtime: optimized O(sqrt(X)*log(X))

In codeforces https://codeforces.com/contest/1345/problems we get list of all problems, how to do the same in atcoder, like all the task they appear in the same page. If anyone knows please comment the link of that page where all task appear on one page.

I overkilled F with dp, followed by 14-15 RTE's :(

PS: Atcoder could really work to differentiate between MLE and RTE.

Solution in simple words:

A. Just check the input string.

B. Compute the food each person has. One can use a frequency array to do this.

C. Iterate through all paths. Each path makes one observatory non-peak (or two, if they have same height).

D. Since $$$a^5 - b^5 = X > 0$$$, we have $$$a > b$$$, that is $$$b \leq a - 1$$$. So $$$a^5 - (a - 1)^5 \geq a^5 - b^5 = X$$$. Obviously $$$f(x) = x^5 - (x - 1)^5$$$ is increasing when $$$x > 1$$$ and decreasing when $$$x < 0$$$, so we can find the upper and lower bound of $$$a$$$ from $$$X$$$. Simply enumerate all possible $$$a$$$'s and check if $$$a^5 - X$$$ is the fifth power of some integer. This can be done with precomputing all fifth powers in the potential range. In practice we can use a looser bound to estimate the range of $$$a$$$.

E. Consider the number of pairs $$$(i, j)$$$ satisfying $$$i < j$$$ and $$$A_i + A_j = j - i$$$. Fix $$$j$$$, the number of $$$i$$$'s pairing with $$$j$$$ satisfying $$$A_i + i = j - A_j$$$. Just iterate from left to right and keep the frequencies of all $$$A_i + i$$$.

F. In each operation we can greedily take $$$1$$$ from the greater number and add $$$1$$$ to the smaller one. The only exception is there being two $$$1$$$'s and one $$$0$$$ and we are going to operate on the $$$1$$$'s. We have to create another $$$0$$$ in this operation, so we need to consider the next operation in order to make it doable. The answer is No if any operation creates a negative number.

My python solution12793022

I am getting WA for one test case (killer_05.txt). Can somebody please tell me what am I missing? Thank you.

https://atcoder.jp/contests/abc166/submissions/12803726 i am getting wrong ans on killer test 5 Can somebody help me out. It is for problem F atcoder 166

For D — detail explanation and reduced range of searching with code Here

For problem E, I found an interesting solution. Let's imagine there are n persons standing on n consecutive cells in a row, the question ask for how many pairs of them can reach each other if they lay down to the left or to the right, formally it 's number of pairs which have sum of their heights equal to their distance. So we just let each person lay down to the left and to the right and mark these points. Then we iterate all marked points and add $$$from\_left[point]*from\_right[point]$$$ to the answer, check my code