Snakeless path

input/code.cpp: In function 'int Ford_Fulkerson(int, int, int, std::vector<std::vector<int> >&)':
input/code.cpp:58:20: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   58 |     while (min_cap = bfs(source, target, n, parent, graph)) {
      |            ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'bool residual_dfs(std::vector<std::vector<int> >&, std::vector<int>&, int, int)':
input/code.cpp:100:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  100 |     for (int v = 0; v < graph.size(); v++) {
      |                     ~~^~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:142:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |             for (int j = 0; j < paths[0...

#include <climits>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>

using namespace std;

int bfs(int source, int target, int n, vector<int>& parent, vector<vector<int>>& graph) {
    // Update the parent vector as each node value to be -1
    fill(parent.begin(), parent.end(), -1);
    // parent of source node to be -2
    parent[source] = -2;
    // Initializing queue for storing and min capacity so far
    queue<pair<int, int>> q;
    // Source node min capacity to be 1e9
    q.push({source, 1e9});

    // Looping while queue is not empty
    while (!q.empty()) {
        // storing top node and min capacity so far
        int u = q.front().first;
        int cap = q.front().second;
        // Removing top node from queue
        q.pop();
        // Looping all edges from u
        for (int v = 0; v < n; v++) {
            // finding v node has edge from u
            if (u != v && graph[u][v] != 0 && parent[v] == -1) {
                // storing parent v to be u
                parent[v] = u;
                // Updating the minimum capacity
                int min_cap = min(cap, graph[u][v]);
                // If v is the target node then return minimum capacity
                if (v == target) {
                    return min_cap;
                }
                // if we didn't find target node
                // Insert the v node and minimum capacity so far in queue
                q.push({v, min_cap});
            }
        }
    }
    // if we didn't find path between source to target return 0
    return 0;
}
vector<vector<int>> paths;
int Ford_Fulkerson(int source, int target, int n, vector<vector<int>>& graph) {
    // Initializing parent vector for finding the path from source to target
    // In which we add parent of the node
    vector<int> parent(n, -1);
    // Initializing maximum flow for storing ans
    int max_flow = 0;
    int min_cap = 0;  // storing minimum capacity in each path

    // looping while minimum capacity become zero
    // For finding path and minimum capacity we call function bfs()
    while (min_cap = bfs(source, target, n, parent, graph)) {
        vector<int> path;
        int x = target;
        while (x != source) {
            // cout << '<' << x << endl;
            path.push_back(x);
            x = parent[x];
        }
        path.push_back(0);
        reverse(path.begin(), path.end());
        paths.push_back(path);

        // Adding the min_cap from this path
        max_flow += min_cap;
        // storing target node in v
        int v = target;

        // while we didn't find the source node
        // Looping through path stored in parent
        while (v != source) {
            // finding parent of v node
            int u = parent[v];
            // Subtracting minimum capacity from u to v
            // And adding minimum capacity from v to u
            graph[u][v] -= min_cap;
            graph[v][u] += min_cap;
            v = u;
        }
    }
    // Returning maximum flow in the graph
    return max_flow;
}

void addEdge(vector<vector<int>>& graph,
             int u, int v, int w) {
    graph[u][v] = w;
}

bool residual_dfs(vector<vector<int>>& graph, vector<int>& path, int u, int end) {
    path.push_back(u);
    if (u == end) return true;

    for (int v = 0; v < graph.size(); v++) {
        auto it = find(path.begin(), path.end(), v);

        if (graph[v][u] == 1 and it == path.end()) {
            graph[v][u] = 0;
            if (residual_dfs(graph, path, v, end)) return true;
        }
    }
    path.pop_back();
    return false;
}

int main() {
    int n, m;

    cin >> n >> m;
    vector<vector<int>> graph(n, vector<int>(n, 1));
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        addEdge(graph, a - 1, b - 1, 0);
    }

    int k = Ford_Fulkerson(0, n - 1, n, graph);


    /*
        for (int x = 0; x < k; x++)
        {
        vector<int> path;
        residual_dfs(graph, path, 0, n - 1);
        cout << path.size() << endl;
        for (int i = 0; i < path.size(); i++) {
            cout << path[i] + 1 << ' ';
        }
        cout << endl;
        }

    */

    if (k > 0) {
            cout <<  paths[0].size() << endl;
            for (int j = 0; j < paths[0].size(); j++) {
                cout << paths[0][j] + 1 << ' ';
            }
            cout << endl;
    }
    else cout << 0 << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED

Test 21

Verdict: WRONG ANSWER

Test 22

Verdict: WRONG ANSWER

Test 23

Verdict: ACCEPTED

Test 24

Verdict: ACCEPTED

Test 25

Verdict: ACCEPTED

Test 26

Verdict: ACCEPTED

Test 27

Verdict: ACCEPTED

Test 28

Verdict: WRONG ANSWER

Test 29

Verdict: ACCEPTED

Test 30

Verdict: ACCEPTED

Test 31

Verdict: WRONG ANSWER

Test 32

Verdict: WRONG ANSWER

Test 33

Verdict: ACCEPTED

Test 34

Verdict: ACCEPTED

Test 35

Verdict: ACCEPTED

Test 36

Verdict: ACCEPTED

Test 37

Verdict: ACCEPTED

Test 38

Verdict: ACCEPTED

Test 39

Verdict: ACCEPTED

Test 40

Verdict: ACCEPTED

Test 41

Verdict: WRONG ANSWER

Test 42

Verdict: WRONG ANSWER

Test 43

Verdict: ACCEPTED

Test 44

Verdict: ACCEPTED

Test 45

Verdict: ACCEPTED

Test 46

Verdict: ACCEPTED

Test 47

Verdict: ACCEPTED

Test 48

Verdict: ACCEPTED

Test 49

Verdict: ACCEPTED

Test 50

Verdict: ACCEPTED

Test 51

Verdict: WRONG ANSWER

Test 52

Verdict: WRONG ANSWER

Test 53

Verdict: ACCEPTED

Test 54

Verdict: ACCEPTED

Test 55

Verdict: ACCEPTED

Test 56

Verdict: ACCEPTED

Test 57

Verdict: ACCEPTED

Test 58

Verdict: ACCEPTED

Test 59

Verdict: ACCEPTED

Test 60

Verdict: ACCEPTED

Test 61

Verdict: ACCEPTED

Test 62

Verdict: ACCEPTED

Test 63

Verdict: ACCEPTED

Test 64

Verdict: WRONG ANSWER

Test 65

Verdict: ACCEPTED

Test 66

Verdict: ACCEPTED

Test 67

Verdict: ACCEPTED

Test 68

Verdict: ACCEPTED

Test 69

Verdict: ACCEPTED

Test 70

Verdict: RUNTIME ERROR

Test 71

Verdict: RUNTIME ERROR

Test 72

Verdict: RUNTIME ERROR

Test 73

Verdict: RUNTIME ERROR

Test 74

Verdict: RUNTIME ERROR

Test 75

Verdict: RUNTIME ERROR

Test 76

Verdict: RUNTIME ERROR

Test 77

Verdict: RUNTIME ERROR

Test 78

Verdict: RUNTIME ERROR

Test 79

Verdict: RUNTIME ERROR

Test 80

Verdict: RUNTIME ERROR

Test 81

Verdict: RUNTIME ERROR

Test 82

Verdict: RUNTIME ERROR

Test 83

Verdict: RUNTIME ERROR

Test 84

Verdict: RUNTIME ERROR

Test 85

Verdict: RUNTIME ERROR

Test 86

Verdict: RUNTIME ERROR

Test 87

Verdict: RUNTIME ERROR

Test 88

Verdict: RUNTIME ERROR

Test 89

Verdict: RUNTIME ERROR