Cod sursa(job #2072994)

Utilizator zdavid112zIon David-Gabriel zdavid112z Data 22 noiembrie 2017 16:32:17
Problema Tunelul groazei Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.52 kb
#include <bits/stdc++.h>
#define eps 1e-8

using namespace std;

int n, m;
int nrm[260];
double mat[260][260];

double gauss()
{
    for(int i = 0; i < n; i++)
    {
        if(abs(mat[i][i]) < eps)
        {
            for(int j = i + 1; j < n; j++)
                if(abs(mat[j][i]) >= eps)
                {
                    for(int k = i; k <= n; k++)
                        swap(mat[i][k], mat[j][k]);
                    break;
                }
        }
        double oneovermatii = 1. / mat[i][i];
        for(int j = i + 1; j <= n; j++)
            mat[i][j] *= oneovermatii;
        mat[i][i] = 1;
        for(int j = i + 1; j < n; j++)
        {
            if(abs(mat[j][i]) < eps) continue;
            for(int k = i + 1; k <= n; k++)
                mat[j][k] -= mat[j][i] * mat[i][k];
            mat[j][i] = 0;
        }
    }
    return mat[n - 1][n];
}

int main()
{
    freopen("tunel.in", "r", stdin);
    freopen("tunel.out", "w", stdout);
    int a, b, c;
    scanf("%d%d", &n, &m);
    for(int i = 0; i < m; i++)
    {
        scanf("%d%d%d", &a, &b, &c);
        a--; b--;
        nrm[a]++;
        nrm[b]++;
        mat[a][b]++;
        mat[b][a]++;
        mat[a][n] -= c;
        mat[b][n] -= c;
    }
    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j <= n; j++)
            mat[i][j] /= nrm[i];
        mat[i][i]--;
    }
    mat[0][0] = 1;
    for(int i = 1; i <= n; i++)
        mat[0][i] = 0;
    printf("%.3f", gauss());
    return 0;
}