Submission #1255106

#	Time	Username	Problem	Language	Result	Execution time	Memory
1255106		vpinx	Migrations (IOI25_migrations)	C++20	0 / 100	27 ms	408 KiB

migrations

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

vector<int> dist;
int md = 0;

int send_message(int n, int i, int pi) {
    if (i == 1) {
        dist.resize(n);
        dist[0] = 0;
    }
    dist[i] = dist[pi] + 1;
    md = max(md, dist[i]);
    
    if (dist[i] < md) return 0;
    return 1;
}

pair<int, int> longest_path(vector<int> s) {
    int u = 0, v;
    for (int i = 0; i < s.size(); i++) {
        if (s[i] == 1) v = i + 1;
    }
    return {u, v};
}

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