Juniorandrade's blog

By Juniorandrade, history, 5 years ago, In English

Hi Codeforces!

I have finished my bachelor's degree in computer science a few months, and I intend to keep studying in a master's degree. I really like problems with data structures, and I would like research this topic or something like that.

So, What kind of new data structure do you think that need to be create for the future? What kind of problem would this structure solve?

Read more »

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

By Juniorandrade, history, 6 years ago, In English

Hi codeforces,

Today, i received a email from "codeforces@codeforcess.com" to registrate in contest. Obviously, it is a spam try to steal my username and password.

Someone received that?

Look this url!

Read more »

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

By Juniorandrade, history, 6 years ago, In English

Hi codeforces.... How I can delete the Gym contest that I have created? I can't find this function... :(

Read more »

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

By Juniorandrade, history, 7 years ago, In English

Hi Codeforces!

I'm trying solve this problem http://www.spoj.com/problems/ZQUERY/ . My code has complexity O( n * sqrt(n) * log(n) ) using Mo's algorithm and Segment tree. But, i get TLE. My code use std::deque to find the solution of each interval.

This data structure is slow in this case? Is there any way to remove log(n)?

Thanks for advance!

My code in cpp: http://ideone.com/pHvCEH

Read more »

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

By Juniorandrade, history, 7 years ago, In English

Hi Codeforces!

Well, i've come across this problem, but i don't have idea how to solve this...

Link for the problem = https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=4240

I tried makes a binary search on generated line between every pair of points, but this not work.

Could someone help me out?

Thanks in advance!

Read more »

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