What happened to a2oj, does anyone know ? It looks like the servers are down as of 2:33pm UTC
Also the answer is incorrect for test case 15. Can someone help. You can find the input/output date HERE
Looking for a solution to task C of the recent atcoder grand contest since the editorial given is only in Japanese. I tried converting it to english but it's a very bad conversion.
I cannot understand how you can verify in O(N) if its possible to satisfy the given condition by using at max X distinct characters. (the check(X) function used in Binary search)
Given a set of integers. Divide this set into two sets s1 and s2 such that union(s1,s2) = the initial set and intersection(s1,s2) = empty set. Also the difference between any two pairs in s1 should be >= x and in s2 it has to be >=y . Count the number of ways to divide % 1e9+7.
N = [1,1e5]
values = [1,1e18]
Example: [0,2,4,7,8,11,15] x = 5 and y = 3
if anyone has a link to this similar problem or the solution pls tell. Thanks in advance :)