Submission #1188771

#	Time	Username	Problem	Language	Result	Execution time	Memory
1188771		GoBananas69	Race (IOI11_race)	C++20	Compilation error	0 ms	0 KiB

race

#include <iostream>
#include <vector>
#include <array>
using namespace std;

typedef long long ll;

vector<vector<pair<int, int>>> adj;

bool check(vector<int> &pref, int m, int k) {
    for (int i = 0; i<pref.size() - m; ++i) {
        if (pref[i + m] - pref[i] == k) {
            return true;
        }
    }
    return false;
}

int best_path(int n, int k, vector<vector<int>> h, vector<int> s) {
    adj.clear();
    adj.resize(n);
    for (int i = 0; i < n - 1; ++i) {
        int u = h[i][0], v = h[i][1], w = s[i];
        adj[u].push_back({v, w});
    }
    int l = 0, r = n;
    vector<int> pref(n, 0);
    for (int i = 1; i<n; ++i) {
        pref[i] = pref[i - 1] + s[i - 1];
    }
    while (l + 1 < r) {
        int m = (l + r) / 2;
        if (check(pref, m, k)) {
            r = m;
        } else {
            l = m;
        }
    }
    return (r == n ? -1 : r);
}

Compilation message (stderr)

/usr/bin/ld: /tmp/cchze11j.o: in function `main':
grader.cpp:(.text.startup+0x28): undefined reference to `best_path(int, int, int (*) [2], int*)'
collect2: error: ld returned 1 exit status