제출 #792303

#제출 시각아이디문제언어결과실행 시간메모리
792303limabeans경주 (Race) (IOI11_race)C++17
0 / 100
2 ms4948 KiB
#include <algorithm> #include <iostream> #include <vector> #include <cassert> using namespace std; using ll = long long; const int maxn=2e5+10; vector<pair<ll,int>> g[maxn]; int best_path(int n, int k, int H[][2], int L[]) { for (int i=0; i<n-1; i++) { int u=H[i][0]; int v=H[i][1]; int w=L[i]; g[v].push_back({w,u}); g[u].push_back({w,v}); } return n; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...