oj.uz

답안 #347207

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
347207 2021-01-12T11:16:42 Z AriaH Cat in a tree (BOI17_catinatree) C++11
100 / 100
 379 ms 47468 KB 
/** bahoone naiar **/

#pragma GCC optimize("O2")
#include <bits/stdc++.h>
using namespace std;

typedef long long                   ll;
typedef long double                 ld;
typedef pair<int,int>               pii;
typedef pair<ll,ll>                 pll;
#define all(x)                      (x).begin(),(x).end()
#define F                           first
#define S                           second
#define Mp                          make_pair
#define fast_io                     ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io                     freopen("in.txt" , "r+" , stdin) ; freopen("out.txt" , "w+" , stdout);
#define endl                        "\n"

const int N = 1e6 + 10;
const ll mod = 1e9 + 7;
const ll mod2 = 998244353;
const ll inf = 8e18;
const int LOG = 22;

ll pw(ll a , ll b, ll M)  { return (!b ? 1 : (b & 1 ? (a * pw(a * a % M, b / 2, M)) % M : pw(a * a % M, b / 2, M))); }

int n, d, dis[N], H[N];

vector < int > G[N];

set < pii > st;

void dfs(int v, int P)
{
    H[v] = H[P] + 1;
    st.insert(Mp(-H[v], v));
    for(auto u : G[v])
    {
	if(u == P) continue;
	dfs(u, v);
    }
}

int main()
{
    scanf("%d%d", &n, &d);
    for(int i = 1; i <= n; i ++)
    {
	dis[i] = 1e9;
    }
    for(int i = 1; i < n; i ++)
    {
	int x;
	scanf("%d", &x);
	G[x + 1].push_back(i + 1);
	G[i + 1].push_back(x + 1);
    }
    dfs(1, 0);
    int tot = 0;
    while(!st.empty())
    {
	int v = st.begin()->S;
	st.erase(st.begin());
	if(dis[v] < d) continue;
	/*for(int i = 1; i <= n; i ++)
	{
	    printf("%d ", dis[i]);
	}
	printf("\n");
	*/
	tot ++;
	dis[v] = 0;
	deque < int > dq;
	dq.push_back(v);
	while(!dq.empty())
	{
	    int cu = dq.front();
	    dq.pop_front();
	    for(auto u : G[cu])
	    {
		if(dis[u] > dis[cu] + 1)
		{
		    dis[u] = dis[cu] + 1;
		    if(dis[u] < d)
		    {
			dq.push_back(u);
		    }
		}
	    }
	}
    }
    printf("%d\n", tot);
    return 0;
}
/*
4 3
0
0
1
*/

Compilation message

catinatree.cpp: In function 'int main()':
catinatree.cpp:46:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   46 |     scanf("%d%d", &n, &d);
      |     ~~~~~^~~~~~~~~~~~~~~~
catinatree.cpp:54:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   54 |  scanf("%d", &x);
      |  ~~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23788 KB Output is correct
2 Correct 17 ms 23916 KB Output is correct
3 Correct 16 ms 23788 KB Output is correct
4 Correct 16 ms 23788 KB Output is correct
5 Correct 17 ms 23788 KB Output is correct
6 Correct 17 ms 23788 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 17 ms 23788 KB Output is correct
9 Correct 17 ms 23788 KB Output is correct
10 Correct 17 ms 23788 KB Output is correct
11 Correct 16 ms 23916 KB Output is correct
12 Correct 17 ms 23788 KB Output is correct
13 Correct 16 ms 23788 KB Output is correct
14 Correct 17 ms 23788 KB Output is correct
15 Correct 16 ms 23788 KB Output is correct
16 Correct 17 ms 23788 KB Output is correct
17 Correct 17 ms 23788 KB Output is correct
18 Correct 16 ms 23788 KB Output is correct
19 Correct 16 ms 23788 KB Output is correct
20 Correct 17 ms 23788 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23788 KB Output is correct
2 Correct 17 ms 23916 KB Output is correct
3 Correct 16 ms 23788 KB Output is correct
4 Correct 16 ms 23788 KB Output is correct
5 Correct 17 ms 23788 KB Output is correct
6 Correct 17 ms 23788 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 17 ms 23788 KB Output is correct
9 Correct 17 ms 23788 KB Output is correct
10 Correct 17 ms 23788 KB Output is correct
11 Correct 16 ms 23916 KB Output is correct
12 Correct 17 ms 23788 KB Output is correct
13 Correct 16 ms 23788 KB Output is correct
14 Correct 17 ms 23788 KB Output is correct
15 Correct 16 ms 23788 KB Output is correct
16 Correct 17 ms 23788 KB Output is correct
17 Correct 17 ms 23788 KB Output is correct
18 Correct 16 ms 23788 KB Output is correct
19 Correct 16 ms 23788 KB Output is correct
20 Correct 17 ms 23788 KB Output is correct
21 Correct 17 ms 24044 KB Output is correct
22 Correct 17 ms 23912 KB Output is correct
23 Correct 19 ms 23788 KB Output is correct
24 Correct 17 ms 23788 KB Output is correct
25 Correct 17 ms 23916 KB Output is correct
26 Correct 17 ms 23916 KB Output is correct
27 Correct 17 ms 23916 KB Output is correct
28 Correct 18 ms 23916 KB Output is correct
29 Correct 17 ms 23916 KB Output is correct
30 Correct 18 ms 23916 KB Output is correct
31 Correct 21 ms 24064 KB Output is correct
32 Correct 17 ms 23916 KB Output is correct
33 Correct 17 ms 23916 KB Output is correct
34 Correct 18 ms 23916 KB Output is correct
35 Correct 17 ms 23916 KB Output is correct
36 Correct 18 ms 23916 KB Output is correct
37 Correct 17 ms 23916 KB Output is correct
38 Correct 17 ms 23916 KB Output is correct
39 Correct 17 ms 23916 KB Output is correct
40 Correct 17 ms 24044 KB Output is correct

