hell_hacker's blog

By hell_hacker, history, 10 days ago, In English,

I had a vector of pairs. I wanted it sorted in descending according to the first value of the vector.

sort(a.begin(),a.end(),[](pair<int,int> &left, pair<int,int> &right){
         return left.first >= right.first;
});

This gave me TLE. Sorting it normally

sort(a.begin(),a.end());

and iterating from the end worked.

Why does the first sorting function give TLE? Do I have to implement it some other way?

Read more »

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

By hell_hacker, history, 3 months ago, In English,

Here is the problem

Here is my solution

I tried to solve it using treaps.

I keep on getting WA. In another attempt I tried to store values in map for checking duplicates(i won't insert when duplicates) but I got TLE. Can anyone help me in finding out the bug. Thanks.

Read more »

 
 
 
 

By hell_hacker, history, 13 months ago, In English,

I read that there are many great problems on POI. But the website is not loading. POI.Where can I find these problems ?

Thank You.

Read more »

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

By hell_hacker, history, 13 months ago, In English,

My approach for ChessMetric is to find all the positions reachable from position start, then put them in a queue of tuples where first and second elements are the co-ordinates and the third is number of moves. But it is giving Memory limit exceeded. Any idea how to make this efficient? I used unsigned short int for co-ordinates and number of moves.

Thank You.

Read more »

Tags dp
 
 
 
 

By hell_hacker, history, 16 months ago, In English,

In this question http://codeforces.com/contest/330/problem/B I want to ask why the star graph would give minimum number of paths. Thank You.

Read more »