Submission #1095996

#TimeUsernameProblemLanguageResultExecution timeMemory
1095996YugiHackerRace (IOI11_race)C++17
0 / 100
2 ms4952 KiB
#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; return 3; } #ifdef yugi 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 // yugi
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...