oj.uz

Submission #434815

# Submission time Handle Problem Language Result Execution time Memory
434815 2021-06-21T20:53:11 Z rqi Cat in a tree (BOI17_catinatree) C++14
100 / 100
 553 ms 203300 KB 
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<ll, ll> pi;
typedef vector<int> vi;
typedef vector<pi> vpi;
 
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define lb lower_bound
#define ins insert
 
#define sz(x) (int)(x).size()
 
int N, D;
 
struct Points{
    int lazy; //add to the distance
    set<pi> all_points; //distance, number
 
    Points(){
        lazy = 0;
        // all_points.ins(mp(0, 1));
    }
};

void print(Points* a){
    cout << "lazy value: " << a->lazy << "\n";
    cout << "printing all_points: " << "\n";
    for(auto u: a->all_points){
        u.f+=a->lazy;
        cout << u.f << " " << u.s << "\n";
    }
    cout.flush();
}

void insertPoint(Points* a, pi b){ //b is actual point
    // cout << "insertPoint: " << "\n";
    // cout << "a: " << "\n";
    // print(a);

    // cout << "b: " << b.f << " " << b.s << "\n";

    b.f-=a->lazy;


    if(sz(a->all_points) == 0){
        a->all_points.ins(b);

        //print(a);
        return;
    }
 
    auto it = a->all_points.lb(mp(b.f, 0));
    if(it != a->all_points.end() && it->s >= b.s){
        //print(a);
        return;
    }

    it = a->all_points.lb(mp(b.f+1, 0));
 
    while(it != a->all_points.begin()){
        auto to_remove = prev(it);
        if(to_remove->s <= b.s){
            a->all_points.erase(to_remove);
        }
        else{
            break;
        }
    }
 
    a->all_points.ins(b);

    // print(a);
}

int getMinD(Points* a){
    if(sz(a->all_points) == 0){
        return 0;
    }
    return a->lazy+(prev(a->all_points.end()))->f;
}
 
void comb(Points* a, Points* b){ //insert b stuff into a
    if(getMinD(a) < getMinD(b)){
        swap(a->lazy, b->lazy);
        swap(a->all_points, b->all_points);
    }

    // cout << "comb: " << "\n";
    // cout << "a: " << "\n";
    // print(a);
    // cout << "b: " << "\n";
    // print(b);
    Points* c = new Points();

    for(auto A: a->all_points){
        A.f+=a->lazy;
        for(auto B: b->all_points){
            
            B.f+=b->lazy;

            if(A.f+B.f >= D){
                // cout << "c insert: " << min(A.f, B.f) <<" " << A.s+B.s << "\n";
                // cout << A.f << " " << B.f << " " << A.s << " " << B.s << "\n";
                insertPoint(c, mp(min(A.f, B.f), A.s+B.s));
            }
        }
    }

    for(auto A: a->all_points){
        A.f+=a->lazy;
        insertPoint(c, A);
    }
    for(auto B: b->all_points){
        B.f+=b->lazy;
        insertPoint(c, B);
    }

    
    // cout << "a: " << "\n";
    // print(a);
    // swap(a->lazy, c->lazy);
    // swap(a->all_points, c->all_points);


    set<pi> new_set;
    for(auto u: c->all_points){
        u.f-=a->lazy;
        new_set.ins(u);
    }
    c->all_points = new_set;
    c->lazy = a->lazy;
    // *a = *c;
    // return;
 
    //insert b stuff into a
    vpi to_add;
    for(auto u: b->all_points){
        u.f+=b->lazy; //u.f is actual distance value now
        to_add.pb(u);
        int needed_dist = max(D-u.f-a->lazy, u.f-a->lazy); //needed_dist is an a_dist
        auto it = a->all_points.lb(mp(needed_dist, 0));
        if(it != a->all_points.end()){
            to_add.pb(mp(min(u.f, (it->f)+a->lazy), u.s+it->s));
        }
    }

    // cout << "getMinD: " << getMinD(b) << "\n";
    for(auto u: a->all_points){
        u.f+=a->lazy;
        if(u.f > getMinD(b)) break;
        int needed_dist = max(D-u.f-b->lazy, u.f-b->lazy);
        auto it = b->all_points.lb(mp(needed_dist, 0));
        if(it != b->all_points.end()){
            to_add.pb(mp(min(u.f, (it->f)+b->lazy), u.s+it->s));
        }
    }
    for(auto u: to_add){
        // cout << "u: " << u.f << " " << u.s << "\n";
        insertPoint(a, u);
    }

    // cout << "a_res: " << "\n";
    // print(a);

    // cout << "c: " << "\n";
    // print(c);

    assert(a->lazy == c->lazy); 
    assert(a->all_points == c->all_points);

}
 
