답안 #76075 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
76075	2018-09-12T03:27:10 Z	luciocf	경주 (Race) (IOI11_race)	C++14	100 / 100	1731 ms	143980 KB

race

// IOI 2011 - Race
// Lúcio Cardoso

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e5+10;
const int MAXD = 1e6+10;
const int MAXL = 20;

typedef pair<int, int> pii;

int n, k, size[MAXN], ans;
set<int> S[MAXD];
bool mark[MAXN];
vector<pii> grafo[MAXN];

int DFS(int u, int p)
{
    size[u] = 1;
    for (int i = 0; i < (int) grafo[u].size(); i++)
    {
        int v = grafo[u][i].first;
        if (v == p || mark[v]) continue;

        size[u] += DFS(v, u);
    }
    return size[u];
}

int centroid(int u, int x, int p)
{
    for (int i = 0; i < (int) grafo[u].size(); i++)
    {
        int v = grafo[u][i].first;
        if (v == p || mark[v]) continue;

        if (size[v] > x/2) return centroid(v, x, u);
    }
    return u;
}

void upd(int u, int p, int d, int deep, int ok)
{
    if (d > k) return;

    if (ok) S[d].insert(deep);
    else S[d].erase(deep);

    for (int i = 0; i < (int) grafo[u].size(); i++)
    {
        int v = grafo[u][i].first;
        if (v == p || mark[v]) continue;

        upd(v, u, d+grafo[u][i].second, deep+1, ok);
    }
}

int get(int u, int p, int d, int deep)
{
    if (d > k) return 1e9;

    int aux = 1e9;
    if (S[k-d].size() > 0)
    {
        set<int>::iterator it = S[k-d].begin();
        aux = deep+*it;
    }

    for (int i = 0; i < (int) grafo[u].size(); i++)
    {
        int v = grafo[u][i].first;
        if (v == p || mark[v]) continue;

        aux = min(aux, get(v, u, d+grafo[u][i].second, deep+1));
    }
    return aux;
}

void decompose(int u)
{
    DFS(u, 0);

    int c = centroid(u, size[u], 0);
    mark[c] = 1;

    upd(c, 0, 0, 0, 1);

    int aux = 1e9;

    for (int i = 0; i < (int) grafo[c].size(); i++)
    {
        int v = grafo[c][i].first;
        if (mark[v]) continue;

        upd(v, c, grafo[c][i].second, 1, 0);
        aux = min(aux, get(v, c, grafo[c][i].second, 1));
        upd(v, c, grafo[c][i].second, 1, 1);
    }

    ans = min(ans, aux);

    upd(c, 0, 0, 0, 0);

    for (int i = 0; i < (int) grafo[c].size(); i++)
    {
        int v = grafo[c][i].first;
        if (!mark[v]) decompose(v);
    }
}

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 a = H[i][0]+1, b = H[i][1]+1, c = L[i];
        grafo[a].push_back(make_pair(b, c));
        grafo[b].push_back(make_pair(a, c));
    }

    ans = 1e9;
    decompose(1);
    return (ans==1e9)?(-1):ans;
}

