Dominater069's blog

By Dominater069, history, 5 weeks ago, In English

We invite you to participate in CodeChef’s Starters 234, this Wednesday, 15th April, rated for all users.

Time: 8:00 PM — 10:00 PM IST

Joining us on the problem setting panel are:

Written editorials will be available for all on discuss.codechef.com. Pro users can find the editorials directly on the problem pages after the contest. The video editorials of the problems will be available only to Pro users.

Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, you can share them here. Hope to see you participating.

Good Luck!

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

»
5 weeks ago, hide # |
 
Vote: I like it -11 Vote: I do not like it

YaY>

»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Contest starts in 30 minutes.

»
5 weeks ago, hide # |
 
Vote: I like it +6 Vote: I do not like it

Seems Div.1 scoreboard is very WOW.

»
5 weeks ago, hide # |
 
Vote: I like it +4 Vote: I do not like it

What point is the problem Line Mixing trying to prove and test on? Is it, do I know how to read and comprehend mathematical notations? or Drago's obsession with Line graphs?

  • »
    »
    5 weeks ago, hide # ^ |
     
    Vote: I like it +3 Vote: I do not like it

    The point was to analyze the structure of $$$L^3(G)$$$, i don't think that it is very easy even if you understand line graphs.

    It became the 3rd easiest problem by solves because of cheaters, but I think it's 2nd or 3rd most hardest, so maybe you got misled

  • »
    »
    4 weeks ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    The problem is mostly intended to test structural graph analysis. Since line graphs grow very fast, you can't explicitly contruct it and need to analyse the structure in order to be led to the efficient algorithm, similar to the problem 2120G - Eulerian Line Graph.

    I do have an obsession with Line Graphs, it is because it has the most structural analysis I've seen and the function itself is quite amazing with the connectivity it keeps even while the graph is growing.

»
5 weeks ago, hide # |
 
Vote: I like it +11 Vote: I do not like it

Burglar Movements is such a beautiful problem!

»
4 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I m a Huge Mouse!