const int mx = 200005;
 
vi adj[mx];
Points* dp[mx];
 
void genDP(int node, int p = -1){
    // cout << "node = " << node << "\n";
    // cout.flush();

    // cout << "dp[" << node << "]->all_points: " << "\n";
    // print(dp[node]);

    for(auto u: adj[node]){
        if(u == p) continue;
        
        genDP(u, node);
        dp[u]->lazy++;
        comb(dp[node], dp[u]);

        // cout << "u: " << u << "\n";
        // cout.flush();
        // cout << "dp[" << node << "]->all_points: " << "\n";
        // print(dp[node]);
    }

    // cout << "dp[" << node << "]->all_points: " << "\n";
    // print(dp[node]);

    Points* emp = new Points(); 
    emp->all_points.ins(mp(0, 1));
    comb(dp[node], emp);

    // cout << "dp[" << node << "]->all_points: " << "\n";
    // print(dp[node]);

    // cout << "node done: " << node << "\n";
    // cout.flush();
}
 
int main(){
    cin.tie(0)->sync_with_stdio(0);
    for(int i = 0; i < mx; i++){
        dp[i] = new Points();
    }
 
    cin >> N >> D;
    for(int i = 1; i < N; i++){
        int xi;
        cin >> xi;
        adj[xi].pb(i);
        adj[i].pb(xi);
    }
 
    genDP(0);
    assert(sz(dp[0]->all_points));

    cout << dp[0]->all_points.begin()->s << "\n";
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 19020 KB Output is correct
2 Correct 15 ms 19080 KB Output is correct
3 Correct 17 ms 19100 KB Output is correct
4 Correct 18 ms 19004 KB Output is correct
5 Correct 16 ms 19100 KB Output is correct
6 Correct 17 ms 18984 KB Output is correct
7 Correct 16 ms 19020 KB Output is correct
8 Correct 16 ms 19104 KB Output is correct
9 Correct 15 ms 19020 KB Output is correct
10 Correct 15 ms 19012 KB Output is correct
11 Correct 18 ms 19100 KB Output is correct
12 Correct 15 ms 19020 KB Output is correct
13 Correct 15 ms 19020 KB Output is correct
14 Correct 15 ms 19100 KB Output is correct
15 Correct 17 ms 19064 KB Output is correct
16 Correct 17 ms 19060 KB Output is correct
17 Correct 15 ms 19024 KB Output is correct
18 Correct 15 ms 19020 KB Output is correct
19 Correct 15 ms 19104 KB Output is correct
20 Correct 15 ms 19020 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 19020 KB Output is correct
2 Correct 15 ms 19080 KB Output is correct
3 Correct 17 ms 19100 KB Output is correct
4 Correct 18 ms 19004 KB Output is correct
5 Correct 16 ms 19100 KB Output is correct
6 Correct 17 ms 18984 KB Output is correct
7 Correct 16 ms 19020 KB Output is correct
8 Correct 16 ms 19104 KB Output is correct
9 Correct 15 ms 19020 KB Output is correct
10 Correct 15 ms 19012 KB Output is correct
11 Correct 18 ms 19100 KB Output is correct
12 Correct 15 ms 19020 KB Output is correct
13 Correct 15 ms 19020 KB Output is correct
14 Correct 15 ms 19100 KB Output is correct
15 Correct 17 ms 19064 KB Output is correct
16 Correct 17 ms 19060 KB Output is correct
17 Correct 15 ms 19024 KB Output is correct
18 Correct 15 ms 19020 KB Output is correct
19 Correct 15 ms 19104 KB Output is correct
20 Correct 15 ms 19020 KB Output is correct
21 Correct 17 ms 19916 KB Output is correct
22 Correct 16 ms 19392 KB Output is correct
23 Correct 16 ms 19276 KB Output is correct
24 Correct 18 ms 19280 KB Output is correct
25 Correct 17 ms 19788 KB Output is correct
26 Correct 17 ms 19660 KB Output is correct
27 Correct 19 ms 19464 KB Output is correct
28 Correct 17 ms 19788 KB Output is correct
29 Correct 17 ms 19912 KB Output is correct
30 Correct 18 ms 19668 KB Output is correct
31 Correct 17 ms 19760 KB Output is correct
32 Correct 17 ms 19788 KB Output is correct
33 Correct 17 ms 19700 KB Output is correct
34 Correct 18 ms 19668 KB Output is correct
35 Correct 18 ms 19684 KB Output is correct
36 Correct 19 ms 19760 KB Output is correct
37 Correct 27 ms 22172 KB Output is correct
38 Correct 18 ms 20096 KB Output is correct
39 Correct 18 ms 20124 KB Output is correct
40 Correct 163 ms 47884 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 19020 KB Output is correct
2 Correct 15 ms 19080 KB Output is correct
3 Correct 17 ms 19100 KB Output is correct
4 Correct 18 ms 19004 KB Output is correct
5 Correct 16 ms 19100 KB Output is correct
6 Correct 17 ms 18984 KB Output is correct
7 Correct 16 ms 19020 KB Output is correct
8 Correct 16 ms 19104 KB Output is correct
9 Correct 15 ms 19020 KB Output is correct
10 Correct 15 ms 19012 KB Output is correct
11 Correct 18 ms 19100 KB Output is correct
12 Correct 15 ms 19020 KB Output is correct
13 Correct 15 ms 19020 KB Output is correct
14 Correct 15 ms 19100 KB Output is correct
15 Correct 17 ms 19064 KB Output is correct
16 Correct 17 ms 19060 KB Output is correct
17 Correct 15 ms 19024 KB Output is correct
18 Correct 15 ms 19020 KB Output is correct
19 Correct 15 ms 19104 KB Output is correct
20 Correct 15 ms 19020 KB Output is correct
21 Correct 17 ms 19916 KB Output is correct
22 Correct 16 ms 19392 KB Output is correct
23 Correct 16 ms 19276 KB Output is correct
24 Correct 18 ms 19280 KB Output is correct
25 Correct 17 ms 19788 KB Output is correct
26 Correct 17 ms 19660 KB Output is correct
27 Correct 19 ms 19464 KB Output is correct
28 Correct 17 ms 19788 KB Output is correct
29 Correct 17 ms 19912 KB Output is correct
30 Correct 18 ms 19668 KB Output is correct
31 Correct 17 ms 19760 KB Output is correct
32 Correct 17 ms 19788 KB Output is correct
33 Correct 17 ms 19700 KB Output is correct
34 Correct 18 ms 19668 KB Output is correct
35 Correct 18 ms 19684 KB Output is correct
36 Correct 19 ms 19760 KB Output is correct
37 Correct 27 ms 22172 KB Output is correct
38 Correct 18 ms 20096 KB Output is correct
39 Correct 18 ms 20124 KB Output is correct
40 Correct 163 ms 47884 KB Output is correct
41 Correct 295 ms 117644 KB Output is correct
42 Correct 291 ms 88644 KB Output is correct
43 Correct 162 ms 64032 KB Output is correct
44 Correct 164 ms 63608 KB Output is correct
45 Correct 158 ms 63636 KB Output is correct
46 Correct 524 ms 142828 KB Output is correct
47 Correct 327 ms 107952 KB Output is correct
48 Correct 348 ms 107964 KB Output is correct
49 Correct 326 ms 107972 KB Output is correct
50 Correct 174 ms 74712 KB Output is correct
51 Correct 175 ms 67652 KB Output is correct
52 Correct 148 ms 67028 KB Output is correct
53 Correct 347 ms 123476 KB Output is correct
54 Correct 296 ms 115716 KB Output is correct
55 Correct 295 ms 114984 KB Output is correct
56 Correct 254 ms 66528 KB Output is correct
57 Correct 75 ms 41680 KB Output is correct
58 Correct 269 ms 118384 KB Output is correct
59 Correct 553 ms 203300 KB Output is correct
60 Correct 279 ms 116348 KB Output is correct
61 Correct 246 ms 101532 KB Output is correct