Cod sursa(job #3164307)
Utilizator | Elisa Ipate elisa.ipate | Data | 2 noiembrie 2023 17:59:02 |
---|---|---|---|
Problema | Lowest Common Ancestor | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
#define nmax 200002
vector <int> edges[nmax], edge_price[nmax];
int cost[nmax];
int main()
{
int n, m, i, a, b, cost;
cin >> n >> m;
/*ifstream cin("apm.in");
ofstream cout("apm.out");*/
for( i = 0; i < m; i++ ) {
cin >> a >> b >> cost;
edges[a].push_back(b);
edges[a].push_back(cost);
edges[b].push_back(a);
edges[b].push_back(cost);
}
return 0;
}