oj.uz

답안 #109677

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
109677 2019-05-07T11:18:05 Z someone_aa 경주 (Race) (IOI11_race) C++17
100 / 100
 1138 ms 34948 KB 
#include <bits/stdc++.h>
#include "race.h"
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int maxn = 200100;
const int maxk = 1100000;

vector<pair<int,int> > g[maxn];
bool deleted[maxn];
int sbtsum[maxn], parent[maxn];
int n, k;

class path {
public:
    int node, sum, cnt;
};

vector<path> curr_paths;
void find_paths(int node, int p, int sum, int cnt) {
    curr_paths.pb({node, sum, cnt});
    for(auto i:g[node]) {
        if(deleted[i.first] || i.first == p) continue;
        find_paths(i.first, node, sum+i.second, cnt+1);
    }
}

int min_cnt[maxk];
int result;

void solve(int node) {
    //memset(min_cnt,0,sizeof(min_cnt));
    for(auto i:g[node]) {
        if(deleted[i.first]) continue;
        curr_paths.clear();
        find_paths(i.first, -1, 0, 0);

        for(auto j:curr_paths) {
            int curr = j.sum + i.second;

            if(curr > k) continue;
            else if(curr == k) result = min(result, j.cnt+1);
            else {
                int diff = k - curr;
                if(min_cnt[diff] != 0) result = min(result, min_cnt[diff] + j.cnt + 1);
            }
        }

        for(auto j:curr_paths) {
            int curr = j.sum + i.second;

            if(curr > k) continue;

            int newval = j.cnt + 1;
            if(min_cnt[curr] == 0) min_cnt[curr] = newval;
            else min_cnt[curr] = min(min_cnt[curr], newval);
        }
    }

    for(auto i:g[node]) {
        if(deleted[i.first]) continue;
        curr_paths.clear();
        find_paths(i.first, -1, 0, 0);

        for(auto j:curr_paths) {
            int curr = j.sum + i.second;

            if(curr > k) continue;
            min_cnt[curr] = 0;
        }
    }
}

void dfs0(int node, int p) {
    sbtsum[node] = 1;
    parent[node] = p;
    for(auto i:g[node]) {
        if(deleted[i.first] || i.first == p) continue;
        dfs0(i.first, node);
        sbtsum[node] += sbtsum[i.first];
    }
}

void decompose(int node) {
    dfs0(node, -1);

    int best_size = sbtsum[node];
    int centroid = node;

    queue<int>q;
    q.push(node);

    while(!q.empty()) {
        int curr = q.front();
        q.pop();

        int curr_size = sbtsum[node] - sbtsum[curr];
        for(auto i:g[curr]) {
            if(deleted[i.first] || parent[i.first] != curr) continue;
            curr_size = max(curr_size, sbtsum[i.first]);
            q.push(i.first);
        }

        if(curr_size < best_size) {
            best_size = curr_size;
            centroid = curr;
        }
    }

    deleted[centroid] = true;
    solve(centroid);
    for(auto i:g[centroid]) {
        if(deleted[i.first]) continue;
        decompose(i.first);
    }
}

