oj.uz

답안 #792631

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
792631 2023-07-25T07:36:17 Z Theo830 Cat Exercise (JOI23_ho_t4) C++17
31 / 100
 2000 ms 881928 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
ll n;
ll p[200005];
vector<vll>adj;
ll dp[200005];
ll solve(ll idx){
    if(dp[idx] != -1){
        return dp[idx];
    }
    ll ans = 0;
    queue<ll>q;
    ll dist[n+5];
    memset(dist,-1,sizeof dist);
    dist[idx] = 0;
    q.push(idx);
    while(!q.empty()){
        ll f = q.front();
        q.pop();
        for(auto x:adj[f]){
            if(dist[x] == -1 && p[x] < p[idx]){
                q.push(x);
                dist[x] = dist[f] + 1;
                ans = max(ans,dist[x] + solve(x));
            }
        }
    }
    return dp[idx] = ans;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin>>n;
    adj.assign(n+5,vll());
    ll root = -1;
    f(i,0,n){
        cin>>p[i+1];
        if(p[i+1] == n){
            root = i+1;
        }
    }
    f(i,0,n-1){
        ll a,b;
        cin>>a>>b;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    memset(dp,-1,sizeof dp);
    cout<<solve(root)<<"\n";
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1872 KB Output is correct
8 Correct 1 ms 1876 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1872 KB Output is correct
8 Correct 1 ms 1876 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 2 ms 2388 KB Output is correct
12 Correct 2 ms 2260 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 1 ms 1872 KB Output is correct
15 Correct 1 ms 1876 KB Output is correct
16 Correct 1 ms 1876 KB Output is correct
17 Correct 1 ms 1876 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1872 KB Output is correct
8 Correct 1 ms 1876 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 2 ms 2388 KB Output is correct
12 Correct 2 ms 2260 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 1 ms 1872 KB Output is correct
15 Correct 1 ms 1876 KB Output is correct
16 Correct 1 ms 1876 KB Output is correct
17 Correct 1 ms 1876 KB Output is correct
18 Correct 149 ms 102340 KB Output is correct
19 Correct 132 ms 91416 KB Output is correct
20 Correct 134 ms 91572 KB Output is correct
21 Correct 6 ms 2900 KB Output is correct
22 Correct 6 ms 3028 KB Output is correct
23 Correct 6 ms 2908 KB Output is correct
24 Correct 6 ms 2900 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1872 KB Output is correct
8 Correct 1 ms 1876 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 2 ms 2388 KB Output is correct
12 Correct 2 ms 2260 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 1 ms 1872 KB Output is correct
15 Correct 1 ms 1876 KB Output is correct
16 Correct 1 ms 1876 KB Output is correct
17 Correct 1 ms 1876 KB Output is correct
18 Correct 149 ms 102340 KB Output is correct
19 Correct 132 ms 91416 KB Output is correct
20 Correct 134 ms 91572 KB Output is correct
21 Correct 6 ms 2900 KB Output is correct
22 Correct 6 ms 3028 KB Output is correct
23 Correct 6 ms 2908 KB Output is correct
24 Correct 6 ms 2900 KB Output is correct
25 Correct 1 ms 1876 KB Output is correct
26 Correct 155 ms 71076 KB Output is correct
27 Correct 169 ms 71716 KB Output is correct
28 Correct 151 ms 71356 KB Output is correct
29 Correct 156 ms 72160 KB Output is correct
30 Correct 13 ms 2940 KB Output is correct
31 Correct 20 ms 3176 KB Output is correct
32 Correct 15 ms 3040 KB Output is correct
33 Correct 19 ms 3028 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1872 KB Output is correct
8 Correct 1 ms 1876 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 2 ms 2388 KB Output is correct
12 Correct 2 ms 2260 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 1 ms 1872 KB Output is correct
15 Correct 1 ms 1876 KB Output is correct
16 Correct 1 ms 1876 KB Output is correct
17 Correct 1 ms 1876 KB Output is correct
18 Correct 149 ms 102340 KB Output is correct
19 Correct 132 ms 91416 KB Output is correct
20 Correct 134 ms 91572 KB Output is correct
21 Correct 6 ms 2900 KB Output is correct
22 Correct 6 ms 3028 KB Output is correct
23 Correct 6 ms 2908 KB Output is correct
24 Correct 6 ms 2900 KB Output is correct
25 Execution timed out 2101 ms 881928 KB Time limit exceeded
26 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Execution timed out 2077 ms 52764 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1876 KB Output is correct
2 Correct 1 ms 1876 KB Output is correct
3 Correct 1 ms 1876 KB Output is correct
4 Correct 1 ms 1876 KB Output is correct
5 Correct 1 ms 1876 KB Output is correct
6 Correct 1 ms 1876 KB Output is correct
7 Correct 1 ms 1872 KB Output is correct
8 Correct 1 ms 1876 KB Output is correct
9 Correct 1 ms 1876 KB Output is correct
10 Correct 1 ms 1876 KB Output is correct
11 Correct 2 ms 2388 KB Output is correct
12 Correct 2 ms 2260 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 1 ms 1872 KB Output is correct
15 Correct 1 ms 1876 KB Output is correct
16 Correct 1 ms 1876 KB Output is correct
17 Correct 1 ms 1876 KB Output is correct
18 Correct 149 ms 102340 KB Output is correct
19 Correct 132 ms 91416 KB Output is correct
20 Correct 134 ms 91572 KB Output is correct
21 Correct 6 ms 2900 KB Output is correct
22 Correct 6 ms 3028 KB Output is correct
23 Correct 6 ms 2908 KB Output is correct
24 Correct 6 ms 2900 KB Output is correct
25 Correct 1 ms 1876 KB Output is correct
26 Correct 155 ms 71076 KB Output is correct
27 Correct 169 ms 71716 KB Output is correct
28 Correct 151 ms 71356 KB Output is correct
29 Correct 156 ms 72160 KB Output is correct
30 Correct 13 ms 2940 KB Output is correct
31 Correct 20 ms 3176 KB Output is correct
32 Correct 15 ms 3040 KB Output is correct
33 Correct 19 ms 3028 KB Output is correct
34 Execution timed out 2101 ms 881928 KB Time limit exceeded
35 Halted 0 ms 0 KB -