oj.uz

Submission #645268

# Submission time Handle Problem Language Result Execution time Memory
645268 2022-09-26T15:22:54 Z Vu_CG_Coder Cat in a tree (BOI17_catinatree) C++14
100 / 100
 594 ms 40724 KB 
/* [Author : Hoang Duy Vu] - THPT Chuyen Nguyen Du    */
/* [2022 - 12TH GO VOI 23] - From Nguyen Du with love */
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <cmath>
#include <cstdio> 
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <iomanip>
#include <numeric>
#define FOR(i, a, b) for(int i = (a), _b = (b); i <= _b; i++)
#define FORE(i,b, a) for(int i = (b), _a = (a); i >= _a; i--)
#define All(x) (x).begin(),(x).end()
#define __ZuyVuNee int main()
#define MASK(i) (1ll<<(i))
#define ll long long
#define se second
#define C make_pair
#define fi first
#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 = 17;
const int INF = 1e9 + 7;
const ll LNF = 1e18 + 7;
const int mod = 1e9 + 7;
const int N = 200100;

int n , k;
int par[N][LOG + 2];
int high[N];
int Pa[N] = {0};
int cnt[N] = {0};
int f[N] = {0};
int Mn[N] = {0};
ii H[N];

vector <int> a[N];

void findhigh(int u)
{
    for (int v : a[u])
    if (v != par[u][0])
    {
        high[v] = high[u] + 1;
        H[v] = C(high[v],v);
        par[v][0] = u;
        findhigh(v);
    }
}

void write()
{
    cin >> n >> k;
    for (int i = 2; i <= n ; i++)
    {
        int x;
        cin >> x;
        x++;
        a[x].push_back(i);
        a[i].push_back(x);
    }
}

int get(int u , int v)
{
    if (high[u] < high[v]) return get(v,u);

    for (int i = LOG ; i >= 0 ; i--)
    if (high[par[u][i]] >= high[v]) u = par[u][i];

    if (u == v) return u;

    for (int i = LOG ; i >= 0 ; i--)
    if (par[u][i] != par[v][i])
    {
        u = par[u][i];
        v = par[v][i];
    }

    return par[u][0];
}

void subtree(int u , int P)
{
    cnt[u] = 1;

    for (int v : a[u])
    if (v != P && !f[v]) 
    {
        subtree(v,u);
        cnt[u] += cnt[v];
    }
}

int FindCentroid(int u , int P , int t)
{
    for (int v : a[u])
    if (!f[v] && v != P) 
        if (cnt[v]*2 > t) return FindCentroid(v,u,t);
    return u;
}

void Centroid(int u , int P)
{
    subtree(u,u);

    int root = FindCentroid(u,u,cnt[u]);

    Pa[root] = P;

    f[root] = 1;

    for (int v : a[root])
    if (!f[v]) Centroid(v,root);
}


void update(int u)
{
    int x = u;
    while (x)
    {
        minimize(Mn[x],high[u] + high[x] - 2*high[get(u,x)]);
        x = Pa[x];
    }
}

int getMin(int u)
{
    int x = u;
    int res = INF;
    while (x)
    {
        minimize(res,high[u] + high[x] - 2*high[get(u,x)] + Mn[x]);
        x = Pa[x];
    }

    return res;
}

void solve()
{
    high[0] = -1;
    high[1] = 0;
    H[1] = C(0,1);
    par[1][0] = 0;
    findhigh(1);

    for (int j = 1 ; j <= LOG ; j++)
        for (int i = 1 ; i <= n ; i++)
            par[i][j] = par[par[i][j - 1]][j - 1];
    
    Centroid(1,0);

    memset(Mn,0x3f,sizeof(Mn));

    sort(H + 1 , H + n + 1,greater<ii>());

    int res = 1;
    update(H[1].se);

    for (int i = 2 ; i <= n ; i++)
    {
        int x = H[i].fi;
        int y = H[i].se;
       if (getMin(y) >= k) 
       {
            update(y);
            res++;
       }
    }

    cout << res;
}

__ZuyVuNee
{
    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)
    {
        tk--;
        write();
        solve();
    }
    return 0;
}

Compilation message

catinatree.cpp: In function 'void solve()':
catinatree.cpp:182:13: warning: unused variable 'x' [-Wunused-variable]
  182 |         int x = H[i].fi;
      |             ^
