Submission #1302741

#	Time	Username	Problem	Language	Result	Execution time	Memory
1302741		alexrana2626	이주 (IOI25_migrations)	C++20	10 / 100	31 ms	452 KiB

migrations

#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()};
}

• Subtask 0: 0 / 0
• Subtask 1: 10 / 30
• Subtask 2: 0 / 70