mredigonda's blog

By mredigonda, history, 14 months ago, In English,

EDIT: Never mind, I found it. Yet the number on the problemset page (250) does not match the number of the contest (247).

Hello,

Currently it's not possible to submit solutions to problems of this contest, although we can see the statements. These problems do not appear in the problemset page neither.

Is this supposed to happen? :(

Read more »

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

By mredigonda, history, 3 years ago, In English,

There is a publication in this facebook page:

"Hello! We have some bad news. :( Visa-free regime will not be introduced. Sincerely apologize. It is not the fault of the Organizing Committee. On Monday we will publish the procedure for obtaining a visa. We ask you in the registration system to indicate the full address of the Consulate or visa centre where you intend to obtain a visa."

I think it's the official facebook page, since when I click on the facebook icon in this website it redirects me to that facebook page.

But there's no publication already about how to obtain the visa. I post this because I think that not everyone is aware of this, and I think it's very important.

Read more »

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

By mredigonda, history, 3 years ago, In English,

Hello Codeforces Community!

Some of you may remember that last year there was an online mirror of Lithuanian Olympiads in Informatics, from March 20th (practice session) to March 22th.

I really liked this contest, and I'd like to know if it is also going to be held this year, so if any of you know something about this, please tell me :) Thanks!

Read more »

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

By mredigonda, 4 years ago, In English,

Hello, i'm an OI contestant and recently I found a lot of problems like this one:

You have a n by n matrix, each cell is either 0 or 1. Find the maximum subsquare in which all the cells are 1.

This is the classic problem, but there are a lot of variants: find the maximum rectangle, find the maximum area of two consecutive subsquares, etc.

I know a solution in O(n^3) and I know there is a solution in O(n^2) but I can't understand it, can you please explain me how it works? or give me some resource to read about it?

Also I have a particular interest in "find the maximum area of two consecutive subsquares".

It'd be great if you can help me, thanks!

Read more »

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