oj.uz

Submission #108781

# Submission time Handle Problem Language Result Execution time Memory
108781 2019-05-01T23:32:24 Z updown1 Race (IOI11_race) C++17
100 / 100
 1899 ms 44892 KB 
#include "race.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, a, b) for(int i=a; i<b; i++)
#define ffi For(i, 0, M)
#define ffj For(j, 0, N)
#define ffa ffi ffj
#define s <<" "<<
#define c <<" : "<<
#define w cout
#define e "\n"
#define pb push_back
#define mp make_pair
#define a first
#define b second
//#define int ll
const int MAXN = 200000;
//500,000,000 operations
ll k;
int out = MAXN+1, siz, und[MAXN];;
bool gone[MAXN];
vector<int> nodes;
vector<pair<int, ll> > adj[MAXN];
map<ll, int> len;

void dfs(int at, int p) {
    und[at] = 1;
    siz++;
    nodes.pb(at);
    for (auto i: adj[at]) if (i.a != p && !gone[i.a]) {
        dfs(i.a, at);
        und[at] += und[i.a];
    }
}

void query(int at, ll path, int took, int p) {
    if (len.find(k-path) != len.end()) {
        //w<< siz s p s at<<e;
        out = min(out, len[k-path]+took);
    }
    for (auto i: adj[at]) if (i.a != p && !gone[i.a]) query(i.a, path+i.b, took+1, at);
}

void update(int at, ll path, int took, int p) {
    if (len.find(path) == len.end()) len[path] = took;
    len[path] = min(len[path], took);
    //w<< "add" s path s at<<e;
    for (auto i: adj[at]) if (i.a != p && !gone[i.a]) update(i.a, path+i.b, took+1, at);
}

void solve(int at) {
    siz = 0;
    nodes.clear();
    dfs(at, at);
    /// find centroid
    int ce;
    for (int i: nodes) {
        int big = siz-und[i];
        for (auto j: adj[i]) if (!gone[j.a] && und[j.a] < und[i]) {
            big = max(big, und[j.a]);
        }
        if (big <= siz/2) ce = i;
    }
    //w<< "reset for" s ce<<e;
    len.clear();
    len[0] = 0;
    for (auto i: adj[ce]) if (!gone[i.a]) {
        query(i.a, i.b, 1, ce);
        update(i.a, i.b, 1, ce);
    }
    /// solve sub problems
    gone[ce] = true;
    for (auto i: adj[ce]) if (!gone[i.a]) solve(i.a);
}

int best_path(int N, int K, int H[][2], int L[]){
    k = K;
    For (i, 0, N-1) {
        adj[H[i][0]].emplace_back(H[i][1], L[i]);
        adj[H[i][1]].emplace_back(H[i][0], L[i]);
    }
    solve(0);
    if (out > MAXN) out = -1;
    return out;
}

Compilation message

race.cpp: In function 'void solve(int)':
race.cpp:73:14: warning: 'ce' may be used uninitialized in this function [-Wmaybe-uninitialized]
     gone[ce] = true;
     ~~~~~~~~~^~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 6 ms 5120 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 7 ms 5120 KB Output is correct
