# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
864027 | 2023-10-21T17:31:32 Z | Ice_man | Truck Driver (IOI23_deliveries) | C++17 | 0 ms | 0 KB |
#include "deliveries.h" #include <iostream> #include <vector> #define maxn 100005 #define maxq 300005 #define INF 1000000010 #define endl '\n' using namespace std; int n; int pomm[maxn]; int pomm2[maxn]; void init(int N, vector<int> U, vector<int> V, vector<int> T, vector<int> W) { n = N; W[0]++; for(int i = 0; i < n; i++){ pomm[i] = W[i];pomm2[i] = T[i];} } int64_t max_time(int S , int X) { pomm[S] = X; int minn = min(pomm[0] , pomm[1]); return 2 * pomm2[0] * minn; }