# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
916216 | 2024-01-25T13:40:08 Z | kachu | Truck Driver (IOI23_deliveries) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #include "deliveries.h" using namespace std; using namespace __gnu_pbds; #define oset tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> #define ofind find_by_order #define okey order_of_key #define double long double #define pque priority_queue #define dque deque #define que queue #define umap unordered_map #define uset unordered_set #define pipii pair<int, pair<int,int>> #define pii pair<int,int> #define mp make_pair #define pb push_back #define ppb pop_back #define pf push_front #define ppf pop_front #define iter iterator #define endl '\n' #define MOD 1000000007 #define INF 1e18 int a, b, d; void init(int N, int[] U, int[] V, int[] T, int[] W){ a = W[0]; b = W[1]; d = T[0]; } long long max_time(int S, int X){ if (S == 0) a = X; else b = S; int ans; ans = min(a, b) * d; return ans; }