Submission #28862

#	Time	Username	Problem	Language	Result	Execution time	Memory
28862		Nikefor	Race (IOI11_race)	C++98	9 / 100	38 ms	1788 KiB

race

#include "race.h"
#define inf 1<<22
int best_path(int N, int K, int H[][2], int L[])
{
    int opt= -1;
    for(int i=0; i<N; i++) {
        int sum = 0;
        for(int j=i+1; j<N; j++) {
            sum+= L[j-1];
            if(sum==K) {
                if( (j-i)<opt or opt==-1 ) opt = j-i;
            }
            if(sum>K) break;
        }
    }
  return opt;
}

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