Submission #1222624

#	Time	Username	Problem	Language	Result	Execution time	Memory
1222624		felipe_massa	Race (IOI11_race)	C++20	0 / 100	0 ms	320 KiB

race

#include "race.h"
#include<bits/stdc++.h>
using namespace std;

#define size(u) (int)(u).size()
#define pb push_back
#define fastio ios::sync_with_stdio(false); cin.tie(nullptr);
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

int best_path(int N, int K, int H[][2], int L[])
{
	vector<vector<pair<int, int>>> adj(N);
	for (int i = 0; i < N-1; i++) {
		adj[H[i][0]].pb({H[i][1], L[i]});
		adj[H[i][1]].pb({H[i][0], L[i]});
	}
	int ans = INT_MAX;
	return N;
}

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