Submission #1287653

#TimeUsernameProblemLanguageResultExecution timeMemory
1287653eri16Race (IOI11_race)C++20
Compilation error
0 ms0 KiB
#include <bits/stdc++.h>
using namespace std;

long long subtask_1(long long n,long long k,vector<vector<int>> v1,vector <int> v2){
    
    int psum[n+1];
    
    psum[0]=0;
    
    for (int i=1; i<=n; i++){
        psum[i]=psum[i-1]+v2[i-1];
    }
    
    long long bst_ans=n;
    
    for (long long i=1; i<=n; i++){
        for (long long j=1; j<=n; j++){
            
            if (psum[j]-psum[i]==k){
                bst_ans=min(bst_ans,j-i+1);
            }
            
        }
    }
    
    return bst_ans;
    
    
    
    
}







long long best_path(long long n,long long k,vector<vector<int>> v1,vector <int> v2){
    
    int sbtsk_1=1;
    
    for (int i=0; i<n-1; i++){
        if (v1[i][0]!=v1[i][1]-1){
            sbtsk_1=0;
        }
    }
    
    if (sbtsk_1){
        return(subtask_1(n,k,v1,v2));
    }
    
    return -1;
    
}

Compilation message (stderr)

/usr/bin/ld: /tmp/cc3Hodgk.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