Submission #1345797

#	Time	Username	Problem	Language	Result	Execution time	Memory
1345797		ElayV13	Migrations (IOI25_migrations)	C++20	16 / 100	20 ms	444 KiB

migrations

#include "migrations.h"
#include "bits/stdc++.h"
using namespace std;

pair<int,int> mx_dis={-1,-1};
int dd[10001];
int sum=0;

int send_message(int N,int i,int Pi)
{
      dd[i]=dd[Pi]+1;
      mx_dis=max(mx_dis,{dd[i],i});
      if(i==N-1) return mx_dis.second-sum;
      if(i==1){
            sum++;
            return 1;
      }
      if(i==2){
            sum++;
            return 1;
      }
      return 0;
}
pair<int,int>longest_path(vector<int>S)
{
      int n=S.size();
      int res=0;
      for(int i=0;i<n;i++) res+=S[i];
      return {0,res};
}

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