oj.uz

Submission #1095994

# Submission time Handle Problem Language Result Execution time Memory
1095994 2024-10-03T14:23:26 Z YugiHacker Race (IOI11_race) C++17
0 / 100
 6 ms 10072 KB 
#ifndef yugi
#include "race.h"
#endif // yugi

#define maxn 200005
#include<bits/stdc++.h>
using namespace std;
int n, k;
vector <int> a[maxn];
int best_path(int N, int K, int H[][2], int L[])
{
  n = N, k = K;
}

#ifdef hacker
main() {
    int n, k; cin >> n >> k;
    int h[n+1][2], l[n+1];
    cin >> n >> k;
    for (int i=1; i<n; i++) {
        cin >> h[i][0] >> h[i][1] >> l[i];
    }
    cout << best_path(n, k, h, l);
}
#endif // hacker

Compilation message

race.cpp: In function 'int best_path(int, int, int (*)[2], int*)':
race.cpp:13:1: warning: no return statement in function returning non-void [-Wreturn-type]
   13 | }
      | ^

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 10072 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 10072 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 10072 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 10072 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -