iLoveIOI's blog

By iLoveIOI, history, 3 months ago, In English

I couldn't find a discussion blog for this contest so here's one.

Does anyone know how to solve Ex?

Read more »

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

By iLoveIOI, history, 23 months ago, In English

How do you count the number of balanced binary search trees with N nodes? Balanced as in the left subtree size and the right subtree size differ by at most 1.

Thanks!

Read more »

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

By iLoveIOI, history, 2 years ago, In English

Round 649(Div 2) was rated for Yuki726 even though his rating was already above 2100? MikeMirzayanov is this some bug in the rating system?

Read more »

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

By iLoveIOI, history, 2 years ago, In English

How do I solve the interval scheduling problem but instead with k machines, meaning I can put the intervals in K different sets such that in each of the sets none of the intervals overlap and I want the maximum total interval, in O(nlogn) time or less.

Thanks!

Read more »

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

By iLoveIOI, history, 2 years ago, In English

Given a tree with n<=2e5 nodes how do you find the nodes that are on the diameter of the tree?

Thanks!

Read more »

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

By iLoveIOI, history, 2 years ago, In English

Given n<=1000000 and k<=n*(n-1)/2 construct a sequence of length n that has exactly k inversions. How do I solve this? Thanks!

Read more »

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

By iLoveIOI, history, 3 years ago, In English

Is there a discussion page? If not here is one.

Read more »

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

By iLoveIOI, history, 3 years ago, In English

Given a weighted undirected graph, you have multiple queries asking for the minimum possible maximum edge between two points. How do you solve this?

N<=100000 Q<=100000

Read more »

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

By iLoveIOI, history, 3 years ago, In English

Can someone provide an unofficial editorial for the Digit Sequence Problems? THANKS

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By iLoveIOI, history, 4 years ago, In English

Can someone please recommend a way to debug a code that passes the sample test cases but fails the main tests. Thanks

Read more »

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

By iLoveIOI, history, 5 years ago, In English

What will happen if you get hacked while your problem is locked, will is still be locked? I mean that is someone else hacks you will you get to change your solution?

Read more »

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