Golf (#145)

* remove some parens

* [auto-verifier] verify commit 2bdc0a0

* more golf

* [auto-verifier] verify commit 9c932ef

---------

Co-authored-by: GitHub <noreply@github.com>

Author: lrvideckis

.verify-helper/timestamps.remote.json

@@ -71,7 +71,7 @@
 "tests/library_checker_aizu_tests/handmade_tests/dsu_size.test.cpp": "2024-12-14 19:50:29 -0600",
 "tests/library_checker_aizu_tests/handmade_tests/edge_cd_small_trees.test.cpp": "2025-04-27 21:47:37 -0600",
 "tests/library_checker_aizu_tests/handmade_tests/fib_matrix_expo.test.cpp": "2024-12-14 19:50:29 -0600",
-"tests/library_checker_aizu_tests/handmade_tests/functional_graph.test.cpp": "2025-05-31 11:16:27 -0600",
+"tests/library_checker_aizu_tests/handmade_tests/functional_graph.test.cpp": "2025-07-08 19:20:24 -0600",
 "tests/library_checker_aizu_tests/handmade_tests/lca_ladder_forest.test.cpp": "2025-02-10 23:30:47 -0700",
 "tests/library_checker_aizu_tests/handmade_tests/manacher.test.cpp": "2024-12-14 19:50:29 -0600",
 "tests/library_checker_aizu_tests/handmade_tests/merge_st_and_wavelet.test.cpp": "2025-02-11 13:53:30 -0700",

library/graphs/functional_graph_processor.hpp

@@ -16,29 +16,27 @@ struct func_graph {
   vector<basic_string<int>> cycle, childs;
   func_graph(const vi& a): root_of(sz(a)), childs(sz(a)) {
     vi state(sz(a));
-    rep(i, 0, sz(a)) {
-      if (state[i] == 0) {
-        int u = i;
-        while (state[u] == 0) {
-          state[u] = 1;
+    rep(i, 0, sz(a)) if (!state[i]) {
+      int u = i;
+      while (!state[u]) {
+        state[u] = 1;
+        u = a[u];
+      }
+      if (state[u] == 1) {
+        cycle.emplace_back();
+        while (state[u] == 1) {
+          root_of[u] = {sz(cycle) - 1, sz(cycle.back())};
+          cycle.back() += u;
+          state[u] = 2;
           u = a[u];
         }
-        if (state[u] == 1) {
-          cycle.emplace_back();
-          while (state[u] == 1) {
-            root_of[u] = {sz(cycle) - 1, sz(cycle.back())};
-            cycle.back() += u;
-            state[u] = 2;
-            u = a[u];
-          }
-        }
-        int v = i;
-        while (state[v] == 1) {
-          root_of[v] = root_of[u];
-          childs[a[v]] += v;
-          state[v] = 2;
-          v = a[v];
-        }
+      }
+      int v = i;
+      while (state[v] == 1) {
+        root_of[v] = root_of[u];
+        childs[a[v]] += v;
+        state[v] = 2;
+        v = a[v];
       }
     }
   }