Aziza's blog

By Aziza, 11 years ago, In English

Can you suggest me a solution for the problem sgu 369?

Vasya loves his new game which is played on an infinite rectangular grid where K cells are initially black, all other cells are white. The move of the game is to find three black cells which are vertices of some rectangle with sides parallel to coordinate axis such that the fourth vertex of the rectangle is white. In this case you need to paint the fourth vertex black. Vasya asks you to write a program which calculates the number of black cells in the end of the game, i.e. when no more moves can be made.
(0 ≤ K≤ 2· 10^5) and -10^9 ≤ Xi, Yi ≤ 10^9

Full text and comments »

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

By Aziza, 11 years ago, In English

We need to delete minimum number of vertices from directed graph, so that after this operation , there is no cycle in the graph ?

Full text and comments »

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

By Aziza, 13 years ago, translation, In English
how to solve this problem ? I have no idea !!!!!!!
thanks !
http://www.e-olimp.com/en/problems/1174

Full text and comments »

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