Submission #394483

#	Time	Username	Problem	Language	Result	Execution time	Memory
394483		teehandsome	Race (IOI11_race)	C++11	9 / 100	1577 ms	9960 KiB

race

#include "race.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define endl '\n'
#define INF 1e9+7
#define all(x) x.begin(),x.end()
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using pii=pair<int,int>;
using ppi=pair<int,pii>;
using oset=tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>;

template<typename T>
void _print(vector<T> x) {cerr<<"{"; for(auto e:x) cerr<<e<<","; cerr<<"}";}
void _print(pii x) {cerr<<"{"<<x.first<<","<<x.second<<"}";}
template<typename T>
void _print(T x) {cerr<<x;}

void dbg() {cerr<<endl;}
template<typename Head,typename... Tail>
void dbg(Head H,Tail... T) {
    _print(H);
    if(sizeof...(T)) cerr<<",";
    else cerr<<"\"]";
    dbg(T...);
}
#define debug(...) cerr<<"["<<#__VA_ARGS__<<"]:[\"",dbg(__VA_ARGS__)

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mxn=2e5+10;
int n,k;
vector<pii> adj[mxn];
int dp[mxn];

int solve(int u,int p,bool apart,int sum) {
    //apart=true if has already apart path
    if(!sum) return 0;
    if(sum<0) return -1;
    int ans=INF;
    for(auto vw:adj[u]) {
        int v=vw.first, w=vw.second;
        if(v==p) continue;
        int temp=solve(v,u,true,sum-w);
        if(temp!=-1) ans=min(ans,1+temp);
        int temp2=-1;
        if(!apart) temp2=solve(v,u,apart,sum);
        if(temp2!=-1) ans=min(ans,temp2);
    }
    if(!apart) {
        int cnt=0;
        vector<pii> path[sum];
        for(auto vw:adj[u]) {
            int v=vw.first,w=vw.second;
            if(v==p) continue;

            for(int i=1;i<=sum-i;i++) {
                int temp=solve(v,u,true,sum-w-i);
                if(temp!=-1) {
                    path[i].push_back({temp,cnt});
                }
            }
            for(int i=1;i<sum;i++) sort(all(path[i]));
            cnt++;
        }
        for(int i=1;i<sum;i++) {
            if(path[i].empty() or path[sum-i].empty()) continue;
            if(path[i][0].second==path[sum-i][0].second) {
                int tempp=INF;
                if(path[i].size()>1) {
                    tempp=min(tempp,path[i][1].first+path[sum-i][0].first);
                }
                if(path[sum-i].size()>1) {
                    tempp=min(tempp,path[i][0].first+path[sum-i][1].first);
                }
                if(tempp!=INF) ans=min(ans,tempp+2);
            }
            else {
                ans=min(ans,2+path[i][0].first+path[sum-i][0].first);
            }
        }
    }
    if(ans==INF) return -1;
    return ans;
}

int best_path(int N, int K, int H[][2], int L[])
{
    n=N,k=K;
    for(int i=0;i<n-1;i++) {
        int u=H[i][0],v=H[i][1],w=L[i];
        adj[u].push_back({v,w});
        adj[v].push_back({u,w});
    }
    return solve(0,0,false,k);
}

• Subtask 1: 9 / 9
• Subtask 2: 0 / 12
• Subtask 3: 0 / 22
• Subtask 4: 0 / 57