Subtask #1
9.0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	46 ms	52216 KB	Output is correct
2	Correct	47 ms	52216 KB	Output is correct
3	Correct	47 ms	52216 KB	Output is correct
4	Correct	47 ms	52220 KB	Output is correct
5	Correct	46 ms	52352 KB	Output is correct
6	Correct	46 ms	52544 KB	Output is correct
7	Correct	46 ms	52544 KB	Output is correct
8	Correct	47 ms	52544 KB	Output is correct
9	Correct	47 ms	52544 KB	Output is correct
10	Correct	46 ms	52544 KB	Output is correct
11	Correct	47 ms	52544 KB	Output is correct
12	Correct	46 ms	52544 KB	Output is correct
13	Correct	47 ms	52544 KB	Output is correct
14	Correct	47 ms	52544 KB	Output is correct
15	Correct	47 ms	52544 KB	Output is correct
16	Correct	46 ms	52544 KB	Output is correct
17	Correct	49 ms	52544 KB	Output is correct
18	Correct	46 ms	52640 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	46 ms	52216 KB	Output is correct
2	Correct	47 ms	52216 KB	Output is correct
3	Correct	47 ms	52216 KB	Output is correct
4	Correct	47 ms	52220 KB	Output is correct
5	Correct	46 ms	52352 KB	Output is correct
6	Correct	46 ms	52544 KB	Output is correct
7	Correct	46 ms	52544 KB	Output is correct
8	Correct	47 ms	52544 KB	Output is correct
9	Correct	47 ms	52544 KB	Output is correct
10	Correct	46 ms	52544 KB	Output is correct
11	Correct	47 ms	52544 KB	Output is correct
12	Correct	46 ms	52544 KB	Output is correct
13	Correct	47 ms	52544 KB	Output is correct
14	Correct	47 ms	52544 KB	Output is correct
15	Correct	47 ms	52544 KB	Output is correct
16	Correct	46 ms	52544 KB	Output is correct
17	Correct	49 ms	52544 KB	Output is correct
18	Correct	46 ms	52640 KB	Output is correct
19	Correct	46 ms	52640 KB	Output is correct
20	Correct	46 ms	52640 KB	Output is correct
21	Correct	48 ms	52644 KB	Output is correct
22	Correct	53 ms	52852 KB	Output is correct
23	Correct	50 ms	52852 KB	Output is correct
24	Correct	49 ms	52852 KB	Output is correct
25	Correct	51 ms	52852 KB	Output is correct
26	Correct	47 ms	52852 KB	Output is correct
27	Correct	48 ms	52852 KB	Output is correct
28	Correct	50 ms	52852 KB	Output is correct
29	Correct	51 ms	52852 KB	Output is correct
30	Correct	49 ms	52856 KB	Output is correct
31	Correct	50 ms	52868 KB	Output is correct
32	Correct	71 ms	52884 KB	Output is correct
33	Correct	50 ms	52900 KB	Output is correct
34	Correct	48 ms	52916 KB	Output is correct
35	Correct	49 ms	52932 KB	Output is correct
36	Correct	50 ms	53072 KB	Output is correct
37	Correct	50 ms	53072 KB	Output is correct
38	Correct	49 ms	53072 KB	Output is correct

Subtask #3
22.0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	46 ms	52216 KB	Output is correct
2	Correct	47 ms	52216 KB	Output is correct
3	Correct	47 ms	52216 KB	Output is correct
4	Correct	47 ms	52220 KB	Output is correct
5	Correct	46 ms	52352 KB	Output is correct
6	Correct	46 ms	52544 KB	Output is correct
7	Correct	46 ms	52544 KB	Output is correct
8	Correct	47 ms	52544 KB	Output is correct
9	Correct	47 ms	52544 KB	Output is correct
10	Correct	46 ms	52544 KB	Output is correct
11	Correct	47 ms	52544 KB	Output is correct
12	Correct	46 ms	52544 KB	Output is correct
13	Correct	47 ms	52544 KB	Output is correct
14	Correct	47 ms	52544 KB	Output is correct
15	Correct	47 ms	52544 KB	Output is correct
16	Correct	46 ms	52544 KB	Output is correct
17	Correct	49 ms	52544 KB	Output is correct
18	Correct	46 ms	52640 KB	Output is correct
19	Correct	401 ms	59656 KB	Output is correct
20	Correct	406 ms	61080 KB	Output is correct
21	Correct	448 ms	62340 KB	Output is correct
22	Correct	407 ms	63716 KB	Output is correct
23	Correct	195 ms	65332 KB	Output is correct
24	Correct	182 ms	66788 KB	Output is correct
25	Correct	544 ms	70000 KB	Output is correct
26	Correct	595 ms	78148 KB	Output is correct
27	Correct	366 ms	78148 KB	Output is correct
28	Correct	452 ms	88800 KB	Output is correct
29	Correct	461 ms	91376 KB	Output is correct
30	Correct	392 ms	91376 KB	Output is correct
31	Correct	375 ms	91376 KB	Output is correct
32	Correct	391 ms	92892 KB	Output is correct
33	Correct	568 ms	94564 KB	Output is correct
34	Correct	347 ms	98296 KB	Output is correct

Subtask #4
57.0 / 57.0

