Submission #1212702

#TimeUsernameProblemLanguageResultExecution timeMemory
1212702trimkusClosing Time (IOI23_closing)C++20
17 / 100
76 ms32836 KiB
#include "closing.h" #include <bits/stdc++.h> using namespace std; using ll = long long; int max_score(int N, int X, int Y, long long K, std::vector<int> U, std::vector<int> V, std::vector<int> _W) { vector<vector<pair<int, int>>> adj(N); for (int i = 0; i < N - 1; ++i) { adj[U[i]].push_back({V[i], _W[i]}); adj[V[i]].push_back({U[i], _W[i]}); } vector<ll> C(N); vector<vector<bool>> vis(N, vector<bool>(2)); priority_queue<array<ll, 4>> pq; pq.push({0, X, 0, 0}); pq.push({0, Y, 0, 1}); ll tot = 0; int res = 0; while (pq.size()) { ll need = -pq.top()[0]; int v = pq.top()[1]; ll sum = pq.top()[2]; int p = pq.top()[3]; pq.pop(); if (sum - C[v] != need) { pq.push({-max(0LL, sum - C[v]), v, sum, p}); continue; } if (need + tot > K) continue; tot += need; res += 1; C[v] += need; vis[v][p] = 1; for (auto& [u, w] : adj[v]) { if (vis[u][p]) continue; pq.push({-max(0LL, sum + w - C[u]), u, sum + w, p}); } } return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...