# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1129264 | hippo123 | Race (IOI11_race) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
using namespace std;
int n, k;
#define pr pair<int, int>
#define f first
#define s second
#define ll long long
#define pb push_back
const int ndim=1e5+10;
vector<vector<pr>> adj(ndim);
vector<bool> vis(ndim);
vector<int> d(ndim);
vector<int> in(ndim), out(ndim);
vector<int> col(ndim);
vector<int> par(ndim);
map<int, int> ms[ndim];
int ans=1e9;
void dfs(int nd, int par0){
if(vis[nd]) return;