Submission #1365132

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

migrations

#include "migrations.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> depth(10000, 0);
int mx = 0, best = 0;

int send_message(int n, int i, int pi) {
  depth[i] = depth[pi] + 1;
  if (depth[i] > mx) {
    mx = depth[i];
    best = i;
  }
  if (i == n - 1) {
    return best;
  } else {
    return 0;
  }
}

pair<int, int> longest_path(vector<int> s) {
  return make_pair(0, s[s.size() - 1]);
}

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