Cod sursa(job #2309522)

Utilizator patcasrarespatcas rares danut patcasrares Data 29 decembrie 2018 11:18:41
Problema Tunelul groazei Scor 100
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.6 kb
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cmath>
using namespace std;
ifstream fin("tunel.in");
ofstream fout("tunel.out");
const double eps=1e-5;
int n,m,nr,a[35][35],k,poz,f,g,cost;
double r[305][305],sol[305],val;
void elg()
{
    for(int j=1;j<=nr;j++)
        for(int i=j;i<=m;i++)
            if(abs(r[i][j])>eps)
            {
                for(int h=1;h<=nr+1;h++)
                    swap(r[j][h],r[i][h]);
                for(int h=j+1;h<=m;h++)
                    if(abs(r[h][j])>eps)
                    {
                        val=r[h][j]/r[j][j];
                        r[h][j]=0;
                        for(int c=j+1;c<=nr+1;c++)
                            r[h][c]-=val*r[j][c];
                    }
                    else
                        r[h][j]=0;
                break;
            }
            else
                r[i][j]=0;
    for(int j=1;j<=nr;j++)
        for(int i=j;i<=m;i++)
            if(abs(r[i][j])<=eps)
                r[i][j]=0;
    for(int i=m;i>0;i--)
    {
        poz=1;
        while(poz<=nr&&abs(r[i][poz])<=eps)
            poz++;
        if(poz==nr+1)
            continue;
        sol[i]=r[i][nr+1];
        for(int j=poz+1;j<=nr;j++)
            sol[i]-=sol[j]*r[i][j];
        sol[i]/=r[i][poz];
    }
}
void ve()
{
    r[f][f]++;
    r[f][n+1]+=cost;
    r[f][g]--;
}
int main()
{
    fin>>n>>m;
    while(m--)
    {
        fin>>f>>g>>cost;
        ve();
        swap(f,g);
        ve();
    }
    m=nr=n;
    elg();
    fout<<fixed<<setprecision(10)<<sol[1];
}