Comments
+9

If anyone solved E using string hashing, drop the solution here
0

us
0

How to do G?
+5

One of the easier contest I've had in a while
0

why does a basic while(a[i-1]>a[i])a[i]*=2, count++ not work? Please give a tc where this fails. also what's the intended solution?
0

or you can make a custom comparator for right border multiset which will eliminate the need for binary search.
+11

E can be solved without segment tree. Its just xor prefix array
0

When will editorial drop?
0

can you explain your solution?
-7

ADHOCforces
0

Can anyone share a dp solution for D?
+2

Probably my best performance in a contest just for it to get unrated (╥_╥)
0

Bruh my B FST'ed
0

Yeah need to look those up. I could only come up to a O(n2) solution for C with prefix sums
+19

the idea for D came to me almost instantly, however I had no idea how to optimize C lol
+56

Did anyone else find D to be much easier than C?
0

Thanks, got it.
0

Hint for D?
0

cursed comment
0

Where can I find a list of such algorithms?

On __SAK__ → An interesting problem, 4 years ago
0

N <= 10^5
On __SAK__ → An interesting problem, 4 years ago
0

Auto comment: topic has been updated by __SAK__ (previous revision, new revision, compare).
On __SAK__ → An interesting problem, 4 years ago
0

It was in Algo University test and it ended a couple hours ago
0

neat graph
On 055D → Codeforces Round #821 (Div. 2), 4 years ago
0

hahaha
On 055D → Codeforces Round #821 (Div. 2), 4 years ago
0

can you explain your dp?
On 055D → Codeforces Round #821 (Div. 2), 4 years ago
+1

Can someone explain the recursive formula for D2?
+7

The contest got over for me in 8 minutes :")
0

Can anyone how to solve E using disjoint set union?
0

C made me feel so dumb with 10 wa
0

My C just got hacked
0

In problem F, how do I find cycle for an alphabet?
On huangzirui → Codeforces Round #796, 4 years ago
+3

I'm went below 1400 after this contest and it still shows that i'm specialist

0

Nooo Codeblocks forever...