Submission #1188780

#TimeUsernameProblemLanguageResultExecution timeMemory
1188780GoBananas69Race (IOI11_race)C++20
0 / 100
0 ms320 KiB
#include <iostream> #include <vector> #include <array> using namespace std; int best_path(int n, int k, int h[][2], int* s) { return 0; } // int main() { // cout << best_path(5, 5, {{0, 1}, {1, 2}, {2, 3}, {3, 4}}, {4, 1, 3, 4}); // }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...