| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 842800 | helloworld1705 | Closing Time (IOI23_closing) | C++17 | 0 ms | 0 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "closing.h"
using namespace std;
// /#define int long long  
const int N = 2e6 + 5;
int dx[N] , dy[N];
vector <pair <int , int>> adj[N];
vector <int> vec = {};
void dfs_x(int u , int par) {
    for(auto [v , w] : adj[u]) {
        if(v == par) {
            continue;
        }
        dx[v] = dx[u] + w;
        dfs_x(v , u);
    }
}
void dfs_y(int u , int par) {
    for(auto [v , w] : adj[u]) {
        if(v == par) {
            continue;
        }
        dy[v] = dy[u] + w;
        dfs_y(v , u);
    }
}
int max_score(int n , int x , int y , int k , vector <int> u , vector <int> v , vector <int> w) {
    for(int i = 0; i < u.size(); i++) {
        adj[u[i]].emplace_back(v[i] , w[i]);
        adj[v[i]].emplace_back(u[i] , w[i]);
    }
    dfs_x(x , x);
    dfs_y(y , y);
    for(int i = 0; i < n; i++) {
        vec.push_back(dx[i]);
        vec.push_back(dy[i]);
    }
    sort(vec.begin() , vec.end());
    int ans = 0;
    int sum = 0;
    for(int x : vec) {
        sum += x;
        if(sum > k) break;
        ans++;
    }
    vec.clear();
    for(int i = 0; i < n; i++) {
    	adj[i].clear();
    	dx[i] = dy[i] = 0;
    }
    return ans;
}
// main() {
// 	ios_base::sync_with_stdio(0);
// 	cin.tie(0);	cout.tie(0);
// 	int n , x , y , k;
//     cin >> n >> x >> y >> k;
//     vector <int> u(n) , v(n) , w(n);
//     for(int i = 0; i < n - 1; i++) {
//     	cin >> u[i];
//     }
//     for(int i = 0; i < n - 1; i++) cin >> v[i];
//     for(int i = 0; i < n - 1; i++) cin >> w[i];
//     cout << max_score(n , x , y , k , u , v , w) << '\n';
// }
/*
7 0 2 10
0 0 1 2 2 5
1 3 2 4 5 6
2 3 4 2 5 3
*/
/*
4 0 3 20
0 1 2
1 2 3
18 1 19
*/
