Submission #935785

#	Time	Username	Problem	Language	Result	Execution time	Memory
935785		anton	Cat Exercise (JOI23_ho_t4)	C++17	31 / 100	121 ms	2004 KiB

Main

#include<bits/stdc++.h>


using namespace std;
#define int long long
#define pii pair<int, int>
int n;

const int MAX_N = 5000;

vector<int> adj[MAX_N];
int H[MAX_N];
int score[MAX_N];


pii get_max(int u, int anc, int limit){
    pii res = {H[u], score[u]};

    for(auto e: adj[u]){
        if(e!=anc && H[e]<=limit){
            pii c=  get_max(e, u, limit);
            if(c.first>res.first){
                res= {c.first, c.second+1};
            }

        }
    }
    return res;
}


signed main(){
    cin>>n;

    vector<pii> pts;

    for(int i = 0; i<n; i++){
        cin>>H[i];
        pts.push_back({H[i], i});
    }


    for(int i = 0; i<n-1; i++){
        int a, b;
        cin>>a>>b;
        adj[a-1].push_back(b-1);
        adj[b-1].push_back(a-1);
    }

    sort(pts.begin(), pts.end());
    
    for(int i = 0; i<n; i++){
        int u = pts[i].second;
        for(auto v: adj[u]){
            if(H[v]<H[u]){
                score[u] = max(score[u], get_max(v, u, H[u]).second+1);
            }
        }
        //cout<<u<<" "<<score[u]<<endl;
    }

    cout<<score[pts.back().second]<<endl;
}

• Subtask 1: 7 / 7
• Subtask 2: 7 / 7
• Subtask 3: 7 / 7
• Subtask 4: 10 / 10
• Subtask 5: 0 / 20
• Subtask 6: 0 / 23
• Subtask 7: 0 / 26