oj.uz

Submission #42559

# Submission time Handle Problem Language Result Execution time Memory
42559 2018-02-28T06:09:14 Z comfile Race (IOI11_race) C++14
21 / 100
 3000 ms 11248 KB 
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
typedef long long int ll;
using namespace std;
const int N = 200010;
int n,k,sz[N],dead[N],ans;
vector<pii> g[N];
void get_sz(int cur,int prev){
    sz[cur] = 1;
    for(auto &x : g[cur]) if(!dead[x.first] && x.first!=prev){
        get_sz(x.first,cur);
    }
}
int dfs(int cur,int prev,int tot){
    for(auto &x : g[cur]) if(!dead[x.first] && x.first!=prev){
        if(sz[x.first]>(tot/2)) return dfs(x.first,cur,tot);
    }
    return cur;
}
int one(int start){
    get_sz(start,-1);
    return dfs(start,-1,sz[start]);
}
void rec(int cur,int prev){
    int c = one(cur);
    dead[c] = 1;
    for(auto &x : g[c]) if(!dead[x.first] && x.first!=prev) rec(x.first,c);
    map<int,int> cnt;
    function<void (int,int,int,int)> dfs3 = [&](int cu,int prv,int st,int _depth){
        if(_depth>k) return;
        cnt[_depth] = cnt[_depth]?min(cnt[_depth],st):st;
        for(auto &x : g[cu]) if(!dead[x.first] && x.first!=prv)
            dfs3(x.first,cu,st+1,_depth+x.second);
    };
    function<void (int,int,int,int)> dfs4 = [&](int cu,int prv,int st,int _depth){
        if(_depth>k) return;
        if(cnt[k-_depth]) ans = min(ans,st+cnt[k-_depth]);
        for(auto &x : g[cu]) if(!dead[x.first] && x.first!=prv)
            dfs4(x.first,cu,st+1,_depth+x.second);
    };
    dfs3(c,prev,0,0);
    if(cnt[k]) ans = min(ans,cnt[k]); cnt.clear();
    for(auto &x : g[c]) if(!dead[x.first] && x.first!=prev){
        dfs4(x.first,c,1,x.second);
        dfs3(x.first,c,1,x.second);
    }
    dead[c] = 0;
}
int best_path(int _n,int _k,int h[][2],int l[]){
    ans = 1e9;
    n = _n; k = _k;
    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));
    }
    rec(0,-1);
    if(ans>=1e9) ans = -1;
    return ans;
}

Compilation message

race.cpp: In function 'void rec(int, int)':
race.cpp:44:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
     if(cnt[k]) ans = min(ans,cnt[k]); cnt.clear();
     ^~
race.cpp:44:39: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
     if(cnt[k]) ans = min(ans,cnt[k]); cnt.clear();
                                       ^~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5092 KB Output is correct
