Submission #139445

#	Time	Username	Problem	Language	Result	Execution time	Memory
139445		reda	Race (IOI11_race)	C++14	0 / 100	2 ms	380 KiB

race

#include <bits/stdc++.h>
using namespace std ;
int best_path(int N,int K,int H[][2] , int L [] )
{
  
            int start = -1;
	        int endr = -1;
	        int mn = 1e9+7;

	        for(int i = 0; i < N; i++) {

	            int currentSum = 0;
            for(int j = i; j <N&& (j-i+1) < mn; j++) {
                currentSum += L[j];
                if(currentSum == K) {
	                    start = i;
	                    endr = j;
	                    mn = endr- start + 1;
	                    break;
}	            }
        }
 return mn;

}

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