Submission #1348099

#TimeUsernameProblemLanguageResultExecution timeMemory
1348099thesentroMigrations (IOI25_migrations)C++20
10 / 100
21 ms688 KiB
#include "migrations.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

vector<ll>dp(3e4, 0);
int send_message(int N, int i, int Pi) {
	dp[i] = dp[Pi] + 1;
	if (N-1==i)
	{
		ll mx = 0;
		for (int i=0 ; i<N ; i++)
			mx = max(mx, dp[i]);
		for (int i=0 ; i<N ; i++)
		{
			if (mx==dp[i])
				return i;
		}
	}
	else
		return 0;
}

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

Compilation message (stderr)

migrations.cpp: In function 'int send_message(int, int, int)':
migrations.cpp:22:1: warning: control reaches end of non-void function [-Wreturn-type]
   22 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...