Submission #1352943

#	Time	Username	Problem	Language	Result	Execution time	Memory
1352943		d4n13l	Migrations (IOI25_migrations)	C++20	0 / 100	20 ms	344 KiB

migrations

#include "migrations.h"
#include <bits/stdc++.h>

using namespace std;

vector <int> dist;
int big = 0, id = 0;
bool problem = false;

int send_message(int n, int x, int Pi) {
    if (x==1) {
        dist=vector <int> (n+1);
        dist[0]=0;
    }
    dist[x]=dist[Pi]+1;
    if (dist[x]>big) {
        big=dist[x];
        id=x;
        return 4;
    }
    return 0;
}

std::pair<int, int> longest_path(std::vector<int> s) {
    int n = s.size();
    int id = 0;
    for (int i = 0; i < n; i++) {
        if (s[i]==4) {
            id = i;
        }
    }
    return {0, id};
}

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