Subtask #3
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 16 ms 23788 KB Output is correct
2 Correct 17 ms 23916 KB Output is correct
3 Correct 16 ms 23788 KB Output is correct
4 Correct 16 ms 23788 KB Output is correct
5 Correct 17 ms 23788 KB Output is correct
6 Correct 17 ms 23788 KB Output is correct
7 Correct 17 ms 23916 KB Output is correct
8 Correct 17 ms 23788 KB Output is correct
9 Correct 17 ms 23788 KB Output is correct
10 Correct 17 ms 23788 KB Output is correct
11 Correct 16 ms 23916 KB Output is correct
12 Correct 17 ms 23788 KB Output is correct
13 Correct 16 ms 23788 KB Output is correct
14 Correct 17 ms 23788 KB Output is correct
15 Correct 16 ms 23788 KB Output is correct
16 Correct 17 ms 23788 KB Output is correct
17 Correct 17 ms 23788 KB Output is correct
18 Correct 16 ms 23788 KB Output is correct
19 Correct 16 ms 23788 KB Output is correct
20 Correct 17 ms 23788 KB Output is correct
21 Correct 17 ms 24044 KB Output is correct
22 Correct 17 ms 23912 KB Output is correct
23 Correct 19 ms 23788 KB Output is correct
24 Correct 17 ms 23788 KB Output is correct
25 Correct 17 ms 23916 KB Output is correct
26 Correct 17 ms 23916 KB Output is correct
27 Correct 17 ms 23916 KB Output is correct
28 Correct 18 ms 23916 KB Output is correct
29 Correct 17 ms 23916 KB Output is correct
30 Correct 18 ms 23916 KB Output is correct
31 Correct 21 ms 24064 KB Output is correct
32 Correct 17 ms 23916 KB Output is correct
33 Correct 17 ms 23916 KB Output is correct
34 Correct 18 ms 23916 KB Output is correct
35 Correct 17 ms 23916 KB Output is correct
36 Correct 18 ms 23916 KB Output is correct
37 Correct 17 ms 23916 KB Output is correct
38 Correct 17 ms 23916 KB Output is correct
39 Correct 17 ms 23916 KB Output is correct
40 Correct 17 ms 24044 KB Output is correct
41 Correct 162 ms 40500 KB Output is correct
42 Correct 143 ms 32620 KB Output is correct
43 Correct 165 ms 32492 KB Output is correct
44 Correct 118 ms 32620 KB Output is correct
45 Correct 121 ms 32620 KB Output is correct
46 Correct 323 ms 41304 KB Output is correct
47 Correct 379 ms 41708 KB Output is correct
48 Correct 308 ms 41324 KB Output is correct
49 Correct 308 ms 41452 KB Output is correct
50 Correct 113 ms 33004 KB Output is correct
51 Correct 96 ms 33004 KB Output is correct
52 Correct 96 ms 33004 KB Output is correct
53 Correct 207 ms 42220 KB Output is correct
54 Correct 259 ms 42092 KB Output is correct
55 Correct 196 ms 42092 KB Output is correct
56 Correct 22 ms 24044 KB Output is correct
57 Correct 29 ms 26988 KB Output is correct
58 Correct 73 ms 37996 KB Output is correct
59 Correct 170 ms 47468 KB Output is correct
60 Correct 157 ms 40936 KB Output is correct
61 Correct 244 ms 40300 KB Output is correct