add: functional-graph test

test/atcoder-abc228-b.test.cpp

@@ -0,0 +1,13 @@
+#define PROBLEM "https://atcoder.jp/contests/abc228/tasks/abc228_b"
+
+#include <iostream>
+
+#include "../cpp/functional-graph.hpp"
+
+int main(void) {
+    int N, X;
+    std::cin >> N >> X;
+    FunctionalGraph fg(N);
+    fg.read();
+    std::cout << fg.hopable(X - 1) << std::endl;
+}

test/atcoder-abc256-d.test.cpp

@@ -0,0 +1,22 @@
+#define PROBLEM "https://atcoder.jp/contests/abc256/tasks/abc256_d"
+
+#include <iostream>
+
+#include "../cpp/functional-graph.hpp"
+
+int main(void) {
+    int N;
+    std::cin >> N;
+    FunctionalGraph fg(N);
+    fg.read();
+    std::vector<int> C(N);
+    for (int& c : C) std::cin >> c;
+    long long ans = 0;
+    for (const auto& cycle : fg.cycle_list) {
+        int tmp = 1 << 30;
+        for (int u : cycle)
+            if (C[u] < tmp) tmp = C[u];
+        ans += tmp;
+    }
+    std::cout << ans << std::endl;
+}

test/atcoder-abc367-e.test.cpp

@@ -0,0 +1,23 @@
+#define PROBLEM "https://atcoder.jp/contests/abc367/tasks/abc367_e"
+
+#include <iostream>
+
+#include "../cpp/functional-graph.hpp"
+
+int main(void) {
+    int N;
+    long long K;
+    std::cin >> N >> K;
+    FunctionalGraph fg(N);
+    fg.read();
+    std::vector<int> A(N);
+    for (int& a : A) std::cin >> a;
+    for (int i = 0; i < N; i++) {
+        std::cout << A[fg.hop(i, K)];
+        if (i == N - 1) {
+            std::cout << std::endl;
+        } else {
+            std::cout << ' ';
+        }
+    }
+}