# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
644769 | 2022-09-25T08:08:43 Z | Vu_CG_Coder | Cat in a tree (BOI17_catinatree) | C++14 | 4 ms | 5056 KB |
/* [Author : Hoang Duy Vu] */ #include <bits/stdc++.h> #define All(x) (x).begin(),(x).end() #define ll long long #define C make_pair #define fi first #define se second #define two second.first #define thr second.second #define TASK "txt" using namespace std; template<typename T> bool maximize(T &res, const T &val) { if (res < val) { res = val; return true; } return false; } template<typename T> bool minimize(T &res, const T &val) { if (res > val) { res = val; return true; } return false; } typedef pair<int,int> ii; typedef pair<int,ii> iii; const int LOG = 20; const int INF = 1e9 + 7; const ll LNF = 1e18 + 7; const int mod = 1e9 + 7; const int N = 200010; vector <int> a[N]; int dp[N][450] = {0}; int t[N] = {0}; int f[1100] = {0}; int high[N] = {0}; int n , k; void input() { cin >> n >> k; for (int i = 1 ; i < n ; i++) { int x; cin >> x; a[x].push_back(i); a[i].push_back(x); } } void dfs(int u ,int par) { memset(dp[u],0,sizeof(dp[u])); int cnt = 0; for (int v : a[u]) if (v != par) { dfs(v,u); maximize(high[u],high[v] + 1); for (int i = 0 ; i <= min(high[u],k) ; i++) f[i] = dp[u][i]; for (int i = 0 ; i <= min(high[u],k) ; i++) { for (int j = max(i - 1,0) ; j <= min(high[v],k) ; j++) { int x = j + 1; maximize(dp[u][i],f[max(i,k - x)] + dp[v][j]); } } } maximize(dp[u][0],dp[u][k] + 1); } void solve() { dfs(0,0); int res = 0; for (int i = 0 ; i <= high[0] ; i++) maximize(res,dp[0][i]); cout << res; } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL); if(fopen(TASK".inp", "r")){ freopen(TASK".inp","r",stdin); freopen(TASK".out","w",stdout); } int tk; tk = 1; //cin >> tk; while (tk--) { input(); solve(); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4948 KB | Output is correct |
2 | Correct | 2 ms | 4948 KB | Output is correct |
3 | Correct | 3 ms | 4948 KB | Output is correct |
4 | Correct | 4 ms | 5056 KB | Output is correct |
5 | Correct | 3 ms | 4948 KB | Output is correct |
6 | Correct | 4 ms | 4948 KB | Output is correct |
7 | Correct | 3 ms | 4948 KB | Output is correct |
8 | Incorrect | 3 ms | 4948 KB | Output isn't correct |
9 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4948 KB | Output is correct |
2 | Correct | 2 ms | 4948 KB | Output is correct |
3 | Correct | 3 ms | 4948 KB | Output is correct |
4 | Correct | 4 ms | 5056 KB | Output is correct |
5 | Correct | 3 ms | 4948 KB | Output is correct |
6 | Correct | 4 ms | 4948 KB | Output is correct |
7 | Correct | 3 ms | 4948 KB | Output is correct |
8 | Incorrect | 3 ms | 4948 KB | Output isn't correct |
9 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 4948 KB | Output is correct |
2 | Correct | 2 ms | 4948 KB | Output is correct |
3 | Correct | 3 ms | 4948 KB | Output is correct |
4 | Correct | 4 ms | 5056 KB | Output is correct |
5 | Correct | 3 ms | 4948 KB | Output is correct |
6 | Correct | 4 ms | 4948 KB | Output is correct |
7 | Correct | 3 ms | 4948 KB | Output is correct |
8 | Incorrect | 3 ms | 4948 KB | Output isn't correct |
9 | Halted | 0 ms | 0 KB | - |