Submission #1301021

#	Time	Username	Problem	Language	Result	Execution time	Memory
1301021		tamir1	Migrations (IOI25_migrations)	C++20	10 / 100	29 ms	452 KiB

migrations

#include "migrations.h"
#include <bits/stdc++.h>
#include <cassert>
#include <cstdio>
using namespace std;

int depth[10005];
int mx = 0;
int id = -1;


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

std::pair<int, int> longest_path(std::vector<int> S) {
  return {0, S.back()};
}

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