Tietoverkko

input/code.cpp: In function 'void set_io(std::__cxx11::string)':
input/code.cpp:16:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen((filename + ".in").c_str(), "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:17:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen((filename + ".out").c_str(), "w", stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define sz size
#define rsz resize

void set_io(string filename = "") {
    ios::sync_with_stdio(0);
	cin.tie(0);

    if (filename != "") {
        freopen((filename + ".in").c_str(), "r", stdin);
        freopen((filename + ".out").c_str(), "w", stdout);
    }
}

vector<vector<pair<int,int>>> adj;
vector<bool> visited;

int dfs(int a, int b, int bs) {
    visited[a] = true;
    int ans = INT_MAX;
    for (auto n : adj[a]) {
        if (visited[n.fi]) continue;
        if (n.fi == b) return min(n.se, bs);
        int temp = dfs(n.fi, b, min(n.se, bs));
        ans = min(ans, temp);
    }

    return ans;
}

int main() {
    set_io("");

    int n; cin >> n;
    adj.rsz(n);
    for (int i = 0; i < n-1; i++) {
        int a, b, x; cin >> a >> b >> x;
        adj[a-1].pb({b-1, x});
        adj[b-1].pb({a-1, x});
    }

    ll ans = 0;
    for (int i = 0; i < n; i++) {
        for (int j = i + 1; j < n; j++) {
            visited = vector<bool>(n, false);
            ans += dfs(i, j, INT_MAX);
        }
    }
    cout << ans << endl;
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED