Submission #792303

#	Time	Username	Problem	Language	Result	Execution time	Memory
792303		limabeans	경주 (Race) (IOI11_race)	C++17	0 / 100	2 ms	4948 KiB

race

#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;
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57