Tietoverkko

#include <iostream>
#include <stdio.h>
#include <math.h>
#include <vector>
#include <string>
#include <sstream>
#include <bits/stdc++.h>
#define lint long long int

using namespace std;

struct computer 
{
	int backwardConnection;
	vector<int> history;
};

int commonComputer(vector<int> first_history, vector<int> second_history) {
	int i = 0;
	while(first_history[i] == second_history[i]) {
		i++;
	}
	return i;
}

int main()
{
    int n; cin >> n;
    computer network[n];
    network[0].history.push_back(1);
    network[0].backwardConnection = 0;
    for(int i = 0; i < n - 1; i++) 
    {
    	int idf; cin >> idf;
    	int ids; cin >> ids;
    	int speed; cin >> speed;
    	network[ids-1].backwardConnection = speed;
    	network[ids-1].history = vector<int>(network[idf-1].history);
    	network[ids-1].history.push_back(ids);
	}
	
	int sum = 0;
	for(int i = 1; i < n; i++) {
		for(int j = 1 + i; j <= n; j++) {
			int commonPC = commonComputer(network[i-1].history, network[j-1].history);
			int currMin = network[j-1].backwardConnection;
			vector<int> currentHistory = network[i-1].history;
			int currID = i;
			cout << "Hello" << endl;
			while(currID != commonPC) {
				currMin = min(currMin, network[currentHistory.back() - 1].backwardConnection);
				currentHistory.pop_back();
				currID = currentHistory.back();
			}
			currentHistory.clear();
			currentHistory = network[j-1].history;
			currID = j;
			while(currID != commonPC) {
				currMin = min(currMin, network[currentHistory.back() - 1].backwardConnection);
				currentHistory.pop_back();
				currID = currentHistory.back();
			}
			sum += currMin;
		}
	} 
	cout << sum;
	return 0;
}

Test 1

Group: 1, 2, 3

Verdict: RUNTIME ERROR

Test 2

Group: 2, 3

Verdict: RUNTIME ERROR

Test 3

Group: 3

Verdict: RUNTIME ERROR