Good!

For problem Div2 E, 99886275 is just so cool.

Thank You.

Nice Problemset — problems were to the point and good.

I really liked it.

I used dictionary tree to passed the div2 D, I can guarantee its correctness, but I can't guarantee its time complexity,can anyone hack my solutions? https://mirror.codeforces.com/contest/1457/submission/99900717

In Div2D, why is n<=60 if the given condition is true?

Me when doing normal rounds: So I will try to do problems in order, if I can't do A in 30 minutes then I will consider B...

Me when doing russian rounds:

For Problem B, n is <=10^5, test cases are <=10^4 and no. of colours are <=100. How is 10^11 (that's what I can interpret) solution works??

If some one has any explanation and would like to correct where I am wrong, it will be great :)

I did not see that B had only 100 colors :/

I am still confused in Div 2D.

plzz anyone can explain div2 D. why n<=60

Thanks for detailed explanation of Div2E!

For Div 2 Problem A, this is my code

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
 
	ll t;
	cin >> t;
 
	while(t--) {
		ll n, m, r, c;
		cin >> n >> m >> r >> c;
		ll v1 = abs((r + c) - 2);
		ll v2 = abs((r + c) - (1 + n));
		ll v3 = abs((r + c) - (1 + m));
		ll v4 = abs((r + c) - (m + n));
		cout << max(max(v1, v2), max(v3, v4)) << '\n';
		
	}
 
	return 0;
 
}

I have calculated the Manhattan Distance of the cell (r, c) from each of the corner cells, and printed the max distance. My code is giving wrong answer on test 2. Can anyone tell what's wrong in my code?

for D, I brute forced subarrays of size <= 31, then brute forced again on the "split point". for example, if i have a subarray i...j and a split point of k, we xor the range from i...k and k+1..j. then, we check if the sequence we made decreases at any point. why does this work? I used the claim that there does not exist a construction where we have to make > 29 moves.

https://mirror.codeforces.com/contest/1457/submission/99871104

Nobody found the $$$O(N)$$$ for div1D?

Can anybody explain the prefix suffix method used in division 2 in D-problem?

Is it only me or Div1 E editorial is cryptic.

"Let call low bits that we don't need to care free bits." — can you maybe give an example.

What is A there?

in div2C,why the answer of 2 2 1 10 11 1 is 11,if i make the 0 to 1,it just take 1 second

KAN For div2 D, the editorial states the following:

Indeed, there are no two integers with the same highest bit set. It is much easier to solve the problem in such constraints.

I think it should be stated as: there are at most two integers with the same highest bit set. Right? Because for input [1, 6, 7], the highest set bit of all numbers are different but 6 and 7 have the same highest set bit.

How is the space complexity for div2B O(N) ?

It is good tutorial.

Kindly do mention the code also. Sometime explanation is not sufficient

Could someone please explain the dp approach to div2 C?

It seems that the standard program to the Div.1 D has something wrong
https://codeforces.ml/contest/1456/hacks

What would be the difficulty level of XOR gun?

Nice trick in problem Div2D =)

Sorry for my stupid, it's a little hard for me to understand Div1E solution, can someone explain it easily? thanks!

1415B - Repainting Street

Can somebody explain why test case 3 in test 2 (below) says right answer is 2 days? If we choose any color (e.g. 1), there are only 6 houses, which are not this color. So, with capacity k=6 one day should be enough to paint. Looks I am missing something, but don't get what.

9 6
1 2 3 1 2 3 1 2 3

Hey guys, here is my video proof for "Genius Greedy" in Problem E using induction hypothesis. Anyone who is interested can take a look