# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
524412 | IMystic | Ball Machine (BOI13_ballmachine) | C++17 | 1101 ms | 28344 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010, INF = 1000000000;
vector<int> adj[N];
vector<int> pref(N, INF), dist(N, INF);
vector<pair<int, bool>> order;
int lg = 1;
void dfs(int n, int par){
sort(adj[n].begin(), adj[n].end(), [](int a, int b){return pref[a] < pref[b];});
if(par != -1)dist[n] = dist[par] + 1;
lg = max(lg, dist[n]);
for(int c : adj[n]){
if(c != par){
dfs(c, n);
}
}
order.emplace_back(n, false);
}
int main(){
ios_base :: sync_with_stdio(false);
cin.tie(nullptr);
int n, m, root;
cin >> n >> m;
vector<int> p(n);
for(int i=0; i<n; i++){
Compilation message (stderr)
# | 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... |