Submission #1303143

#	Time	Username	Problem	Language	Result	Execution time	Memory
1303143		gabrielz	이주 (IOI25_migrations)	C++20	0 / 100	2 ms	400 KiB

migrations

#include <bits/stdc++.h>

constexpr int LM = 9998, RM = 20000;
int lm = LM, rm = RM;

int send_message(int N, int i, int Pi) {
  if (lm % 2 == 0) {
    return lm--;
  } else {
    return rm--;
  }
}

std::pair<int, int> longest_path(std::vector<int> S) {
  return std::make_pair(LM, RM);
}

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