Submission #1264692

#	Time	Username	Problem	Language	Result	Execution time	Memory
1264692		martin_011	이주 (IOI25_migrations)	C++20	10 / 100	27 ms	576 KiB

migrations

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

using namespace std;

typedef long long ll;
typedef vector<ll> vll;


vll d(10001, 0);


int send_message(int n, int i, int pi) {
  d[i] = d[pi] + 1;

  if (i != n-1) {
    return 0;
  } else {
    ll nd = max_element(d.begin(), d.end()) - d.begin();
    return nd;
  }
}

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

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