# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1098817 | KasymK | 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"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 2e5+5;
vector<pii> adj[N];
ll dis[N];
int max_score(int n, int x, int y, ll k, vector<int> u, vector<int> v, vector<int> w) {
for(int i = 0; i < n-1; ++i)
adj[u[i]+1].pb({v[i]+1, w[i]}), adj[v[i]+1].pb({u[i]+1, w[i]})
vector<ll> A;
vector<int> D;
D.pb(x), D.pb(y);
for(int ad : D){
memset(dis, -1, sizeof dis);
queue<int> q;
q.push(ad);
dis[ad] = 0;
while(!q.empty()){
int x = q.front();
q.pop();
for(auto i : adj[x])
if(dis[i.ff] == -1)
dis[i.ff] = dis[x]+1, q.push(i.ff);
}
for(int i = 1; i <= n; ++i)
if(~dis[i])
A.pb(dis[i]);
}
ll sm = 0;
for(int i = 0; i <= (int)A.size(); ++i)
if(i == (int)A.size() or (sm+=v[i])>k)
return i;
}