oj.uz

답안 #700064

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
700064 2023-02-18T15:36:02 Z tamthegod Cat in a tree (BOI17_catinatree) C++17
51 / 100
 1000 ms 35292 KB 
// Make the best become better
// No room for laziness
#include<bits/stdc++.h>

#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n, d;
vector<int> adj[maxN];
int mark[maxN];
int f[maxN];
int depth[maxN];
void ReadInput()
{
    cin >> n >> d;
    for(int i=2; i<=n; i++)
    {
        int p;
        cin >> p;
        p++;
        adj[p].pb(i);
        adj[i].pb(p);
    }
}
void dfs(int u, int par)
{
    for(int v : adj[u])
    {
        if(v == par) continue;
        depth[v] = depth[u] + 1;
        dfs(v, u);
    }
}
void bfs()
{
    queue<int> q;
    fill(f, f + n + 1, oo);
    for(int i=1; i<=n; i++)
    {
        if(mark[i])
        {
            f[i] = 0;
            q.push(i);
        }
    }
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        for(int v : adj[u])
        {
            if(f[v] > f[u] + 1)
            {
                f[v] = f[u] + 1;
                q.push(v);
            }
        }
    }
}
void Solve()
{
    dfs(1, 0);
    int res = 0;
    while(true)
    {
        bfs();
        int id = -1;
        for(int i=1; i<=n; i++)
        {
            if(f[i] < d) continue;
            if(id == -1 || depth[id] < depth[i]) id = i;
        }
        if(id == -1) break;
        res++;
        mark[id] = 1;
    }
    cout << res;
}
int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    ReadInput();
    Solve();
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 11 ms 23812 KB Output is correct
3 Correct 12 ms 23812 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23812 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 12 ms 23828 KB Output is correct
8 Correct 14 ms 23808 KB Output is correct
9 Correct 12 ms 23732 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct
11 Correct 12 ms 23732 KB Output is correct
12 Correct 13 ms 23740 KB Output is correct
13 Correct 12 ms 23712 KB Output is correct
14 Correct 12 ms 23776 KB Output is correct
15 Correct 12 ms 23732 KB Output is correct
16 Correct 12 ms 23892 KB Output is correct
17 Correct 12 ms 23764 KB Output is correct
18 Correct 12 ms 23764 KB Output is correct
19 Correct 11 ms 23796 KB Output is correct
20 Correct 12 ms 23764 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 11 ms 23812 KB Output is correct
3 Correct 12 ms 23812 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23812 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 12 ms 23828 KB Output is correct
8 Correct 14 ms 23808 KB Output is correct
9 Correct 12 ms 23732 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct
11 Correct 12 ms 23732 KB Output is correct
12 Correct 13 ms 23740 KB Output is correct
13 Correct 12 ms 23712 KB Output is correct
14 Correct 12 ms 23776 KB Output is correct
15 Correct 12 ms 23732 KB Output is correct
16 Correct 12 ms 23892 KB Output is correct
17 Correct 12 ms 23764 KB Output is correct
18 Correct 12 ms 23764 KB Output is correct
19 Correct 11 ms 23796 KB Output is correct
20 Correct 12 ms 23764 KB Output is correct
21 Correct 12 ms 23948 KB Output is correct
22 Correct 16 ms 23856 KB Output is correct
23 Correct 13 ms 23764 KB Output is correct
24 Correct 12 ms 23764 KB Output is correct
25 Correct 30 ms 23896 KB Output is correct
26 Correct 16 ms 23892 KB Output is correct
27 Correct 14 ms 23820 KB Output is correct
28 Correct 15 ms 23892 KB Output is correct
29 Correct 22 ms 23816 KB Output is correct
30 Correct 13 ms 23876 KB Output is correct
31 Correct 13 ms 23884 KB Output is correct
32 Correct 12 ms 23892 KB Output is correct
33 Correct 12 ms 23812 KB Output is correct
34 Correct 12 ms 23816 KB Output is correct
35 Correct 12 ms 23892 KB Output is correct
36 Correct 12 ms 23892 KB Output is correct
37 Correct 13 ms 23892 KB Output is correct
38 Correct 12 ms 23892 KB Output is correct
39 Correct 12 ms 23904 KB Output is correct
40 Correct 18 ms 23952 KB Output is correct

Subtask #3
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 11 ms 23812 KB Output is correct
3 Correct 12 ms 23812 KB Output is correct
4 Correct 12 ms 23764 KB Output is correct
5 Correct 12 ms 23812 KB Output is correct
6 Correct 12 ms 23764 KB Output is correct
7 Correct 12 ms 23828 KB Output is correct
8 Correct 14 ms 23808 KB Output is correct
9 Correct 12 ms 23732 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct
11 Correct 12 ms 23732 KB Output is correct
12 Correct 13 ms 23740 KB Output is correct
13 Correct 12 ms 23712 KB Output is correct
14 Correct 12 ms 23776 KB Output is correct
15 Correct 12 ms 23732 KB Output is correct
16 Correct 12 ms 23892 KB Output is correct
17 Correct 12 ms 23764 KB Output is correct
18 Correct 12 ms 23764 KB Output is correct
19 Correct 11 ms 23796 KB Output is correct
20 Correct 12 ms 23764 KB Output is correct
21 Correct 12 ms 23948 KB Output is correct
22 Correct 16 ms 23856 KB Output is correct
23 Correct 13 ms 23764 KB Output is correct
24 Correct 12 ms 23764 KB Output is correct
25 Correct 30 ms 23896 KB Output is correct
26 Correct 16 ms 23892 KB Output is correct
27 Correct 14 ms 23820 KB Output is correct
28 Correct 15 ms 23892 KB Output is correct
29 Correct 22 ms 23816 KB Output is correct
30 Correct 13 ms 23876 KB Output is correct
31 Correct 13 ms 23884 KB Output is correct
32 Correct 12 ms 23892 KB Output is correct
33 Correct 12 ms 23812 KB Output is correct
34 Correct 12 ms 23816 KB Output is correct
35 Correct 12 ms 23892 KB Output is correct
36 Correct 12 ms 23892 KB Output is correct
37 Correct 13 ms 23892 KB Output is correct
38 Correct 12 ms 23892 KB Output is correct
39 Correct 12 ms 23904 KB Output is correct
40 Correct 18 ms 23952 KB Output is correct
41 Execution timed out 1077 ms 35292 KB Time limit exceeded
42 Halted 0 ms 0 KB -