oj.uz

Submission #34568

# Submission time Handle Problem Language Result Execution time Memory
34568 2017-11-12T16:17:27 Z top34051 Race (IOI11_race) C++14
43 / 100
 3000 ms 150976 KB 
#include "race.h"
#include<bits/stdc++.h>
using namespace std;

#define pii pair<int,int>
#define X first
#define Y second
const int maxn = 200005;
const int inf = 1e6;

int n,k,ans;
int cur, h[maxn], sz[maxn], st[maxn], ft[maxn], p[maxn];
long long sum[maxn];
vector<int> go[maxn];
vector<pii> edge[maxn];
map<long long,multiset<int>> s;

void dfs(int u,int last) {
    st[u] = ++cur; p[cur] = u;
    sz[u] = 1; h[u] = h[last]+1;
    for(auto t : edge[u]) {
        int v = t.X, val = t.Y;
        if(v!=last) {
            sum[v] = sum[u] + val;
            dfs(v,u);
            sz[u] += sz[v];
        }
    }
    ft[u] = cur;
//    printf("%d : [%d, %d]   h = %d   sz = %d   sum = %lld\n",u,st[u],ft[u],h[u],sz[u],sum[u]);
}

void add(long long x,int val) {
//    printf("\tadd %lld : %d",x,val);
    s[x].insert(val);
//    printf(".\n");
}

void del(long long x,int val) {
//    printf("\tdel %lld : %d",x,val);
    s[x].erase(s[x].find(val));
//    printf(".\n");
}

int get(long long x) {
//    printf("\tget %lld : %d\n",x,(s[x].empty()) ? inf : *(s[x].begin()));
    if(s[x].empty()) return inf;
    return *(s[x].begin());
}

void solve(int u,int last,int keep) {
    int mx = 0, big = -1;
    for(auto v : go[u]) if(v!=last && sz[v]>mx) mx = sz[v], big = v;
    for(auto v : go[u]) if(v!=last && v!=big) solve(v,u,0);
    if(big!=-1) solve(big,u,1);
    //solve
//    printf("solve %d\n",u);
    add(sum[u],h[u]);
    ans = min(ans,get(k+sum[u])-h[u]);
    for(auto v : go[u]) {
        if(v!=last && v!=big) {
            for(int i=st[v];i<=ft[v];i++) {
//                printf("\ttry %d : (%lld) : want %lld\n",p[i],sum[p[i]],k-sum[p[i]]+2*sum[u]);
                ans = min(ans,get(k-sum[p[i]]+2*sum[u])+h[p[i]]-2*h[u]);
            }
            for(int i=st[v];i<=ft[v];i++) add(sum[p[i]],h[p[i]]);
        }
    }
    //delete
    if(keep) return ;
//    printf("   delete!\n");
    for(int i=st[u];i<=ft[u];i++) del(sum[p[i]],h[p[i]]);
}

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 x = H[i][0]+1, y = H[i][1]+1, val = L[i];
        edge[x].push_back({y,val}); edge[y].push_back({x,val});
        go[x].push_back(y); go[y].push_back(x);
    }
    dfs(1,0);
    ans = inf;
    solve(1,0,0);
    if(ans>n) return -1;
    return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9848 KB Output is correct
