# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1160698 | AlgorithmWarrior | Railway (BOI17_railway) | C++20 | 151 ms | 34760 KiB |
#include <bits/stdc++.h>
using namespace std;
int const MAX=2e5+5;
int const LOG=20;
int n,m,k;
vector<int>tree[MAX];
int euler[MAX];
int pos[MAX];
int h[MAX];
int rmq[MAX][LOG];
int logar[MAX];
int used[MAX];
int query[MAX];
struct edge{
int u,v;
}edg[MAX];
void read(){
cin>>n>>m>>k;
int i;
for(i=1;i<n;++i){
int u,v;
cin>>u>>v;
tree[u].push_back(v);
tree[v].push_back(u);
edg[i]={u,v};
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |