Submission #126343

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
126343	2019-07-07T12:25:48 Z	ksmzzang2003	Race (IOI11_race)	C++14	Compilation error	0 ms	0 KB

race

#include "race.h"
#include <bits/stdc++.h>
using namespace std;
typedef pair <int,int> pii;

int N,K,L[200003];
int par[200003],sz[200003];
vector <pii> adj[200003];
int check[1000003];
bool del[200003];
int ans = 1987654321;
vector <pii> lazy;
vector <int> usecheck;
int dfs1(int now,int prev)
{
    sz[now]  =0;
    for(int i=0;i<adj[now].size();i++)
    {
        int next = adj[now][i].first;
        int cost = adj[now][i].second;
        if(next == prev) continue;
        if(del[next]) continue;
        sz[now] += dfs1(next,now);
    }
    return ++sz[now];
}

int find_cen(int now,int prev,int root)
{
    for(int i=0;i<adj[now].size();i++)
    {
        int next = adj[now][i].first;
        int cost = adj[now][i].second;
        if(next == prev) continue;
        if(del[next]) continue;
        if(sz[next]*2>sz[root]) return find_cen(next,now);
    }
    return now;
}

int dfs2(int now,int prev,int sum,int depth,int maxans=1987654321)
{
    if(depth>=maxans) return 1987654321;
    int ret = 1987654321;
    if(sum>K) return 1987654321;
    if(check[K-sum]!=1987654321) ret= min(ret,depth + check[K-sum]);
    lazy.push_back(pii(sum,depth));
    for(int i=0;i<adj[now].size();i++)
    {
        int next = adj[now][i].first;
        int cost = adj[now][i].second;
        if(next == prev) continue;
        if(del[next]) continue;
        ret = min(ret,dfs2(next,now,sum+cost,depth+1,ret));
        if(sum==0)
        {
            for(pii it:lazy) check[it.first] = min(check[it.first],it.second),usecheck.push_back(it.first);
            lazy.clear();
        }
    }
    return ret;
}

void g(int now,int prev)
{
    dfs1(now,-1);
    int cen = find_cen(now,-1,now);
    for(int it:usecheck) check[it] = 1987654321;
    usecheck.clear();
    check[0] = 0;
    ans = min(ans,dfs2(cen,-1,0,0));
    del[cen] = true;
    for(int i=0;i<adj[cen].size();i++)
    {
        int next = adj[cen][i].first;
        int cost = adj[cen][i].second;
        if(del[next]) continue;
        g(next,now);
    }
}

int best_path(int n, int k, int h[][2], int l[])
{
    fill(check,check+1000003,1987654321);
    N= n ; K = k;
    for(int i=0;i<n-1;i++)
    {
        adj[h[i][0]].push_back(pii(h[i][1],l[i]));
        adj[h[i][1]].push_back(pii(h[i][0],l[i]));
    }
    g(1,-1);
    return (ans>=1987654300)?-1:ans;
}

Compilation message

race.cpp: In function 'int dfs1(int, int)':
race.cpp:17:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<adj[now].size();i++)
                 ~^~~~~~~~~~~~~~~~
race.cpp:20:13: warning: unused variable 'cost' [-Wunused-variable]
         int cost = adj[now][i].second;
             ^~~~
race.cpp: In function 'int find_cen(int, int, int)':
race.cpp:30:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<adj[now].size();i++)
                 ~^~~~~~~~~~~~~~~~
race.cpp:36:57: error: too few arguments to function 'int find_cen(int, int, int)'
         if(sz[next]*2>sz[root]) return find_cen(next,now);
                                                         ^
race.cpp:28:5: note: declared here
 int find_cen(int now,int prev,int root)
     ^~~~~~~~
race.cpp:33:13: warning: unused variable 'cost' [-Wunused-variable]
         int cost = adj[now][i].second;
             ^~~~
race.cpp: In function 'int dfs2(int, int, int, int, int)':
race.cpp:48:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<adj[now].size();i++)
                 ~^~~~~~~~~~~~~~~~
race.cpp: In function 'void g(int, int)':
race.cpp:73:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<adj[cen].size();i++)
                 ~^~~~~~~~~~~~~~~~
race.cpp:76:13: warning: unused variable 'cost' [-Wunused-variable]
         int cost = adj[cen][i].second;
             ^~~~