#	결과	실행 시간	메모리	Grader output
1	Correct	46 ms	52216 KB	Output is correct
2	Correct	47 ms	52216 KB	Output is correct
3	Correct	47 ms	52216 KB	Output is correct
4	Correct	47 ms	52220 KB	Output is correct
5	Correct	46 ms	52352 KB	Output is correct
6	Correct	46 ms	52544 KB	Output is correct
7	Correct	46 ms	52544 KB	Output is correct
8	Correct	47 ms	52544 KB	Output is correct
9	Correct	47 ms	52544 KB	Output is correct
10	Correct	46 ms	52544 KB	Output is correct
11	Correct	47 ms	52544 KB	Output is correct
12	Correct	46 ms	52544 KB	Output is correct
13	Correct	47 ms	52544 KB	Output is correct
14	Correct	47 ms	52544 KB	Output is correct
15	Correct	47 ms	52544 KB	Output is correct
16	Correct	46 ms	52544 KB	Output is correct
17	Correct	49 ms	52544 KB	Output is correct
18	Correct	46 ms	52640 KB	Output is correct
19	Correct	46 ms	52640 KB	Output is correct
20	Correct	46 ms	52640 KB	Output is correct
21	Correct	48 ms	52644 KB	Output is correct
22	Correct	53 ms	52852 KB	Output is correct
23	Correct	50 ms	52852 KB	Output is correct
24	Correct	49 ms	52852 KB	Output is correct
25	Correct	51 ms	52852 KB	Output is correct
26	Correct	47 ms	52852 KB	Output is correct
27	Correct	48 ms	52852 KB	Output is correct
28	Correct	50 ms	52852 KB	Output is correct
29	Correct	51 ms	52852 KB	Output is correct
30	Correct	49 ms	52856 KB	Output is correct
31	Correct	50 ms	52868 KB	Output is correct
32	Correct	71 ms	52884 KB	Output is correct
33	Correct	50 ms	52900 KB	Output is correct
34	Correct	48 ms	52916 KB	Output is correct
35	Correct	49 ms	52932 KB	Output is correct
36	Correct	50 ms	53072 KB	Output is correct
37	Correct	50 ms	53072 KB	Output is correct
38	Correct	49 ms	53072 KB	Output is correct
39	Correct	401 ms	59656 KB	Output is correct
40	Correct	406 ms	61080 KB	Output is correct
41	Correct	448 ms	62340 KB	Output is correct
42	Correct	407 ms	63716 KB	Output is correct
43	Correct	195 ms	65332 KB	Output is correct
44	Correct	182 ms	66788 KB	Output is correct
45	Correct	544 ms	70000 KB	Output is correct
46	Correct	595 ms	78148 KB	Output is correct
47	Correct	366 ms	78148 KB	Output is correct
48	Correct	452 ms	88800 KB	Output is correct
49	Correct	461 ms	91376 KB	Output is correct
50	Correct	392 ms	91376 KB	Output is correct
51	Correct	375 ms	91376 KB	Output is correct
52	Correct	391 ms	92892 KB	Output is correct
53	Correct	568 ms	94564 KB	Output is correct
54	Correct	347 ms	98296 KB	Output is correct
55	Correct	72 ms	98296 KB	Output is correct
56	Correct	76 ms	98296 KB	Output is correct
57	Correct	308 ms	98296 KB	Output is correct
58	Correct	109 ms	98296 KB	Output is correct
59	Correct	451 ms	106812 KB	Output is correct
60	Correct	1637 ms	123656 KB	Output is correct
61	Correct	435 ms	123656 KB	Output is correct
62	Correct	609 ms	123656 KB	Output is correct
63	Correct	730 ms	123656 KB	Output is correct
64	Correct	1731 ms	127520 KB	Output is correct
65	Correct	343 ms	127520 KB	Output is correct
66	Correct	1265 ms	132344 KB	Output is correct
67	Correct	268 ms	132344 KB	Output is correct
68	Correct	779 ms	137464 KB	Output is correct
69	Correct	751 ms	141132 KB	Output is correct
70	Correct	683 ms	143980 KB	Output is correct

답안 #76075

Compilation message

Subtask #1 9.0 / 9.0

Subtask #2 12.0 / 12.0

Subtask #3 22.0 / 22.0

Subtask #4 57.0 / 57.0

Subtask #1
9.0 / 9.0

Subtask #2
12.0 / 12.0

Subtask #3
22.0 / 22.0

Subtask #4
57.0 / 57.0