ssum_way's blog

By ssum_way, history, 11 days ago, In English,

Hello all,

I wanted to improve my dp skill to next level and I see many problems have log N optimization that I cannot think of. Does anyone maybe have a list with such problems of DP, but with some log N optimization, for example N^2 -> NlogN or N^3 -> N^2logN. Any problems would help, preferably from Codeforces Div 2 C-E level.

Thank you!

Read more »

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

By ssum_way, history, 13 days ago, In English,

Hello,

I am just asking if for some hard problems you take the time to create a program which can output the correct solution for any small input, though it will TLE if you submit it. Maybe it takes long to code, but it will help you in the long run?

Read more »

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

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

Is timus down for anyone else? I've been checking for the past week or so but it's always been down. Specifically my link is http://acm.timus.ru

Read more »

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

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

Hi all,

I've been trying to solve the classical problem of finding the perimeter of the union of a set of rectangles. Each rectangle has coordinates in [-10000, 10000] and there are N ( N <= 5000) rectangles. I've looked up solutions online, but I've had trouble finding a solid implementation, and my past ideas have all failed. I know I want to use some kind of N^2 sweep line, but I can't figure out what to do at each event. Can someone help guide me through this problem?

Read more »

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