In the kingdom of Henryy, there are N (2 <= N <= 200) cities, with M (M <= 30000) one-way roads connecting them. You are lucky enough to have a chance to have a tour in the kingdom. The route should be designed as: The route should contain one or more loops. (A loop is a route like: A->B->……->P->A.) 
Every city should be just in one route. 
A loop should have at least two cities. In one route, each city should be visited just once. (The only exception is that the first and the last city should be the same and this city is visited twice.) 
The total distance the N roads you have chosen should be minimized. 

1

6 9

1 2 5

2 3 5

3 1 10

3 4 12

4 1 8

4 6 11

5 4 7

5 6 9

6 5 4

42

#include <iostream>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <queue>

#include <vector>

#include <cmath>

#define mem(a, b) memset(a, b, sizeof(a))

using namespace std;

const int maxn = , INF = 0x7fffffff;

int usedx[maxn], usedy[maxn], cy[maxn], cx[maxn], w[maxn][maxn], bx[maxn], by[maxn];

int nx, ny, n, minn, min_val, m;

int dfs(int u)

{

    usedx[u] = ;

    for(int i=; i<=ny; i++)

    {

        if(usedy[i] == -)

        {

            int t = bx[u] + by[i] - w[u][i];

            if(t == )

            {

                usedy[i] = ;

                if(cy[i] == - || dfs(cy[i]))

                {

                    cy[i] = u;

                    cx[u] = i;

                    return ;

                }

            }

            else if(t > )

                minn = min(minn, t);

        }

    }

    return ;

}

void km()

{

    mem(cy, -);

    mem(cx, -);

    for(int i=; i<=nx; i++) bx[i] = -INF;

    mem(by, );

    for(int i=; i<=nx; i++)

        for(int j=; j<=ny; j++)

                bx[i] = max(bx[i], w[i][j]);

    for(int i=; i<=nx; i++)

    {

        while()

        {

            minn = INF;

            mem(usedx, -);

            mem(usedy, -);

            if(dfs(i)) break;

            for(int j=; j<=nx; j++)

                if(usedx[j] != -) bx[j] -= minn;

            for(int j=; j<=ny; j++)

                if(usedy[j] != -) by[j] += minn;

        }

    }

    min_val = ;

    for(int i=; i<=nx; i++)

        if(cx[i] != -)

            min_val += w[i][cx[i]];

    printf("%d\n",-min_val);

}

int main()

{

    int T;

    scanf("%d",&T);

    while(T--)

    {

        scanf("%d%d",&n,&m);

        for(int i=; i<=n; i++)

            for(int j=; j<=n; j++) w[i][j] = -INF;

        for(int i=; i<=m; i++)

        {

            int u, v, c;

            scanf("%d%d%d",&u,&v,&c);

                w[u][v] = max(w[u][v], -c);

        }

        nx = ny = n;

        km();

    }

    return ;

}