Rating changes for the last round are temporarily rolled back. They will be returned soon. ×

YouKn0wWho's blog

By YouKn0wWho, 11 months ago, In English

A. Perfect Points

Author: YouKn0wWho

Tutorial
Solution

B. String is not that Easy

Author: YouKn0wWho

Tutorial
Solution

C. XOR Partition

Author: YouKn0wWho

Tutorial
Solution

D. Permutations and Divisors

Author: YouKn0wWho

Tutorial
Solution

E. Playing On A Directed Graph

Author: YouKn0wWho

Tutorial
Solution

F. Ant-Man And The Polygon

Author: YouKn0wWho

Tutorial
Solution

G. Enormous Product

Author: YouKn0wWho

Tutorial
Solution

H. Subset AND

Author: YouKn0wWho

Tutorial
Solution

I. Distinct Permutations

Author: foyaz05

Tutorial
Solution

J. The Selection

Author: YouKn0wWho

Tutorial
Solution

K. Mr Makor And His Friends

Author: ovis96

Tutorial
Solution

L. Expected Oddness

Author: mk_shahriar

Tutorial
Solution
 
 
 
 
  • Vote: I like it
  • +36
  • Vote: I do not like it

»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

When and how to submit for practice on toph? Is there a special procedure or we can do it after contest?

  • »
    »
    11 months ago, # ^ |
    Rev. 2   Vote: I like it +3 Vote: I do not like it

    $$$-$$$ Is there a special procedure?

    $$$-$$$ No

    Problems are open now. GL & HF!

    • »
      »
      »
      11 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Okay thanks.

      Is it configurable ( and hence only admins/ problem setters can allow submissions after contest )?

      I ask, because I am unable to submit for another contest that I gave previously. I am new to toph.

»
11 months ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

In problem E's editorial for the Bellman-Ford solution, I don't think it is correct to say that we find shortest distance from 1 as it may happen that there doesn't exist a path from 1 to some vertex. It is more like we initialize the distance of all vertices (instead of just only the source to 0) and then run an algorithm similar to Bellman-Ford.

UPD: Here's my code: https://ideone.com/Z5ylfX

  • »
    »
    11 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Uh! My bad! Sorry. The editorial is updated. Thanks!

    • »
      »
      »
      11 months ago, # ^ |
        Vote: I like it +5 Vote: I do not like it

      Its kinda still wrong, as you take the shortest path from the vertex to itself in case there's no other incoming edge into it. I think its more like $$$P_i$$$ = the shortest path to the vertex i from any vertex (including itself). In this case, the final value of any vertex comes out to be <= 0.

      Anyways, I find it a little strange that even after solving a problem I'm not allowed to click the view editorial button on the problem page on TOPH as it says my achievements won't be considered in case I unlock it.

»
11 months ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

In problem A ,

2nd line .... y % (c+1) = c : c>=1 3rd line .... y % c = c-1 : c>=2

How can u say such ? What is the logic behind it ?

For example let y=11, c=5. So, 11 % 6 = 5, that doesn't mean that 11%5 =4 .