Cod sursa(job #696196)

Utilizator Viva12Ferentz Sergiu Viva12 Data 28 februarie 2012 17:32:40
Problema Tunelul groazei Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.69 kb
#include <cstdio>
#include <utility>
#include <vector>
#define lim 100050
using namespace std;

vector < pair<int, int> > G[265];
int n,m;
void citire()
{
    scanf("%d %d",&n,&m);
    for(int i=0;i<m;i++)
        {   int x,y,c;
            scanf("%d %d %d",&x,&y,&c);
            G[x].push_back(make_pair(y,c));
            G[y].push_back(make_pair(x,c));
        }
}

void solve()
{   int cost = 0;
    for(int i=1;i<=m;i++)
        for(int q = 0; q<G[i].size();q++)
            cost+= G[i][q].second * G[i].size();

}
int main()
{
    freopen("tunel.in","r",stdin);
    freopen("tunel.out","w",stdout);
    citire();
    solve();
    printf("%d",cost);
    return 0;
}