Submission #1287656

#	Time	Username	Problem	Language	Result	Execution time	Memory
1287656		eri16	경주 (Race) (IOI11_race)	C++20	0 / 100	1 ms	572 KiB

race

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

int subtask_1(int n, int k, int v1[][2], 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);
            }
            
        }
    }
    
    return bst_ans;
    
    
    
    
}







int best_path(int n, int k, int v1[][2], 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;
    
}

• Subtask 1: 0 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57