Pagini recente » Cod sursa (job #2343821) | Cod sursa (job #1846127) | Clasament oni_gim2016 | Cod sursa (job #2449489) | Cod sursa (job #1472326)
# include <bits/stdc++.h>
# define x first
# define y second
using namespace std;
int s[2205];
vector < pair < int , int > > v[2005];
bool ok[2005];
void go(int nod)
{
ok[nod] = 1;
for (auto it : v[nod])
if (!ok[it.x]) s[it.x] = s[nod] + it.y,go(it.x);
}
int main(void)
{
ifstream fi("reconst.in");
ofstream fo("reconst.out");
int n,m;
fi>>n>>m;
int a,b,c;
while (m --)
{
fi>>a>>b>>c;
v[a-1].push_back({b,c});
v[b].push_back({a-1,-c});
}
for (int i = 0;i <= n;++i) if (!ok[i]) go(i);
for (int i = 1;i <= n;++i) fo << s[i] - s[i-1] << ' ';
return fo << '\n',0;
}