func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 1e6 + 7;   pair<int, int> edges[N];   int type[N];   bool inv[N];   vector<int> e[N];   int vis[N];   int used[N];   inline int other(int id, int u) {     return edges[id].first == u ? edges[id].second : edges[id].first;   }   int ans1 = 0, ans2 = 0;   void dfs(int u) {     vis[u] = 1;     ans1++;     for (int ed : e[u]) {       int v = other(ed, u);       if (!vis[v]) {         used[ed] = v;         dfs(v);       }     }   }   void dfs2(int u) {     vis[u] = 1;     ans2++;     for (int ed : e[u]) {       int v = other(ed, u);       if (!vis[v]) {         if (type[ed] == 1) {           dfs2(v);         } else {           used[ed] = v;         }       }     }   }   int main() {     ios::sync_with_stdio(0);     cin.tie(0);     int n, m, s;     cin >> n >> m >> s;     for (int i = 0; i < m; ++i) {       int t, u, v;       cin >> t >> u >> v;       type[i] = t;       edges[i] = pair<int, int>(u, v);       if (t == 1)         e[u].push_back(i);       else {         e[u].push_back(i);         e[v].push_back(i);       }     }     dfs(s);     cout << ans1 << endl;     for (int i = 0; i < m; ++i) {       if (type[i] == 2) {         if (used[i] == other(i, edges[i].first))           cout <<  + ;         else           cout <<  - ;       }     }     cout << endl;     memset(vis, 0, sizeof vis);     memset(used, 0, sizeof used);     dfs2(s);     cout << ans2 << endl;     for (int i = 0; i < m; ++i) {       if (type[i] == 2) {         if (used[i] == other(i, edges[i].first))           cout <<  - ;         else           cout <<  + ;       }     }     cout << endl;   }   