이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "closing.h"
namespace TEST1 {
int n;
VVPI gp;
void dfs(VL& dist, int u, int p = -1) {
for (auto[v, w] : gp[u]) if (v != p) {
dist[v] = dist[u] + w;
dfs(dist, v, u);
}
}
int max_score(int N, int X, int Y, ll K, VI U, VI V, VI W) {
n = N;
gp = VVPI(n);
rep(i, n-1) {
auto[u, v, w] = make_tuple(U[i], V[i], W[i]);
gp[u].pb({v, w});
gp[v].pb({u, w});
}
VL distx, disty;
distx = disty = VL(n);
dfs(distx, X);
dfs(disty, Y);
VL a;
for (ll x : distx) a.pb(x);
for (ll x : disty) a.pb(x);
sort(all(a));
a.pb(2e18);
int ans = 0;
for (ll x : a) {
if (x <= K) {
K -= x;
ans++;
} else break;
}
return ans;
}
};
int max_score(int N, int X, int Y, ll K, VI U, VI V, VI W) {
return TEST1::max_score(N, X, Y, K, U, V, W);
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |