#include "migrations.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
ll dep[10005];
ll maxdep=0; ll nd;
int send_message(int N, int i, int Pi) {
dep[0]=0;
dep[i]=dep[Pi]+1;
if(dep[i]>maxdep){
maxdep=dep[i]; nd=i;
}
if(i==N-1)return nd;
return 0;
}
std::pair<int, int> longest_path(std::vector<int> S) {
for(int i=9999;i>=1;i--){
if(S[i]!=0){
return {0,S[i]};
}
}
return {0,0};
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |