제출 #917358

#제출 시각아이디문제언어결과실행 시간메모리
917358Tyx2019Truck Driver (IOI23_deliveries)C++17
8 / 100
78 ms9424 KiB
#include "deliveries.h"
int deliveries[2];
int dist;
void init(int N, std::vector<int> U, std::vector<int> V, std::vector<int> T, std::vector<int> W) {
	dist=T[0];
	deliveries[0]=W[0];
	deliveries[1]=W[1];
}

long long max_time(int S, int X) {
	deliveries[S]=X;
	if(deliveries[0]==deliveries[1]){
		return dist*deliveries[0]*2;
	}
	if(deliveries[0]>deliveries[1]){
		return dist*deliveries[1]*2;
	}
	return dist*(deliveries[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...