This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// correct/solution-subtask1.cpp
#include "deliveries.h"
#include <iostream>
#define MAXN 101000
using namespace std;
long long N, TIME;
long long W[MAXN];
void init(int NN, std::vector<int> /*UU*/, std::vector<int> /*VV*/, std::vector<int> TT, std::vector<int> WW){
N = NN;
for(int i=0; i<N; i++){
W[i] = WW[i];
}
W[0]++;
TIME = TT[0];
}
long long max_time(int S, int X){
if(S==0) X++;
W[S] = X;
return TIME * 2 * min(W[0],W[1]);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |