Distinct Routes

input/code.cpp: In function 'll bfs(ll, ll, std::vector<long long int>&)':
input/code.cpp:99:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     for (ll i = 0; i < p.size(); i++) p[i]=-1;
      |                    ~~^~~~~~~~~~
input/code.cpp: In function 'll solve()':
input/code.cpp:134:18: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
  134 |     while(nw_flow=bfs(1, n, p)) {
      |           ~~~~~~~^~~~~~~~~~~~~
input/code.cpp:151:22: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  151 |     for (ll i = 0; i < res.size(); i++) {
      |                    ~~^~~~~~~~~~~~
input/code.cpp:153:26: warning: comparison of integer expressions of different signedn...

#ifdef ONPC
    #define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>

#define char unsigned char
#define rep(i, a, b) for(int i=a; i< (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back

#define LSOne(S) ((S) & -(S))

using namespace std;
// mt19937 rnd(239);
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());

template <typename T> int sgn(T x) { return (T(0) < x) - (x < T(0)); }
typedef long double T;
typedef complex<T> pt;
#define X real()
#define Y imag()

template<class T>
istream& operator>> (istream& is, complex<T>& p) {
    T value;
    is >> value;
    p.real(value);
    is >> value;
    p.imag(value);
    return is;
}

typedef long long ll;
typedef long double ld;

using pi = pair<ll, ll>;
using vi = vector<ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }

#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef DEBUG
#define dbg(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << endl;
#else
#define dbg(x...)
#endif

template<typename S, typename T = S> void chmin(S &s, T t) {s = s < t ? s : t;}
template<typename S, typename T = S> void chmax(S &s, T t) {s = s > t ? s : t;}

const int INF = 1e9; // 10^9 = 1B is < 2^31-1
const ll LLINF = 4e18; // 4*10^18 is < 2^63-1
const double EPS = 1e-9;
const ll MOD = 1e9+7;

const ll N=1010;
ll cap[N][N];
vector<ll> adj[N];
 
ll n, m;
 
ll bfs(ll s, ll t, vector<ll> &p) {
    for (ll i = 0; i < p.size(); i++) p[i]=-1;
    p[s]=-2;
    queue<pair<ll,ll>> q;
    q.push({s, INF});
    
    while(!q.empty()) {
        ll curr=q.front().fi;
        ll flow=q.front().se;
        q.pop();
        
        for(auto &w:adj[curr]) {
            if(p[w]==-1 && cap[curr][w]) {
                p[w]=curr;
                ll nw_flow=min(flow, cap[curr][w]);
                if(w==t) return nw_flow;
                q.push({w, nw_flow});
            }
        }
    }
 
    return 0;
}

ll solve() {
    ll n, m; std::cin >> n >> m;
    for (ll i = 0; i < m; i++) {
        ll a,b; std::cin >> a >> b;
        adj[a].pb(b);
        adj[b].pb(a);
        cap[a][b]=1;
    }

    vector<vector<ll>> res;
    vector<ll> p(n+1);    
    ll flow=0, nw_flow;
    while(nw_flow=bfs(1, n, p)) {
        flow+=nw_flow;
        ll curr=n;
        vector<ll> newPath={curr};
        while(curr!=1) {
            ll prev=p[curr];
            cap[prev][curr]-=nw_flow;
            cap[curr][prev]+=nw_flow;
            curr=prev;
            newPath.pb(curr);
        }
        assert(nw_flow==1);
        reverse(all(newPath));
        res.pb(newPath);
    }
 
    std::cout << res.size() << std::endl;
    for (ll i = 0; i < res.size(); i++) {
        std::cout << res[i].size() << std::endl;
        for (ll j = 0; j < res[i].size(); j++) {
            std::cout << res[i][j] << " ";
        }
        std::cout  << std::endl;
    }
 

    return 0;
}

int32_t main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1;
    //cin >> TET;
    for (int i = 1; i <= TET; i++) {
        #ifdef ONPC
            cout << "TEST CASE#" << i << endl;
        #endif
        
        if (solve()) {
            break;
        }

        #ifdef ONPC
            cout << "__________________________" << endl;
        #endif
    }
    #ifdef ONPC
        cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
    #endif
}

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: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: WRONG ANSWER

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: WRONG ANSWER