Submission #1302741

#TimeUsernameProblemLanguageResultExecution timeMemory
1302741alexrana2626Migrations (IOI25_migrations)C++20
10 / 100
31 ms452 KiB
#include "migrations.h"
#include <bits/stdc++.h>
using namespace std;

int a[100001], id, mx = -1;
int send_message(int N, int i, int Pi) 
{
   a[i] = a[Pi] + 1;
   if (a[i] > mx)
   {
   	    mx = a[i];
   	    id = i;
   }
   if (i == N - 1) return id;
   return 0;
}

pair<int, int> longest_path(vector<int> S) 
{
    return {0, S.back()};
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...