Tietoverkko

#include <iostream>
#include <string>
#include <map>
#include <vector>
#include <algorithm>

#define ll long long

using namespace std;


void s2(int ov, int v, vector<pair<int, int>> *g, vector<pair<int, int>> &cr, vector<int> sps, int &res, vector<int> &vis2) {
    if (find(cr.begin(), cr.end(), pair<int,int>(v,ov)) == cr.end() && find(cr.begin(), cr.end(), pair<int,int>(ov,v)) == cr.end() && ov != v){
        int msp = *min_element(sps.begin(), sps.end());
        res += msp;
        //cout << ov << " to " << v << " msp " << msp << " tot " << res << "\n";
        //cout << "   ";
        //for (auto i: sps)
        //    std::cout << i << ' ';
        //cout << "\n";
        cr.push_back({ov, v});   
    }
    for (auto p: g[v]) {
        int u = p.first;
        int sp = p.second;
        if(find(vis2.begin(), vis2.end(), u) == vis2.end() && ov != u){
            vis2.push_back(u);
            vector<int> nsps;
            nsps = sps;
            nsps.push_back(sp);
            s2(ov, u, g, cr, nsps, res, vis2);
        }
    }
}


void s(int v, vector<pair<int, int>> *g, vector<pair<int, int>> &cr, int &res, vector<int> &vis){
    vector<int> vis2;
    s2(v, v, g, cr, vector<int>(), res, vis2);
    for (auto p: g[v]) {
        int u = p.first;
        if(find(vis.begin(), vis.end(), u) == vis.end()){
            vis.push_back(u);
            s(u, g, cr, res, vis);
        }
    }
}

int main() {
    vector<pair<int, int>> g[5001];
    int n;
    cin >> n;

    for(int i=0; i<(n-1); i++){
        int a,b,sp;
        cin >> a >> b >> sp;
        g[a].push_back({b,sp});
        g[b].push_back({a,sp});
    }



    //for(int si = 1; si <= n; si++){
        vector<pair<int, int>> cr;
        vector<int> vis;
        int res = 0;
        s(1, g, cr, res, vis);
        cout << res << "\n";
    //}

    

    return 0;

}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: RUNTIME ERROR