From 05485b478c5a334d934e9b62b174748aa34ebbe1 Mon Sep 17 00:00:00 2001
From: hitonanode <32937551+hitonanode@users.noreply.github.com>
Date: Thu, 11 Sep 2025 21:55:30 +0900
Subject: [PATCH] add comment to SegmentEdgeShortestPath

---
 graph/segment_edge_shortest_path.hpp | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/graph/segment_edge_shortest_path.hpp b/graph/segment_edge_shortest_path.hpp
index 401a016f..c144fadb 100644
--- a/graph/segment_edge_shortest_path.hpp
+++ b/graph/segment_edge_shortest_path.hpp
@@ -7,9 +7,13 @@
 #include <utility>
 #include <vector>
 
-// CUT begin
 // 区間に辺を張って最短距離問題を解く
-// Verify: Codeforces Round #406 (Div. 1), problem: (B) Legacy <https://codeforces.com/contest/786/submission/93412867>
+// Verify: Codeforces Round #406 (Div. 1), problem: (B) Legacy
+// https://codeforces.com/contest/786/submission/93412867
+// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=3506
+// https://atcoder.jp/contests/abc414/tasks/abc414_g
+// https://atcoder.jp/contests/nadafes2022_day1/tasks/nadafes2022_day1_i
+// https://atcoder.jp/contests/nikkei2019-2-qual/tasks/nikkei2019_2_qual_d
 template <typename T = long long> struct SegmentEdgeShortestPath {
     int V;
     int h;