| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1135516 | Unforgettablepl | Cat Exercise (JOI23_ho_t4) | C++20 | 2095 ms | 16044 KiB |
// #pragma GCC optimize("Ofast","unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define int long long
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> P(n+1);
for(int i=1;i<=n;i++)cin>>P[i];
vector<vector<int>> adj(n+1);
for(int i=1;i<n;i++) {
int a,b;cin>>a>>b;a=P[a];b=P[b];
adj[a].emplace_back(b);
adj[b].emplace_back(a);
}
vector<int> DP(n+1);
for(int i=1;i<=n;i++) {
function<void(int,int,int)> dfs = [&](int x,int p,int dist) {
DP[i]=max(DP[i],dist+DP[x]);
for(int&j:adj[x])if(j!=p and j<i)dfs(j,x,dist+1);
};
dfs(i,-1,0);
}
cout << DP[n] << '\n';
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