3 Correct 6 ms 5144 KB Output is correct
4 Correct 6 ms 5204 KB Output is correct
5 Correct 6 ms 5348 KB Output is correct
6 Correct 7 ms 5396 KB Output is correct
7 Correct 6 ms 5396 KB Output is correct
8 Correct 6 ms 5396 KB Output is correct
9 Correct 7 ms 5396 KB Output is correct
10 Correct 7 ms 5408 KB Output is correct
11 Correct 6 ms 5408 KB Output is correct
12 Correct 7 ms 5408 KB Output is correct
13 Correct 8 ms 5408 KB Output is correct
14 Correct 8 ms 5408 KB Output is correct
15 Correct 8 ms 5408 KB Output is correct
16 Correct 8 ms 5408 KB Output is correct
17 Correct 9 ms 5408 KB Output is correct
18 Correct 8 ms 5464 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5092 KB Output is correct
3 Correct 6 ms 5144 KB Output is correct
4 Correct 6 ms 5204 KB Output is correct
5 Correct 6 ms 5348 KB Output is correct
6 Correct 7 ms 5396 KB Output is correct
7 Correct 6 ms 5396 KB Output is correct
8 Correct 6 ms 5396 KB Output is correct
9 Correct 7 ms 5396 KB Output is correct
10 Correct 7 ms 5408 KB Output is correct
11 Correct 6 ms 5408 KB Output is correct
12 Correct 7 ms 5408 KB Output is correct
13 Correct 8 ms 5408 KB Output is correct
14 Correct 8 ms 5408 KB Output is correct
15 Correct 8 ms 5408 KB Output is correct
16 Correct 8 ms 5408 KB Output is correct
17 Correct 9 ms 5408 KB Output is correct
18 Correct 8 ms 5464 KB Output is correct
19 Correct 5 ms 5464 KB Output is correct
20 Correct 7 ms 5464 KB Output is correct
21 Correct 281 ms 5732 KB Output is correct
22 Correct 14 ms 5732 KB Output is correct
23 Correct 17 ms 5732 KB Output is correct
24 Correct 14 ms 5732 KB Output is correct
25 Correct 372 ms 5860 KB Output is correct
26 Correct 15 ms 5860 KB Output is correct
27 Correct 13 ms 5860 KB Output is correct
28 Correct 69 ms 5860 KB Output is correct
29 Correct 172 ms 5860 KB Output is correct
30 Correct 179 ms 5860 KB Output is correct
31 Correct 345 ms 5860 KB Output is correct
32 Correct 372 ms 5860 KB Output is correct
33 Correct 248 ms 5860 KB Output is correct
34 Correct 22 ms 5860 KB Output is correct
35 Correct 24 ms 5860 KB Output is correct
36 Correct 26 ms 5860 KB Output is correct
37 Correct 215 ms 5860 KB Output is correct
38 Correct 266 ms 5860 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5092 KB Output is correct
3 Correct 6 ms 5144 KB Output is correct
4 Correct 6 ms 5204 KB Output is correct
5 Correct 6 ms 5348 KB Output is correct
6 Correct 7 ms 5396 KB Output is correct
7 Correct 6 ms 5396 KB Output is correct
8 Correct 6 ms 5396 KB Output is correct
9 Correct 7 ms 5396 KB Output is correct
10 Correct 7 ms 5408 KB Output is correct
11 Correct 6 ms 5408 KB Output is correct
12 Correct 7 ms 5408 KB Output is correct
13 Correct 8 ms 5408 KB Output is correct
14 Correct 8 ms 5408 KB Output is correct
15 Correct 8 ms 5408 KB Output is correct
16 Correct 8 ms 5408 KB Output is correct
17 Correct 9 ms 5408 KB Output is correct
18 Correct 8 ms 5464 KB Output is correct
19 Execution timed out 3062 ms 11248 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5092 KB Output is correct
3 Correct 6 ms 5144 KB Output is correct
4 Correct 6 ms 5204 KB Output is correct
5 Correct 6 ms 5348 KB Output is correct
6 Correct 7 ms 5396 KB Output is correct
7 Correct 6 ms 5396 KB Output is correct
8 Correct 6 ms 5396 KB Output is correct
9 Correct 7 ms 5396 KB Output is correct
10 Correct 7 ms 5408 KB Output is correct
11 Correct 6 ms 5408 KB Output is correct
12 Correct 7 ms 5408 KB Output is correct
13 Correct 8 ms 5408 KB Output is correct
14 Correct 8 ms 5408 KB Output is correct
15 Correct 8 ms 5408 KB Output is correct
16 Correct 8 ms 5408 KB Output is correct
17 Correct 9 ms 5408 KB Output is correct
18 Correct 8 ms 5464 KB Output is correct
19 Correct 5 ms 5464 KB Output is correct
20 Correct 7 ms 5464 KB Output is correct
21 Correct 281 ms 5732 KB Output is correct
22 Correct 14 ms 5732 KB Output is correct
23 Correct 17 ms 5732 KB Output is correct
24 Correct 14 ms 5732 KB Output is correct
25 Correct 372 ms 5860 KB Output is correct
26 Correct 15 ms 5860 KB Output is correct
27 Correct 13 ms 5860 KB Output is correct
28 Correct 69 ms 5860 KB Output is correct
29 Correct 172 ms 5860 KB Output is correct
30 Correct 179 ms 5860 KB Output is correct
31 Correct 345 ms 5860 KB Output is correct
32 Correct 372 ms 5860 KB Output is correct
33 Correct 248 ms 5860 KB Output is correct
34 Correct 22 ms 5860 KB Output is correct
35 Correct 24 ms 5860 KB Output is correct
36 Correct 26 ms 5860 KB Output is correct
37 Correct 215 ms 5860 KB Output is correct
38 Correct 266 ms 5860 KB Output is correct
39 Execution timed out 3062 ms 11248 KB Time limit exceeded
40 Halted 0 ms 0 KB -