#include <iostream>
#include <vector>
#include <deliveries.h>
#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]);
c[node] += c[v[node][i].first];
}
}
void init(int N, vector<int> U, vector<int> V, vector<int> T, vector<int> W)
{
n = N;
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 < n; i++) pom += t[i];
for(long long i = 0; i < n; i++) t[i] = T[i];
}
long long max_time(int S , int X)
{
pom -= t[S];
t[S] = X;
pom += t[S];
ans = 0;
dfs(0);
return ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
68 ms |
11140 KB |
3rd lines differ - on the 1st token, expected: '39049160', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
2652 KB |
3rd lines differ - on the 1st token, expected: '1627540', found: '-45908906828' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
68 ms |
11140 KB |
3rd lines differ - on the 1st token, expected: '39049160', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
68 ms |
11140 KB |
3rd lines differ - on the 1st token, expected: '39049160', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
68 ms |
11140 KB |
3rd lines differ - on the 1st token, expected: '39049160', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |