Submission #954978

#	Time	Username	Problem	Language	Result	Execution time	Memory
954978		boyliguanhan	Training (IOI07_training)	C++17	0 / 100	644 ms	524288 KiB

training

#include<bits/stdc++.h>
using namespace std;
#define int long long
vector<int>adj[1<<18];
int dp[3][1<<18],H[1<<18],T[1<<18];
void dfs(int n,int p){
    int sz=0,x=1e12;
    dp[0][n]=dp[1][n]=dp[2][n]=1e12;
    priority_queue<int>pq;
    pq.push(1e12);
    for(auto i:adj[n]) if(i-p){
        dfs(i,n);sz++;
        if(H[i]-H[n])
            dp[1+(H[i]<H[n])][i]=1e12;
        x+=dp[1][i];
        pq.push(dp[1][i]-dp[2][i]);
    }
    for(int i=0;i<=sz;i++){
        x-=pq.top();
        pq.pop();
        dp[0][n]=min(dp[0][n],x+T[n]*max(i,sz-i));
        dp[1][n]=min(dp[1][n],x+T[n]*max(i+1,sz-i));
        dp[2][n]=min(dp[2][n],x+T[n]*max(i,sz+1-i));
    }
}
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++) cin>>T[i];
    for(int i=1;i<=n;i++) cin>>H[i];
    for(int i=1,a,b;i<n;i++) cin>>a>>b,
        adj[a].push_back(b),adj[b].push_back(a);
    dfs(1,0);
    cout<<dp[0][1];
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 7
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 9