Submission #1255042

#	Time	Username	Problem	Language	Result	Execution time	Memory
1255042		tosivanmak	이주 (IOI25_migrations)	C++20	0 / 100	27 ms	492 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[i]=dep[Pi]+1;
  if(dep[i]>maxdep){
      maxdep=dep[i]; return 1;
  }
  return 0;
}

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

Compilation message (stderr)

migrations.cpp: In function 'std::pair<int, int> longest_path(std::vector<int>)':
migrations.cpp:22:1: warning: control reaches end of non-void function [-Wreturn-type]
   22 | }
      | ^

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