Submission #1303858

#	Time	Username	Problem	Language	Result	Execution time	Memory
1303858		georgeckito	Migrations (IOI25_migrations)	C++20	10 / 100	37 ms	452 KiB

migrations

#include "migrations.h"
int d[100001];
int ans;
int ansN;
int send_message(int N, int i, int Pi)
{
  if (i == 1)
  {
    d[0] = 0;
    ans = 0;
    ansN = 0;
  }
  d[i] = d[Pi] + 1;
  if (d[i] > ans)
  {
    ans = d[i];
    ansN = i;
  }
  if (i == N - 1)
  {
    return ansN + 1;
  }
  else
    return 0;
}

std::pair<int, int> longest_path(std::vector<int> S)
{
  int n = S.size();
  int aans = 0;
  for (int i = 1; i < n; i++)
  {
    if (S[i] != 0)
    {
      aans = S[i];
    }
  }
  return {0, aans - 1};
}

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