제출 #916098

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
916098	2024-01-25 09:34:14	emptypringlescan	Truck Driver (IOI23_deliveries)	C++17	29 / 100	5586 ms	27524 KiB

deliveries

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
#include "deliveries.h"
vector<pair<int,long long> > adj[100005];
long long subsz[100005],arr[100005],ans;
void fsz(int x, int p){
  subsz[x]=arr[x];
  for(pair<int,long long> i:adj[x]){
    if(i.first==p) continue;
    fsz(i.first,x);
    subsz[x]+=subsz[i.first];
  }
}
void dfs(int x, int p){
  for(pair<int,long long> i:adj[x]){
    if(i.first==p) continue;
    ans+=i.second*min(subsz[i.first],1+subsz[0]-subsz[i.first]);
    dfs(i.first,x);
  }
}
void init(int n, vector<int> u, vector<int> v, vector<int> t, vector<int> w){
  for(int i=0; i<n-1; i++){
    adj[u[i]].push_back({v[i],t[i]});
    adj[v[i]].push_back({u[i],t[i]});
  }
  for(int i=0; i<n; i++){
    arr[i]=w[i];
  }
}
long long max_time(int s, int x){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 21 / 21
• Subtask 3: 0 / 14
• Subtask 4: 0 / 21
• Subtask 5: 0 / 36