Distinct Routes

input/code.cpp: In function 'int main()':
input/code.cpp:67:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |             for (int i = 0; i < path.size()-1; i++) {
      |                             ~~^~~~~~~~~~~~~~~
input/code.cpp:92:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |         for (int i = 0; i < path.size() - 1; i++) {
      |                         ~~^~~~~~~~~~~~~~~~~
input/code.cpp:101:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |         for (int i = 0; i < u.size(); i++) {
      |                         ~~^~~~~~~~~~

#include <bits/stdc++.h>
 
using namespace std;
#define ll long long
 
void one_dfs(int current, int end, vector<bool>& visited, vector<map<int, bool>>& g, vector<int>& path, bool& completed) {
 
    // cout << current << " " << end << endl;
 
    if (current == end) {
        completed = true;
        path.push_back(current);
        return;
    }
 
    if (visited[current]) return;
    visited[current] = true;
 
    path.push_back(current);
    for (auto &[v, possible] : g[current]) {
        if (!possible) continue;
        one_dfs(v, end, visited, g, path, completed);
        if (completed) return;
    }
    path.pop_back();
 
}
 
int main() {
 
    int n, m;
    cin >> n >> m;
    
    vector<map<int, bool>> g(n);
    vector<pair<int, int>> edges;
    for (int i = 0; i < m; i++) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        g[u][v] = true;
        edges.push_back({u, v});
    }

 
    bool completed;
    vector<bool> visited(n);
    vector<int> path;
 
    vector<vector<int>> valids;
    int k =0;

    while (true) {
 
        path.erase(path.begin(), path.end());
        for (int i = 0; i < n; i++) visited[i] = false;
        completed = false;
 
        one_dfs(0, n-1, visited, g, path, completed);
 
 
        // cout << path.size() << endl;
 
        if (completed) {
            valids.push_back(vector<int>());
            k++;
            for (int i = 0; i < path.size()-1; i++) {
                g[path[i]][path[i+1]] = false;
                g[path[i + 1]][path[i]] = true;
                valids[valids.size()-1].push_back(path[i]);
            }
            valids[valids.size()-1].push_back(path[path.size() - 1]);
        } else {
            break;
        }
    }
 
    vector<map<int, bool>> g_final(n);
    for (auto &[u, v] : edges) {
        if (!g[u][v]) {
            g_final[u][v] = true;
        }
    }

    for (int j = 0; j < k; j++) {
        path.erase(path.begin(), path.end());
        for (int i = 0; i < n; i++) visited[i] = false;
        completed = false;

        one_dfs(0, n - 1, visited, g_final, path, completed);

        for (int i = 0; i < path.size() - 1; i++) {
            g_final[path[i]][path[i + 1]] = false;
        }
        valids.push_back(path);
    }

    cout << valids.size() << endl;
    for (auto &u : valids) {
        cout << u.size() << endl;
        for (int i = 0; i < u.size(); i++) {
            if (i > 0) cout << " ";
            cout << u[i]+1;
        }
        cout << endl;
    }
 
 
 
}

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: WRONG ANSWER

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: WRONG ANSWER

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: WRONG ANSWER

Test 14

Verdict: WRONG ANSWER

Test 15

Verdict: WRONG ANSWER