oj.uz

Submission #305850

# Submission time Handle Problem Language Result Execution time Memory
305850 2020-09-24T02:53:21 Z jlallas384 Race (IOI11_race) C++14
0 / 100
 1 ms 256 KB 
#include "race.h"

int best_path(int N, int K, int H[][2], int L[]){
    int ans = 999999;
    for(int i = 0; i < N; i++){
        int len = 0;
        int cur = 0;
        for(int j = i; j < N && cur < K; j++){
            len++;
            cur+=L[j];
        }
        if(len < ans && cur == K){
            ans = len;
        }
    }
    return ans;
}

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 1 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 1 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 1 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Incorrect 1 ms 256 KB Output isn't correct
4 Halted 0 ms 0 KB -