# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
864110 | Ice_man | Truck Driver (IOI23_deliveries) | C++17 | 0 ms | 0 KiB |
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;
long long n;
long long t[maxn];
long long c[maxn];
vector <pair <int , int> > v[maxn];
long long ans;
long long pom;
void dfs(long long node , long long parent = -1)
{
c[node] = t[node];
for(long long i = 0; i < (long long)v[node].size(); i++)
{
if(v[node][i].first == parent) continue;
dfs(v[node][i].first , node);
ans += v[node][i].second * min(c[v[node][i].first] , pom - c[v[node][i].first]) * 2;
c[node] += c[v[node][i].first];
}
}
void init(int N, vector<int> U, vector<int> V, vector<int> T, vector<int> W)
{
pom = 1;
n = N;
///cout << pom << endl;
for(long long i = 0; i < (long long)U.size(); i++) v[U[i]].push_back({V[i] , W[i]});
for(long long i = 0; i < (long long)V.size(); i++) v[V[i]].push_back({U[i] , W[i]});
for(long long i = 0; i < T.size(); i++) pom += T[i];
///cout << pom << endl;
for(long long i = 0; i < T.size(); i++) t[i] = T[i];
}
long long max_time(int S , int X)
{
pom -= t[S];
pom += X;
t[S] = X;
ans = 0;
dfs(0 , -1);
return ans;
}
int main()
{
init(5, {0, 0, 1, 1}, {1, 2, 3, 4}, {1, 2, 3, 1}, {0, 0, 1, 0, 1});
cout << max_time(0 , 1) << endl;
return 0;
}