oj.uz

Submission #102610

# Submission time Handle Problem Language Result Execution time Memory
102610 2019-03-26T09:09:33 Z popovicirobert Race (IOI11_race) C++14
100 / 100
 753 ms 101088 KB 
#include "race.h"
#include <bits/stdc++.h>
#define ll long long

using namespace std;

typedef vector <int> VI;
typedef vector < vector <int> > VVI;
typedef vector < vector < pair <int, int> > > VVPII;
typedef vector <ll> VLL;

struct Data {
    ll dst;
    int lvl;
    bool operator <(const Data &other) const {
        if(dst == other.dst) {
            return lvl < other.lvl;
        }
        return dst < other.dst;
    }
};

void dfs(int nod, int par, VVPII &g, int &ans, vector < multiset <Data> > &mst, VLL &Dst, VI &Lvl, int k) {
    for(auto it : g[nod]) {
        if(it.first != par) {
            Lvl[it.first] = Lvl[nod] + 1, Dst[it.first] = Dst[nod] + it.second;
            dfs(it.first, nod, g, ans, mst, Dst, Lvl, k);
            if(mst[nod].size() < mst[it.first].size()) {
                swap(mst[nod], mst[it.first]);
            }
        }
    }
    for(auto it : g[nod]) {
        if(it.first != par) {
            for(auto cur : mst[it.first]) {
                auto itr = mst[nod].lower_bound({k + 2LL * Dst[nod] - cur.dst, 0});
                if(itr != mst[nod].end() && itr -> dst + cur.dst - 2LL * Dst[nod] == k) {
                    ans = min(ans, itr -> lvl + cur.lvl - 2 * Lvl[nod]);
                }
            }
            for(auto cur : mst[it.first]) {
                mst[nod].insert(cur);
            }
        }
    }
    auto itr = mst[nod].lower_bound({k + Dst[nod], 0});
    if(itr != mst[nod].end() && itr -> dst - Dst[nod] == k) {
        ans = min(ans, itr -> lvl - Lvl[nod]);
    }
    mst[nod].insert({Dst[nod], Lvl[nod]});
}

int best_path(int n, int k, int H[][2], int L[]) {
    VVPII g(n + 1);
    for(int i = 0; i < n - 1; i++) {
        H[i][0]++, H[i][1]++;
        g[H[i][0]].push_back({H[i][1], L[i]});
        g[H[i][1]].push_back({H[i][0], L[i]});
    }
    vector < multiset <Data> > mst(n + 1);
    VLL dst(n + 1); VI lvl(n + 1);
    int ans = 2 * n;
    dfs(1, 0, g, ans, mst, dst, lvl, k);
    if(ans == 2 * n) {
        ans = -1;
    }
    return ans;
}

Subtask #1
9.0 / 9.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 268 ms 50040 KB Output is correct
20 Correct 308 ms 49264 KB Output is correct
21 Correct 291 ms 50556 KB Output is correct
22 Correct 333 ms 46184 KB Output is correct
23 Correct 345 ms 64004 KB Output is correct
24 Correct 298 ms 50780 KB Output is correct
25 Correct 178 ms 35064 KB Output is correct
26 Correct 123 ms 42360 KB Output is correct
27 Correct 450 ms 60744 KB Output is correct
28 Correct 403 ms 84856 KB Output is correct
29 Correct 415 ms 82492 KB Output is correct
30 Correct 416 ms 60664 KB Output is correct
31 Correct 429 ms 60600 KB Output is correct
32 Correct 499 ms 60788 KB Output is correct
33 Correct 487 ms 75192 KB Output is correct
34 Correct 530 ms 74360 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 640 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 3 ms 384 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 3 ms 640 KB Output is correct
22 Correct 5 ms 640 KB Output is correct
23 Correct 4 ms 640 KB Output is correct
24 Correct 3 ms 640 KB Output is correct
25 Correct 4 ms 640 KB Output is correct
26 Correct 4 ms 768 KB Output is correct
27 Correct 3 ms 640 KB Output is correct
28 Correct 4 ms 640 KB Output is correct
29 Correct 4 ms 640 KB Output is correct
30 Correct 4 ms 640 KB Output is correct
31 Correct 4 ms 640 KB Output is correct
32 Correct 3 ms 640 KB Output is correct
33 Correct 3 ms 684 KB Output is correct
34 Correct 3 ms 640 KB Output is correct
35 Correct 4 ms 640 KB Output is correct
36 Correct 4 ms 640 KB Output is correct
37 Correct 4 ms 640 KB Output is correct
38 Correct 4 ms 640 KB Output is correct
39 Correct 268 ms 50040 KB Output is correct
40 Correct 308 ms 49264 KB Output is correct
41 Correct 291 ms 50556 KB Output is correct
42 Correct 333 ms 46184 KB Output is correct
43 Correct 345 ms 64004 KB Output is correct
44 Correct 298 ms 50780 KB Output is correct
45 Correct 178 ms 35064 KB Output is correct
46 Correct 123 ms 42360 KB Output is correct
47 Correct 450 ms 60744 KB Output is correct
48 Correct 403 ms 84856 KB Output is correct
49 Correct 415 ms 82492 KB Output is correct
50 Correct 416 ms 60664 KB Output is correct
51 Correct 429 ms 60600 KB Output is correct
52 Correct 499 ms 60788 KB Output is correct
53 Correct 487 ms 75192 KB Output is correct
54 Correct 530 ms 74360 KB Output is correct
55 Correct 19 ms 4224 KB Output is correct
56 Correct 22 ms 4608 KB Output is correct
57 Correct 327 ms 66124 KB Output is correct
58 Correct 160 ms 27244 KB Output is correct
59 Correct 122 ms 42380 KB Output is correct
60 Correct 395 ms 83064 KB Output is correct
61 Correct 432 ms 60788 KB Output is correct
62 Correct 440 ms 60736 KB Output is correct
63 Correct 493 ms 60748 KB Output is correct
64 Correct 753 ms 101088 KB Output is correct
65 Correct 699 ms 94036 KB Output is correct
66 Correct 415 ms 77516 KB Output is correct
67 Correct 498 ms 55400 KB Output is correct
68 Correct 623 ms 62700 KB Output is correct
69 Correct 549 ms 63608 KB Output is correct
70 Correct 558 ms 60024 KB Output is correct