Submission #1316614

#	Time	Username	Problem	Language	Result	Execution time	Memory
1316614		ezzzay	이주 (IOI25_migrations)	C++20	10 / 100	35 ms	452 KiB

migrations

#include "migrations.h"
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
int timer=0;
int dst[30000];
pair<int,int>p={0,0};
int send_message(int N, int i, int Pi) {
    dst[i]=dst[Pi]+1;
    if(timer==0)p={0,0};
    timer++;
    if(timer==N-1){
        for(int i=0;i<N;i++){
            p=max(p,{dst[i],i});
        }
        return p.ss;
    }
    return 0;
}

std::pair<int, int> longest_path(std::vector<int> S) {
  return {0, S.back()};
}

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