catinatree.cpp: In function 'int main()':
catinatree.cpp:199:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  199 |     freopen(TASK".inp","r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
catinatree.cpp:200:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  200 |     freopen(TASK".out","w",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5716 KB Output is correct
2 Correct 5 ms 5716 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 ms 5716 KB Output is correct
5 Correct 3 ms 5716 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 3 ms 5844 KB Output is correct
8 Correct 4 ms 5716 KB Output is correct
9 Correct 3 ms 5716 KB Output is correct
10 Correct 3 ms 5716 KB Output is correct
11 Correct 3 ms 5716 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 3 ms 5844 KB Output is correct
14 Correct 4 ms 5716 KB Output is correct
15 Correct 4 ms 5836 KB Output is correct
16 Correct 3 ms 5716 KB Output is correct
17 Correct 3 ms 5716 KB Output is correct
18 Correct 3 ms 5716 KB Output is correct
19 Correct 3 ms 5716 KB Output is correct
20 Correct 3 ms 5844 KB Output is correct
21 Correct 5 ms 6100 KB Output is correct
22 Correct 5 ms 5972 KB Output is correct
23 Correct 4 ms 5844 KB Output is correct
24 Correct 3 ms 5844 KB Output is correct
25 Correct 4 ms 5844 KB Output is correct
26 Correct 4 ms 5972 KB Output is correct
27 Correct 4 ms 5972 KB Output is correct
28 Correct 4 ms 6028 KB Output is correct
29 Correct 5 ms 6036 KB Output is correct
30 Correct 4 ms 5972 KB Output is correct
31 Correct 4 ms 6028 KB Output is correct
32 Correct 4 ms 5972 KB Output is correct
33 Correct 4 ms 5972 KB Output is correct
34 Correct 4 ms 6032 KB Output is correct
35 Correct 4 ms 5972 KB Output is correct
36 Correct 5 ms 5972 KB Output is correct
37 Correct 5 ms 5972 KB Output is correct
38 Correct 5 ms 5972 KB Output is correct
39 Correct 7 ms 5972 KB Output is correct
40 Correct 5 ms 6100 KB Output is correct

Subtask #3
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5716 KB Output is correct
2 Correct 5 ms 5716 KB Output is correct
3 Correct 3 ms 5716 KB Output is correct
4 Correct 3 ms 5716 KB Output is correct
5 Correct 3 ms 5716 KB Output is correct
6 Correct 3 ms 5716 KB Output is correct
7 Correct 3 ms 5844 KB Output is correct
8 Correct 4 ms 5716 KB Output is correct
9 Correct 3 ms 5716 KB Output is correct
10 Correct 3 ms 5716 KB Output is correct
11 Correct 3 ms 5716 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 3 ms 5844 KB Output is correct
14 Correct 4 ms 5716 KB Output is correct
15 Correct 4 ms 5836 KB Output is correct
16 Correct 3 ms 5716 KB Output is correct
17 Correct 3 ms 5716 KB Output is correct
18 Correct 3 ms 5716 KB Output is correct
19 Correct 3 ms 5716 KB Output is correct
20 Correct 3 ms 5844 KB Output is correct
21 Correct 5 ms 6100 KB Output is correct
22 Correct 5 ms 5972 KB Output is correct
23 Correct 4 ms 5844 KB Output is correct
24 Correct 3 ms 5844 KB Output is correct
25 Correct 4 ms 5844 KB Output is correct
26 Correct 4 ms 5972 KB Output is correct
27 Correct 4 ms 5972 KB Output is correct
28 Correct 4 ms 6028 KB Output is correct
29 Correct 5 ms 6036 KB Output is correct
30 Correct 4 ms 5972 KB Output is correct
31 Correct 4 ms 6028 KB Output is correct
32 Correct 4 ms 5972 KB Output is correct
33 Correct 4 ms 5972 KB Output is correct
34 Correct 4 ms 6032 KB Output is correct
35 Correct 4 ms 5972 KB Output is correct
36 Correct 5 ms 5972 KB Output is correct
37 Correct 5 ms 5972 KB Output is correct
38 Correct 5 ms 5972 KB Output is correct
39 Correct 7 ms 5972 KB Output is correct
40 Correct 5 ms 6100 KB Output is correct
41 Correct 165 ms 30488 KB Output is correct
42 Correct 319 ms 19392 KB Output is correct
43 Correct 198 ms 19500 KB Output is correct
44 Correct 212 ms 19392 KB Output is correct
45 Correct 187 ms 19392 KB Output is correct
46 Correct 594 ms 33120 KB Output is correct
47 Correct 455 ms 32996 KB Output is correct
48 Correct 495 ms 32996 KB Output is correct
49 Correct 470 ms 33000 KB Output is correct
50 Correct 127 ms 19620 KB Output is correct
51 Correct 127 ms 19656 KB Output is correct
52 Correct 121 ms 19772 KB Output is correct
53 Correct 305 ms 33480 KB Output is correct
54 Correct 301 ms 33456 KB Output is correct
55 Correct 295 ms 33440 KB Output is correct
56 Correct 7 ms 6228 KB Output is correct
57 Correct 42 ms 10248 KB Output is correct
58 Correct 216 ms 26348 KB Output is correct
59 Correct 581 ms 40724 KB Output is correct
60 Correct 181 ms 32124 KB Output is correct
61 Correct 303 ms 31528 KB Output is correct