oj.uz

Submission #789955

# Submission time Handle Problem Language Result Execution time Memory
789955 2023-07-22T08:13:19 Z 1075508020060209tc Cat in a tree (BOI17_catinatree) C++14
51 / 100
 1000 ms 15392 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,popcnt,sse4,abm")
#include <bits/stdc++.h>
using namespace std;
int n;int D;
vector<int>e[200005];
int dph[200005];
int tak[200005];
void dfs(int nw,int pa){
dph[nw]=dph[pa]+1;
for(int i=0;i<e[nw].size();i++){
    int v=e[nw][i];
    if(v==pa){continue;}
    dfs(v,nw);
}
}
int dis[200005];
void bfs(vector<int>st){
queue<int>q;
for(int i=1;i<=n;i++){
    dis[i]=1e9;
}
for(int i=0;i<st.size();i++){
    q.push(st[i]);
    dis[st[i]]=0;
}
while(q.size()){
    int nw=q.front();
    q.pop();
    for(int i=0;i<e[nw].size();i++){
        int v=e[nw][i];
        if(dis[v]<=n){continue;}
        dis[v]=dis[nw]+1;
        q.push(v);
    }
}
}

signed main()
{
    cin>>n>>D;
    for(int i=2;i<=n;i++){
        int v;
        cin>>v;
        v++;
        e[v].push_back(i);
        e[i].push_back(v);
    }
    dfs(1,0);
    vector<pair<int,int>>seq;
    for(int i=1;i<=n;i++){
        seq.push_back({dph[i],i});
    }
    sort(seq.begin(),seq.end());
    reverse(seq.begin(),seq.end());
    vector<int>ans;
    ans.push_back(seq[0].second);
    for(int i=1;i<seq.size();i++){
        bfs(ans);
        int nw=seq[i].second;
        if(dis[nw]<D){continue;}else{
            ans.push_back(nw);
        }
    }
    cout<<ans.size();

}

Compilation message

catinatree.cpp: In function 'void dfs(int, int)':
catinatree.cpp:11:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 | for(int i=0;i<e[nw].size();i++){
      |             ~^~~~~~~~~~~~~
catinatree.cpp: In function 'void bfs(std::vector<int>)':
catinatree.cpp:23:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 | for(int i=0;i<st.size();i++){
      |             ~^~~~~~~~~~
catinatree.cpp:30:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |     for(int i=0;i<e[nw].size();i++){
      |                 ~^~~~~~~~~~~~~
catinatree.cpp: In function 'int main()':
catinatree.cpp:58:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for(int i=1;i<seq.size();i++){
      |                 ~^~~~~~~~~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5008 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 5020 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 3 ms 5000 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 5008 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 20 ms 5204 KB Output is correct
22 Correct 5 ms 5076 KB Output is correct
23 Correct 4 ms 5004 KB Output is correct
24 Correct 4 ms 4948 KB Output is correct
25 Correct 11 ms 5104 KB Output is correct
26 Correct 10 ms 5076 KB Output is correct
27 Correct 9 ms 4948 KB Output is correct
28 Correct 19 ms 5096 KB Output is correct
29 Correct 19 ms 5076 KB Output is correct
30 Correct 18 ms 5104 KB Output is correct
31 Correct 17 ms 5076 KB Output is correct
32 Correct 16 ms 5076 KB Output is correct
33 Correct 16 ms 5000 KB Output is correct
34 Correct 16 ms 5076 KB Output is correct
35 Correct 15 ms 5088 KB Output is correct
36 Correct 17 ms 5076 KB Output is correct
37 Correct 17 ms 5116 KB Output is correct
38 Correct 17 ms 5112 KB Output is correct
39 Correct 17 ms 5004 KB Output is correct
40 Correct 18 ms 5076 KB Output is correct

Subtask #3
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5008 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 5020 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 3 ms 5000 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 5008 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 20 ms 5204 KB Output is correct
22 Correct 5 ms 5076 KB Output is correct
23 Correct 4 ms 5004 KB Output is correct
24 Correct 4 ms 4948 KB Output is correct
25 Correct 11 ms 5104 KB Output is correct
26 Correct 10 ms 5076 KB Output is correct
27 Correct 9 ms 4948 KB Output is correct
28 Correct 19 ms 5096 KB Output is correct
29 Correct 19 ms 5076 KB Output is correct
30 Correct 18 ms 5104 KB Output is correct
31 Correct 17 ms 5076 KB Output is correct
32 Correct 16 ms 5076 KB Output is correct
33 Correct 16 ms 5000 KB Output is correct
34 Correct 16 ms 5076 KB Output is correct
35 Correct 15 ms 5088 KB Output is correct
36 Correct 17 ms 5076 KB Output is correct
37 Correct 17 ms 5116 KB Output is correct
38 Correct 17 ms 5112 KB Output is correct
39 Correct 17 ms 5004 KB Output is correct
40 Correct 18 ms 5076 KB Output is correct
41 Execution timed out 1082 ms 15392 KB Time limit exceeded
42 Halted 0 ms 0 KB -