CIRMERGE - Editorial

editorial
, , ,
75

well I used modulo as well :stuck_out_tongue:

1 Like
76

simply because he declared it globally

77

You have a nice knowledge of algos. Good !

2 Likes
78

she herself said she was an icpc silver medalist bro.

1 Like
79

Thanks great. I will learn more and more when people like her be active on discuss.

2 Likes
80

Konsa waala silver? Regionals yaa world finals? Apne yahaa India mai kuch gold/silver nhi milta for regionalsšŸ˜…

81

Why donā€™t you go there (where loopfree is) XD?

2 Likes
82

you should learn balloon popping problem. This question is very similar to that problem. Here is the link : - LeetCode

83

why modulus is so time consuming

84

I used the greedy approach that you stated will pass the Subtask #2 (with distinct powers of 2).
Can you tell me why this greedy approach gave WA for other Subtasks? For which test case my greedy approach will give WA?

Thanks in advance.

85

I know it only because of experience btw you can refer here - https://stackoverflow.com/questions/27977834/why-is-modulus-operator-slow

1 Like
86

Bade hi experienced ho aap toh :stuck_out_tongue:

2 Likes
87

Bs apse kuch 5-10%. Dot dot dot

1 Like
88

might be because of integer overflow, try having long dp[][]

1 Like
89

Where can we find material to read about Garsia Wachs algortihms?

90

What does ā€œLinear Caseā€ mean??

91

it means just a normal array, i.e. not taking the first and last elements to be adjacent here.

92

That was really a great problem . Learned many things .

93

Try making an algorithm to find division and modulus using bitwise operations.
You will realize why.

94

Solve similar problems like mixture(spoj),matrix chain multiplication