Submission #915004

#TimeUsernameProblemLanguageResultExecution timeMemory
915004LCJLYTruck Driver (IOI23_deliveries)C++17
8 / 100
70 ms10328 KiB
#include "deliveries.h" #include <bits/stdc++.h> using namespace std; int arr[2]; int dist; void init(int n, vector<int> u, vector<int> v, vector<int> t, vector<int> w) { for(int x=0;x<2;x++){ arr[x]=w[x]; } dist=t[0]; return; } long long max_time(int S, int X) { arr[S]=X; if(arr[0]>=arr[1]){ return dist*arr[1]*2; } else{ return dist*(arr[0]+1)*2; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...