IX Zhautykov Olympiad : [Problem D] Special Graph

Правка en2, от Azret, 2015-12-23 11:28:37


Given directed unweighted graph. It consist of N ≤ 105 vertices. There is at most one edge from each vertex. You need to answer for two types of queries (Q ≤ 105):

  1. Delete an edge from vertex V. Unexisting edge won't be deleted.
  2. Find shortest path from U to V.

No ideas. How to solve it?

Теги hard, special, izho, gold


  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Azret 2015-12-23 11:28:37 6
en1 Английский Azret 2015-12-23 11:28:21 381 Initial revision (published)