hahavodox's blog

By hahavodox, history, 6 months ago, In English,

I just learned PL/SQL last week and I've already become a pro at it. Now I want to solve Codeforces problems with this language. But it came to me as a shock that it is not listed in the language list. Now I'm frustrated AF.

Here was the code I submitted recently and got compilation error just because the language wasn't listed. Make it work MikeMirzayanov CODE

Read more »

 
 
 
 
  • Vote: I like it
  • -22
  • Vote: I do not like it

By hahavodox, history, 7 months ago, In English,

I have noticed it a lot. Whenever my life is going dull, there is no CodeForces round. But when there is some business for example sessional, exam, tour etc, there will be a CF round almost all the time. I find it utterly frustrating.

Today there is BBQ Night of our departmental batch. Unfortunately around 10-15 coders can't participate in today's round because of this. I demand the Educational Codeforces Round 56 to be delayed for at least 2 hours. Or better if held another day.

Tote life.

Read more »

 
 
 
 
  • Vote: I like it
  • +10
  • Vote: I do not like it

By hahavodox, history, 21 month(s) ago, In English,

Recently I came across a technique similar to Policy based DS, a Policy Based Persistent BIT. To basic idea is to keep the BIT balanced by HLD. Naive algo is O(n^2). But you have to optimize using bitset to make it O(nlog n). You can perform dynamic range update range query and orthogonal range minimum IDA* search easily in O(Nlog N).

Example:http://codeforces.com/contest/869/problem/E

This can be solved with this trick easily combining this with Baby Step Giant Sweep line along with persistent KSAT.

Read more »

 
 
 
 
  • Vote: I like it
  • -22
  • Vote: I do not like it