This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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];}
}
long long max_time(int S , int X)
{
pomm[S] = X;
if(S == 0) pomm[S]++;
int minn = min(pomm[0] , pomm[1]);
return 2 * pomm2[0] * minn;
}
# | 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... |