Submission #1289237

#	Time	Username	Problem	Language	Result	Execution time	Memory
1289237		cansu_mutlu	Paths (RMI21_paths)	C++20	0 / 100	107 ms	12840 KiB

Main

#include<bits/stdc++.h>
#define int long long 
using namespace std;
vector<vector<array<int,2>>> a;
vector<array<int,2>> f,ans;
vector<int> h;
// 0 = node, 1 = miktar;
void dfs(int s,int anne)
{
    for(auto i:a[s])
    {
        int x = i[0];
        int val = i[1];
        if(x==anne) continue;
        dfs(x,s);
        if(f[s][1]<f[x][1]+val)
        {
            if(h[s]<f[s][1]) h[s] = f[s][1];
            f[s][1] = f[x][1]+val;
            f[s][0] = x;
        }
        else if(h[s]<f[x][1]+val) h[s] = f[x][1]+val;
    }
}
void df(int s,int anne,int val)
{
    ans[s] = f[s];
    if(anne!=0)
    {
        
        if(ans[anne][0]!=s)
        {
            if(ans[anne][1]+val>ans[s][1])
            {
                ans[s] = {anne,ans[anne][1]+val};
            }
        }
        if(f[anne][0]!=s)
        {
            if(f[anne][1]+val>ans[s][1])
            {
                ans[s] = {f[anne][0],val+f[anne][1]};
            }
        }
        else
        {
            if(h[anne]+val>ans[s][1])
            ans[s] = {-1,h[anne]+val};
        }
    }
    for(auto i:a[s])
    {

        int x = i[0];
        int v = i[1];
        //cout << x << " " << s <<  " "<< v << endl;
        if(x==anne) continue;
        df(x,s,v);
    }
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n,k;
    
    cin >> n >> k;
    a.resize(n+1);
    h.resize(n+1,0);
    f.resize(n+1,{0,0});
    ans.resize(n+1,{0,0});
    for(int i=0;i<n-1;i++)
    {
        int u,v,x;
        cin >> u >> v >> x;
        a[u].push_back({v,x});
        a[v].push_back({u,x});
    }
    dfs(1,0);
    df(1,0,0);
    for(int i=1;i<=n;i++) cout << ans[i][1] << endl;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 11
• Subtask 3: 0 / 17
• Subtask 4: 0 / 20
• Subtask 5: 0 / 12
• Subtask 6: 0 / 32