제출 #1065124

#제출 시각아이디문제언어결과실행 시간메모리
1065124vjudge1봉쇄 시간 (IOI23_closing)C++17
8 / 100
85 ms34944 KiB
#include "closing.h" #include<bits/stdc++.h> using namespace std; vector<pair<int,int>>adj[200100]; vector<long long>v; void dfs(int n,int p,long long d){ v.push_back(d); for(auto[i,w]:adj[n]) if(i-p)dfs(i,n,d+w); } int max_score(int N, int X, int Y, long long K,std::vector<int> U, std::vector<int> V, std::vector<int> W){ 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]}); v.clear(); dfs(X,N,0); dfs(Y,N,0); sort(v.rbegin(),v.rend()); while(v.size()) if(v.back()<=K) K-=v.back(), v.pop_back(); else break; for(int i=0;i<N;i++) adj[i].clear(); return 2*N-v.size(); }
#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...