Submission #16678

#	Time	Username	Problem	Language	Result	Execution time	Memory
16678		suhgyuho_william	경주 (Race) (IOI11_race)	C++98	21 / 100	3063 ms	23932 KiB

race

#include "race.h"
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
// 문제 : frozen 과 비슷

int i,n,k;
int answer = 999999999;
vector<pair<int,int> > edge[200002];
queue<pair<int,int> > q;
int root[1000002],small[1000002];
bool check[200002],checkv[200002];
vector<int> down[200002];
queue<int> qv;
int up[200002],downcnt[200002];

void make_down(int v){
    int i,sizes,nextv;

    qv.push(v);
    checkv[v] = true;
    while(!qv.empty()){
        v = qv.front();
        qv.pop();
        sizes = edge[v].size();

        for(i=0; i<sizes; i++){
            nextv = edge[v][i].first;
            if(!checkv[nextv]){
                checkv[nextv] = true;
                qv.push(nextv);
                down[v].push_back(nextv);
                up[nextv] = v;
            }
        }
    }
}

int find_sum(int x){
    int i,sum = 1;
    int sizes,nextv;

    sizes = down[x].size();
    for(i=0; i<sizes; i++){
        nextv = down[x][i];
        sum += find_sum(nextv);
    }
    downcnt[x] = (sum-1);
    return sum;
}

void clear_down(){
    int i;

    for(i=0; i<n; i++){
        while(!down[i].empty()){
            down[i].pop_back();
        }
        checkv[i] = false;
    }
}

int find_middle(int x){
    int i,sizes,nextv;
    int v,cnt;
    int sum;

    while(1){
        sizes = down[x].size();
        sum = cnt = 0;
        for(i=0; i<sizes; i++){
            nextv = down[x][i];
            if(check[nextv]) continue;
            sum += (downcnt[nextv]+1);
            if(cnt < (downcnt[nextv]+1)){
                cnt = downcnt[nextv]+1;
                v = nextv;
            }
        }

        if(cnt <= (sum+1)/2) break;
        downcnt[x] = sum - (downcnt[v]+1);
        down[v].push_back(x);
        x = v;
    }

    //clear_down();
    return x;
}

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

    if(sum > k) return;
    check[v] = true;
    q.push(make_pair(sum,cnt));

    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 race(int x){
    int i,sizes;
    int nextv;
    int tsum,tcnt;
    int v = find_middle(x);

    check[v] = true;
    sizes = edge[v].size();

    root[0] = v;
    small[0] = 0;
    for(i=0; i<sizes; i++){
        nextv = edge[v][i].first;
        if(check[nextv]) continue;
        dfs(nextv,edge[v][i].second,1);

        while(!q.empty()){
            tsum = q.front().first;
            tcnt = q.front().second;
            q.pop();

            if(root[k-tsum] == v && answer > small[k-tsum] + tcnt) answer = small[k-tsum] + tcnt;
        }
        dfs(nextv,edge[v][i].second,1);
        while(!q.empty()){
            tsum = q.front().first;
            tcnt = q.front().second;
            q.pop();

            if(root[tsum] != v){
                root[tsum] = v;
                small[tsum] = tcnt;
            }else if(small[tsum] > tcnt) small[tsum] = tcnt;
        }
    }

    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]));
    }
    for(i=0; i<=k; i++) root[i] = -1;

    make_down(0);
    find_sum(0);
    race(0);

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

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