2 Correct 9 ms 9960 KB Output is correct
3 Correct 9 ms 9960 KB Output is correct
4 Correct 9 ms 10016 KB Output is correct
5 Correct 9 ms 10016 KB Output is correct
6 Correct 9 ms 10016 KB Output is correct
7 Correct 9 ms 10016 KB Output is correct
8 Correct 9 ms 10016 KB Output is correct
9 Correct 9 ms 10040 KB Output is correct
10 Correct 10 ms 10040 KB Output is correct
11 Correct 10 ms 10040 KB Output is correct
12 Correct 9 ms 10040 KB Output is correct
13 Correct 9 ms 10040 KB Output is correct
14 Correct 9 ms 10040 KB Output is correct
15 Correct 9 ms 10040 KB Output is correct
16 Correct 9 ms 10040 KB Output is correct
17 Correct 9 ms 10040 KB Output is correct
18 Correct 9 ms 10040 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9848 KB Output is correct
2 Correct 9 ms 9960 KB Output is correct
3 Correct 9 ms 9960 KB Output is correct
4 Correct 9 ms 10016 KB Output is correct
5 Correct 9 ms 10016 KB Output is correct
6 Correct 9 ms 10016 KB Output is correct
7 Correct 9 ms 10016 KB Output is correct
8 Correct 9 ms 10016 KB Output is correct
9 Correct 9 ms 10040 KB Output is correct
10 Correct 10 ms 10040 KB Output is correct
11 Correct 10 ms 10040 KB Output is correct
12 Correct 9 ms 10040 KB Output is correct
13 Correct 9 ms 10040 KB Output is correct
14 Correct 9 ms 10040 KB Output is correct
15 Correct 9 ms 10040 KB Output is correct
16 Correct 9 ms 10040 KB Output is correct
17 Correct 9 ms 10040 KB Output is correct
18 Correct 9 ms 10040 KB Output is correct
19 Correct 8 ms 10040 KB Output is correct
20 Correct 9 ms 10040 KB Output is correct
21 Correct 12 ms 10192 KB Output is correct
22 Correct 12 ms 10620 KB Output is correct
23 Correct 12 ms 10620 KB Output is correct
24 Correct 12 ms 10620 KB Output is correct
25 Correct 12 ms 10620 KB Output is correct
26 Correct 12 ms 10620 KB Output is correct
27 Correct 11 ms 10620 KB Output is correct
28 Correct 13 ms 10620 KB Output is correct
29 Correct 12 ms 10620 KB Output is correct
30 Correct 11 ms 10620 KB Output is correct
31 Correct 11 ms 10620 KB Output is correct
32 Correct 12 ms 10620 KB Output is correct
33 Correct 12 ms 10620 KB Output is correct
34 Correct 10 ms 10620 KB Output is correct
35 Correct 12 ms 10620 KB Output is correct
36 Correct 12 ms 10620 KB Output is correct
37 Correct 10 ms 10620 KB Output is correct
38 Correct 11 ms 10620 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9848 KB Output is correct
2 Correct 9 ms 9960 KB Output is correct
3 Correct 9 ms 9960 KB Output is correct
4 Correct 9 ms 10016 KB Output is correct
5 Correct 9 ms 10016 KB Output is correct
6 Correct 9 ms 10016 KB Output is correct
7 Correct 9 ms 10016 KB Output is correct
8 Correct 9 ms 10016 KB Output is correct
9 Correct 9 ms 10040 KB Output is correct
10 Correct 10 ms 10040 KB Output is correct
11 Correct 10 ms 10040 KB Output is correct
12 Correct 9 ms 10040 KB Output is correct
13 Correct 9 ms 10040 KB Output is correct
14 Correct 9 ms 10040 KB Output is correct
15 Correct 9 ms 10040 KB Output is correct
16 Correct 9 ms 10040 KB Output is correct
17 Correct 9 ms 10040 KB Output is correct
18 Correct 9 ms 10040 KB Output is correct
19 Correct 431 ms 25560 KB Output is correct
20 Correct 407 ms 25724 KB Output is correct
21 Correct 422 ms 25724 KB Output is correct
22 Correct 412 ms 25856 KB Output is correct
23 Correct 588 ms 25928 KB Output is correct
24 Correct 480 ms 25928 KB Output is correct
25 Correct 252 ms 30084 KB Output is correct
26 Correct 108 ms 32772 KB Output is correct
27 Correct 645 ms 42236 KB Output is correct
28 Correct 566 ms 93216 KB Output is correct
29 Correct 557 ms 93216 KB Output is correct
30 Correct 592 ms 93216 KB Output is correct
31 Correct 636 ms 93216 KB Output is correct
32 Correct 707 ms 93216 KB Output is correct
33 Correct 687 ms 93216 KB Output is correct
34 Correct 2088 ms 125180 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 9848 KB Output is correct
2 Correct 9 ms 9960 KB Output is correct
3 Correct 9 ms 9960 KB Output is correct
4 Correct 9 ms 10016 KB Output is correct
5 Correct 9 ms 10016 KB Output is correct
6 Correct 9 ms 10016 KB Output is correct
7 Correct 9 ms 10016 KB Output is correct
8 Correct 9 ms 10016 KB Output is correct
9 Correct 9 ms 10040 KB Output is correct
10 Correct 10 ms 10040 KB Output is correct
11 Correct 10 ms 10040 KB Output is correct
12 Correct 9 ms 10040 KB Output is correct
13 Correct 9 ms 10040 KB Output is correct
14 Correct 9 ms 10040 KB Output is correct
15 Correct 9 ms 10040 KB Output is correct
16 Correct 9 ms 10040 KB Output is correct
17 Correct 9 ms 10040 KB Output is correct
18 Correct 9 ms 10040 KB Output is correct
19 Correct 8 ms 10040 KB Output is correct
20 Correct 9 ms 10040 KB Output is correct
21 Correct 12 ms 10192 KB Output is correct
22 Correct 12 ms 10620 KB Output is correct
23 Correct 12 ms 10620 KB Output is correct
24 Correct 12 ms 10620 KB Output is correct
25 Correct 12 ms 10620 KB Output is correct
26 Correct 12 ms 10620 KB Output is correct
27 Correct 11 ms 10620 KB Output is correct
28 Correct 13 ms 10620 KB Output is correct
29 Correct 12 ms 10620 KB Output is correct
30 Correct 11 ms 10620 KB Output is correct
31 Correct 11 ms 10620 KB Output is correct
32 Correct 12 ms 10620 KB Output is correct
33 Correct 12 ms 10620 KB Output is correct
34 Correct 10 ms 10620 KB Output is correct
35 Correct 12 ms 10620 KB Output is correct
36 Correct 12 ms 10620 KB Output is correct
37 Correct 10 ms 10620 KB Output is correct
38 Correct 11 ms 10620 KB Output is correct
39 Correct 431 ms 25560 KB Output is correct
40 Correct 407 ms 25724 KB Output is correct
41 Correct 422 ms 25724 KB Output is correct
42 Correct 412 ms 25856 KB Output is correct
43 Correct 588 ms 25928 KB Output is correct
44 Correct 480 ms 25928 KB Output is correct
45 Correct 252 ms 30084 KB Output is correct
46 Correct 108 ms 32772 KB Output is correct
47 Correct 645 ms 42236 KB Output is correct
48 Correct 566 ms 93216 KB Output is correct
49 Correct 557 ms 93216 KB Output is correct
50 Correct 592 ms 93216 KB Output is correct
51 Correct 636 ms 93216 KB Output is correct
52 Correct 707 ms 93216 KB Output is correct
53 Correct 687 ms 93216 KB Output is correct
54 Correct 2088 ms 125180 KB Output is correct
55 Correct 49 ms 125180 KB Output is correct
56 Correct 31 ms 125180 KB Output is correct
57 Correct 355 ms 125180 KB Output is correct
58 Correct 145 ms 125180 KB Output is correct
59 Correct 206 ms 125180 KB Output is correct
60 Correct 672 ms 125180 KB Output is correct
61 Correct 973 ms 125180 KB Output is correct
62 Correct 639 ms 125180 KB Output is correct
63 Correct 706 ms 125180 KB Output is correct
64 Correct 2874 ms 125180 KB Output is correct
65 Execution timed out 3072 ms 150976 KB Time limit exceeded
66 Halted 0 ms 0 KB -