arc111_d

1 files changed, 2 insertions, 0 deletions

diff --git a/atcoder.md b/atcoder.md
index aad174e..de0aa96 100644
--- a/atcoder.md
+++ b/atcoder.md
@@ -201,3 +201,5 @@
 - arc105_e: Consider what the graph looks like at the end of the game, then look at parity to see who wins
 
 - arc108_f: First consider the diameter which is pretty obvious, then look at the case where it is colored two different colors; then you only have to consider distances to the two endpoints
+
+- arc111_d: First direct the edges that are easy to direct, basically c_u < c_v, so the edge must go from v to u; then the problem reduces down to creating strongly connected components, which you can do using a DFS tree