int best_path(int N, int K, int H[][2], int L[]) {
    n = N; k = K;
    result = INT_MAX;
    for(int i=0;i<N-1;i++) {
        int a = H[i][0];
        int b = H[i][1];
        int c = L[i];

        g[a].pb(mp(b, c));
        g[b].pb(mp(a, c));
    }

    decompose(0);
    if(result == INT_MAX) return -1;
    return result;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5092 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 8 ms 5120 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 8 ms 5120 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 6 ms 5120 KB Output is correct
11 Correct 7 ms 4992 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 6 ms 4992 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 7 ms 5120 KB Output is correct
16 Correct 7 ms 4992 KB Output is correct
17 Correct 7 ms 4992 KB Output is correct
18 Correct 6 ms 4992 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5092 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 8 ms 5120 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 8 ms 5120 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 6 ms 5120 KB Output is correct
11 Correct 7 ms 4992 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 6 ms 4992 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 7 ms 5120 KB Output is correct
16 Correct 7 ms 4992 KB Output is correct
17 Correct 7 ms 4992 KB Output is correct
18 Correct 6 ms 4992 KB Output is correct
19 Correct 6 ms 4992 KB Output is correct
20 Correct 8 ms 5072 KB Output is correct
21 Correct 7 ms 5120 KB Output is correct
22 Correct 10 ms 7552 KB Output is correct
23 Correct 11 ms 7296 KB Output is correct
24 Correct 11 ms 8064 KB Output is correct
25 Correct 9 ms 6912 KB Output is correct
26 Correct 11 ms 6528 KB Output is correct
27 Correct 7 ms 5120 KB Output is correct
28 Correct 8 ms 6016 KB Output is correct
29 Correct 9 ms 6476 KB Output is correct
30 Correct 12 ms 6528 KB Output is correct
31 Correct 9 ms 6912 KB Output is correct
32 Correct 10 ms 7040 KB Output is correct
33 Correct 10 ms 7808 KB Output is correct
34 Correct 9 ms 7424 KB Output is correct
35 Correct 10 ms 8064 KB Output is correct
36 Correct 10 ms 8320 KB Output is correct
37 Correct 9 ms 7040 KB Output is correct
38 Correct 8 ms 6272 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5092 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 8 ms 5120 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 8 ms 5120 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 6 ms 5120 KB Output is correct
11 Correct 7 ms 4992 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 6 ms 4992 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 7 ms 5120 KB Output is correct
16 Correct 7 ms 4992 KB Output is correct
17 Correct 7 ms 4992 KB Output is correct
18 Correct 6 ms 4992 KB Output is correct
19 Correct 238 ms 11660 KB Output is correct
20 Correct 280 ms 11648 KB Output is correct
21 Correct 253 ms 11660 KB Output is correct
22 Correct 315 ms 11708 KB Output is correct
23 Correct 239 ms 11940 KB Output is correct
24 Correct 129 ms 11512 KB Output is correct
25 Correct 380 ms 16500 KB Output is correct
26 Correct 186 ms 18424 KB Output is correct
27 Correct 379 ms 19300 KB Output is correct
28 Correct 1051 ms 31344 KB Output is correct
29 Correct 1087 ms 30576 KB Output is correct
30 Correct 353 ms 18748 KB Output is correct
31 Correct 373 ms 18680 KB Output is correct
32 Correct 483 ms 18796 KB Output is correct
33 Correct 766 ms 19052 KB Output is correct
34 Correct 723 ms 19056 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5092 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 7 ms 5120 KB Output is correct
4 Correct 7 ms 5120 KB Output is correct
5 Correct 6 ms 4992 KB Output is correct
6 Correct 8 ms 5120 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 8 ms 5120 KB Output is correct
9 Correct 6 ms 4992 KB Output is correct
10 Correct 6 ms 5120 KB Output is correct
11 Correct 7 ms 4992 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 6 ms 4992 KB Output is correct
14 Correct 7 ms 5120 KB Output is correct
15 Correct 7 ms 5120 KB Output is correct
16 Correct 7 ms 4992 KB Output is correct
17 Correct 7 ms 4992 KB Output is correct
18 Correct 6 ms 4992 KB Output is correct
19 Correct 6 ms 4992 KB Output is correct
20 Correct 8 ms 5072 KB Output is correct
21 Correct 7 ms 5120 KB Output is correct
22 Correct 10 ms 7552 KB Output is correct
23 Correct 11 ms 7296 KB Output is correct
24 Correct 11 ms 8064 KB Output is correct
25 Correct 9 ms 6912 KB Output is correct
26 Correct 11 ms 6528 KB Output is correct
27 Correct 7 ms 5120 KB Output is correct
28 Correct 8 ms 6016 KB Output is correct
29 Correct 9 ms 6476 KB Output is correct
30 Correct 12 ms 6528 KB Output is correct
31 Correct 9 ms 6912 KB Output is correct
32 Correct 10 ms 7040 KB Output is correct
33 Correct 10 ms 7808 KB Output is correct
34 Correct 9 ms 7424 KB Output is correct
35 Correct 10 ms 8064 KB Output is correct
36 Correct 10 ms 8320 KB Output is correct
37 Correct 9 ms 7040 KB Output is correct
38 Correct 8 ms 6272 KB Output is correct
39 Correct 238 ms 11660 KB Output is correct
40 Correct 280 ms 11648 KB Output is correct
41 Correct 253 ms 11660 KB Output is correct
42 Correct 315 ms 11708 KB Output is correct
43 Correct 239 ms 11940 KB Output is correct
44 Correct 129 ms 11512 KB Output is correct
45 Correct 380 ms 16500 KB Output is correct
46 Correct 186 ms 18424 KB Output is correct
47 Correct 379 ms 19300 KB Output is correct
48 Correct 1051 ms 31344 KB Output is correct
49 Correct 1087 ms 30576 KB Output is correct
50 Correct 353 ms 18748 KB Output is correct
51 Correct 373 ms 18680 KB Output is correct
52 Correct 483 ms 18796 KB Output is correct
53 Correct 766 ms 19052 KB Output is correct
54 Correct 723 ms 19056 KB Output is correct
55 Correct 20 ms 6016 KB Output is correct
56 Correct 21 ms 5888 KB Output is correct
57 Correct 147 ms 13108 KB Output is correct
58 Correct 69 ms 12524 KB Output is correct
59 Correct 155 ms 18928 KB Output is correct
60 Correct 1090 ms 33128 KB Output is correct
61 Correct 314 ms 19836 KB Output is correct
62 Correct 323 ms 19840 KB Output is correct
63 Correct 450 ms 19768 KB Output is correct
64 Correct 984 ms 22276 KB Output is correct
65 Correct 717 ms 22240 KB Output is correct
66 Correct 1138 ms 34948 KB Output is correct
67 Correct 280 ms 21348 KB Output is correct
68 Correct 559 ms 24428 KB Output is correct
69 Correct 507 ms 24816 KB Output is correct
70 Correct 462 ms 23760 KB Output is correct