| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1052658 | presko | Paths (RMI21_paths) | C++14 | 1 ms | 2396 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<iostream>
#include<vector>
#define MAXN 2010
using namespace std;
vector<int> edges[MAXN];
int cost[MAXN][MAXN];
int cost2[MAXN][MAXN];
int dfs(int curr, int parent)
{
    int maxx=0;
    for(int i=0;i<edges[curr].size();i++)
    {
        int next=edges[curr][i];
        if(next==parent)continue;
        int val=cost[curr][next];
        maxx=max(maxx,val+dfs(next,curr));
    }
    return maxx;
}
bool clean(int curr, int parent, int len, int lim)
{
    if(len==lim)return 1;
    for(int i=0;i<edges[curr].size();i++)
    {
        int next=edges[curr][i];
        if(next==parent)continue;
        int val=cost[curr][next];
        if(clean(next,curr,len+val,lim))
        {
            cost[curr][next]=0;
            cost[next][curr]=0;
            return 1;
        }
    }
    return 0;
}
int main()
{
    int n,k;
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin>>n>>k;
    for(int i=1;i<n;i++)
    {
        int a,b,x;
        cin>>a>>b>>x;
        edges[a].push_back(b);
        edges[b].push_back(a);
        cost[a][b]=x;
        cost[b][a]=x;
        cost2[a][b]=x;
        cost2[b][a]=x;
    }
    for(int i=1;i<=n;i++)//n
    {
        int ans=0;
        for(int j=1;j<=k;j++)
        {
            int res=dfs(i,0);
            ans+=res;
            clean(i,0,0,res);
        }
        for(int a=1;a<=n;a++)
        {
            for(int b=1;b<=n;b++)cost[a][b]=cost2[a][b];
        }
        cout<<ans<<"\n";
    }
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
