Submission #1255045

#	Time	Username	Problem	Language	Result	Execution time	Memory
1255045		tosivanmak	이주 (IOI25_migrations)	C++20	0 / 100	0 ms	416 KiB

migrations

#include "migrations.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long

ll dep[10005];
ll maxdep=0;
int send_message(int N, int i, int Pi) {
  dep[0]=0;
  dep[i]=dep[Pi]+1;
  if(dep[i]>maxdep){
      maxdep=dep[i]; return 1;
  }
  return 2;
}

std::pair<int, int> longest_path(std::vector<int> S) {
    for(int i=9999;i>=1;i--){
        if(S[i]==1){
            return {0,i};
        }
    }
    return {0,0};
}

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