Try to solve problem D if we consider subsequence instead of substring! It is an interesting problem.

On OkrutGood Bye 2020, 3 years ago

yeah thank you ! I just realised that

On OkrutGood Bye 2020, 3 years ago

Can we say goodbye for "good bye 2020"?

On OkrutGood Bye 2020, 3 years ago

why the time limit for the problem E is so tight?? My solution O(n*60) gives me TLE but the solution O(n*MaxLog(Xi)) gives accepted. I don't know but i think you should increase the time limit a little bit:(

I solved it like this and it worked

Thanks, first i think like that but i consider that we will have inclusion exclusion principle

how to solve I,i try a O(n(logn)^2) approach but it fail

In D , the lenght of S should be <=10^4 it will be more fair

Can you make the round unrated for only people affected?

yes we can prove that it is optimaly to use powers of 2 as a base to generate 1 to x, consider you have n buckets of number(1,2,4,..2^(n-1)) those numbers can generate 2^n ****different numbers**** and all this numbers are between 0 and 2^n-1 so if we get the binary representation of x and let d is the highest significant bit so let x=1000010101 if we want to generate all number less than x and the highest significant bit is less than d we want n-1 number and these number generate 2^(n-1) different numbers and finaly to get x we only need one another number wish is 2^d and like this you get all number between 0 and x with least size of bucket

On KostromaAIM Tech Round 5 Editorial, 6 years ago

can we solve G without dp?can we say that dp(l,q)=((l+1)^q-l)

ohhh you did not participate why you still wating>?