6 Correct 7 ms 5120 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 7 ms 5072 KB Output is correct
10 Correct 8 ms 5120 KB Output is correct
11 Correct 6 ms 5120 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 7 ms 5092 KB Output is correct
14 Correct 7 ms 5012 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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 6 ms 5120 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 7 ms 5120 KB Output is correct
6 Correct 7 ms 5120 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 7 ms 5072 KB Output is correct
10 Correct 8 ms 5120 KB Output is correct
11 Correct 6 ms 5120 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 7 ms 5092 KB Output is correct
14 Correct 7 ms 5012 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 5 ms 5120 KB Output is correct
20 Correct 6 ms 4992 KB Output is correct
21 Correct 8 ms 5120 KB Output is correct
22 Correct 10 ms 5248 KB Output is correct
23 Correct 9 ms 5120 KB Output is correct
24 Correct 9 ms 5248 KB Output is correct
25 Correct 9 ms 5120 KB Output is correct
26 Correct 9 ms 5120 KB Output is correct
27 Correct 8 ms 5120 KB Output is correct
28 Correct 10 ms 5248 KB Output is correct
29 Correct 9 ms 5120 KB Output is correct
30 Correct 8 ms 5248 KB Output is correct
31 Correct 8 ms 5248 KB Output is correct
32 Correct 9 ms 5248 KB Output is correct
33 Correct 10 ms 5248 KB Output is correct
34 Correct 10 ms 5248 KB Output is correct
35 Correct 8 ms 5248 KB Output is correct
36 Correct 8 ms 5248 KB Output is correct
37 Correct 8 ms 5248 KB Output is correct
38 Correct 9 ms 5248 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 6 ms 5120 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 7 ms 5120 KB Output is correct
6 Correct 7 ms 5120 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 7 ms 5072 KB Output is correct
10 Correct 8 ms 5120 KB Output is correct
11 Correct 6 ms 5120 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 7 ms 5092 KB Output is correct
14 Correct 7 ms 5012 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 386 ms 13660 KB Output is correct
20 Correct 397 ms 13688 KB Output is correct
21 Correct 397 ms 13688 KB Output is correct
22 Correct 302 ms 13816 KB Output is correct
23 Correct 459 ms 13940 KB Output is correct
24 Correct 213 ms 13304 KB Output is correct
25 Correct 294 ms 18036 KB Output is correct
26 Correct 133 ms 19444 KB Output is correct
27 Correct 437 ms 21400 KB Output is correct
28 Correct 1719 ms 44892 KB Output is correct
29 Correct 1671 ms 43752 KB Output is correct
30 Correct 465 ms 21484 KB Output is correct
31 Correct 425 ms 21492 KB Output is correct
32 Correct 564 ms 21360 KB Output is correct
33 Correct 898 ms 20212 KB Output is correct
34 Correct 1682 ms 32372 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5120 KB Output is correct
2 Correct 7 ms 5120 KB Output is correct
3 Correct 6 ms 5120 KB Output is correct
4 Correct 6 ms 4992 KB Output is correct
5 Correct 7 ms 5120 KB Output is correct
6 Correct 7 ms 5120 KB Output is correct
7 Correct 7 ms 5120 KB Output is correct
8 Correct 6 ms 5120 KB Output is correct
9 Correct 7 ms 5072 KB Output is correct
10 Correct 8 ms 5120 KB Output is correct
11 Correct 6 ms 5120 KB Output is correct
12 Correct 7 ms 4992 KB Output is correct
13 Correct 7 ms 5092 KB Output is correct
14 Correct 7 ms 5012 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 5 ms 5120 KB Output is correct
20 Correct 6 ms 4992 KB Output is correct
21 Correct 8 ms 5120 KB Output is correct
22 Correct 10 ms 5248 KB Output is correct
23 Correct 9 ms 5120 KB Output is correct
24 Correct 9 ms 5248 KB Output is correct
25 Correct 9 ms 5120 KB Output is correct
26 Correct 9 ms 5120 KB Output is correct
27 Correct 8 ms 5120 KB Output is correct
28 Correct 10 ms 5248 KB Output is correct
29 Correct 9 ms 5120 KB Output is correct
30 Correct 8 ms 5248 KB Output is correct
31 Correct 8 ms 5248 KB Output is correct
32 Correct 9 ms 5248 KB Output is correct
33 Correct 10 ms 5248 KB Output is correct
34 Correct 10 ms 5248 KB Output is correct
35 Correct 8 ms 5248 KB Output is correct
36 Correct 8 ms 5248 KB Output is correct
37 Correct 8 ms 5248 KB Output is correct
38 Correct 9 ms 5248 KB Output is correct
39 Correct 386 ms 13660 KB Output is correct
40 Correct 397 ms 13688 KB Output is correct
41 Correct 397 ms 13688 KB Output is correct
42 Correct 302 ms 13816 KB Output is correct
43 Correct 459 ms 13940 KB Output is correct
44 Correct 213 ms 13304 KB Output is correct
45 Correct 294 ms 18036 KB Output is correct
46 Correct 133 ms 19444 KB Output is correct
47 Correct 437 ms 21400 KB Output is correct
48 Correct 1719 ms 44892 KB Output is correct
49 Correct 1671 ms 43752 KB Output is correct
50 Correct 465 ms 21484 KB Output is correct
51 Correct 425 ms 21492 KB Output is correct
52 Correct 564 ms 21360 KB Output is correct
53 Correct 898 ms 20212 KB Output is correct
54 Correct 1682 ms 32372 KB Output is correct
55 Correct 45 ms 6308 KB Output is correct
56 Correct 27 ms 5888 KB Output is correct
57 Correct 183 ms 14124 KB Output is correct
58 Correct 65 ms 13416 KB Output is correct
59 Correct 474 ms 24044 KB Output is correct
60 Correct 1673 ms 43240 KB Output is correct
61 Correct 532 ms 23160 KB Output is correct
62 Correct 434 ms 21480 KB Output is correct
63 Correct 552 ms 21360 KB Output is correct
64 Correct 1899 ms 27020 KB Output is correct
65 Correct 1746 ms 33172 KB Output is correct
66 Correct 1692 ms 42016 KB Output is correct
67 Correct 255 ms 21080 KB Output is correct
68 Correct 791 ms 31572 KB Output is correct
69 Correct 864 ms 31600 KB Output is correct
70 Correct 844 ms 30444 KB Output is correct