제출 #16674

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
16674		suhgyuho_william	경주 (Race) (IOI11_race)	C++98	0 / 100	6 ms	4984 KiB

race

#include "race.h"
#include <vector>
#include <algorithm>
using namespace std;
// frozen

int i,n,k;
int answer = 999999999;
vector<pair<int,int> > edge[200002];
bool check[200002];
int half_sum[1000002];
int sum1,sum2;

int find_middle(int x){
    return x;
}

void dfs(int v,long long sum,int cnt){
    int i,sizes;
    int nextv,cost;

    if(sum > k) return;
    check[v] = true;
    if(half_sum[sum] > cnt) half_sum[sum] = cnt;
    if(k%2 == 0 && sum == k/2){
        if(sum1 == -1){
            sum1 = cnt;
        }else if(sum2 == -1){
            sum2 = cnt;
            if(sum1 > sum2) swap(sum1,sum2);
        }else if(!(sum1 < cnt && sum2 < cnt)){
            sum2 = cnt;
            if(sum1 > sum2) swap(sum1,sum2);
        }
    }
    sizes = edge[v].size();
    for(i=0; i<sizes; i++){
        nextv = edge[v][i].first;
        cost = edge[v][i].second;
        if(check[nextv]) continue;
        dfs(nextv,sum+cost,cnt+1);
    }
    check[v] = false;
}

void get(int v){
    int i;

    for(i=0; i<=k; i++) half_sum[i] = 999999999;
    dfs(v,0,0);
}

void race(int x){
    int i,sizes;
    int nextv,t;
    int v = find_middle(x);

    if(k%2 == 0) sum1 = sum2 = -1;
    get(v);
    if(k%2 ==1) t = k/2;
    else t = (k/2)-1;
    for(i=0; i<=t; i++) if(half_sum[i] != 999999999 && half_sum[k-i] != 999999999 && answer > half_sum[i]+half_sum[k-i]) answer = half_sum[i]+half_sum[k-i];
    if(k%2 == 0 && sum1 != -1 && sum2 != -1 && answer > sum1+sum2) answer = sum1+sum2;


    check[v] = true;
    sizes = edge[v].size();
    for(i=0; i<sizes; i++){
        nextv = edge[v][i].first;
        if(!check[nextv]) race(nextv);
    }
}

int best_path(int N, int K, int H[][2], int L[])
{
    int i;

    n = N; k = K;
    for(i=0; i<n-1; i++){
        edge[H[i][0]].push_back(make_pair(H[i][1],L[i]));
        edge[H[i][1]].push_back(make_pair(H[i][0],L[i]));
    }

    race(0);

    if(answer == 999999999) answer = -1;
    return answer;
}

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