oj.uz

Submission #644773

# Submission time Handle Problem Language Result Execution time Memory
644773 2022-09-25T08:11:17 Z Vu_CG_Coder Cat in a tree (BOI17_catinatree) C++14
51 / 100
 404 ms 26976 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 = 2000;
 
vector <int> a[N];
int dp[N][4500] = {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 <= 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

catinatree.cpp: In function 'void dfs(int, int)':
catinatree.cpp:47:9: warning: unused variable 'cnt' [-Wunused-variable]
   47 |     int cnt = 0;
      |         ^~~
catinatree.cpp: In function 'int main()':
catinatree.cpp:85:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |     freopen(TASK".inp","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
catinatree.cpp:86:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   86 |     freopen(TASK".out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 404 ms 26976 KB Output is correct
22 Correct 4 ms 9172 KB Output is correct
23 Correct 4 ms 9172 KB Output is correct
24 Correct 4 ms 9172 KB Output is correct
25 Correct 8 ms 17940 KB Output is correct
26 Correct 8 ms 18004 KB Output is correct
27 Correct 8 ms 18004 KB Output is correct
28 Correct 12 ms 26736 KB Output is correct
29 Correct 12 ms 26836 KB Output is correct
30 Correct 12 ms 26852 KB Output is correct
31 Correct 12 ms 26776 KB Output is correct
32 Correct 12 ms 26324 KB Output is correct
33 Correct 11 ms 26288 KB Output is correct
34 Correct 11 ms 25116 KB Output is correct
35 Correct 12 ms 25092 KB Output is correct
36 Correct 11 ms 26792 KB Output is correct
37 Correct 11 ms 26836 KB Output is correct
38 Correct 12 ms 26864 KB Output is correct
39 Correct 13 ms 26832 KB Output is correct
40 Correct 12 ms 26892 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 0 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 596 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 596 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 596 KB Output is correct
21 Correct 404 ms 26976 KB Output is correct
22 Correct 4 ms 9172 KB Output is correct
23 Correct 4 ms 9172 KB Output is correct
24 Correct 4 ms 9172 KB Output is correct
25 Correct 8 ms 17940 KB Output is correct
26 Correct 8 ms 18004 KB Output is correct
27 Correct 8 ms 18004 KB Output is correct
28 Correct 12 ms 26736 KB Output is correct
29 Correct 12 ms 26836 KB Output is correct
30 Correct 12 ms 26852 KB Output is correct
31 Correct 12 ms 26776 KB Output is correct
32 Correct 12 ms 26324 KB Output is correct
33 Correct 11 ms 26288 KB Output is correct
34 Correct 11 ms 25116 KB Output is correct
35 Correct 12 ms 25092 KB Output is correct
36 Correct 11 ms 26792 KB Output is correct
37 Correct 11 ms 26836 KB Output is correct
38 Correct 12 ms 26864 KB Output is correct
39 Correct 13 ms 26832 KB Output is correct
40 Correct 12 ms 26892 KB Output is correct
41 Runtime error 2 ms 596 KB Execution killed with signal 11
42 Halted 0 ms 0 KB -