Cod sursa(job #1132794)

Utilizator uagamagaMatei Rogoz uagamaga Data 3 martie 2014 22:01:52
Problema Sate Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 1.01 kb
#include <fstream>
#include <queue>
#include <vector>
#define MAX_SATE 30001
using namespace std;

ifstream fin("sate.in");
ofstream fout("sate.out");

struct sat
{
    int id,d;
};

int n,m,x,y,dist=0;
char visited[MAX_SATE];
queue <int> C;
vector <sat> G[MAX_SATE];

void BF(int i)
{
    int vec;
    C.push(i);
    visited[i] = '1';

    while(!C.empty())
    {
        vec = C.front();
        C.pop();

        for(int j=0;j<G[vec].size();++j)
        {
            if(visited[G[vec][j].id]!='1')
            {
                C.push(G[vec][j].id);
                visited[G[vec][j].id] = '1';
                dist += G[vec][j].d;
            }
        }
    }
}
int main()
{
    int i,j,d,ctr=0;

    fin>>n>>m>>x>>y;

    for(int k=0;k<m;++k)
    {
        fin>>i>>j>>d;

        sat p,q;
        p.id = i;
        p.d = -d;
        q.id = j;
        q.d = d;

        G[i].push_back(q);
        G[j].push_back(p);
    }

    BF(x);
    fout<<dist;

    return 0;
}