oj.uz

답안 #974481

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
974481 2024-05-03T11:32:33 Z KasymK Cat in a tree (BOI17_catinatree) C++17
11 / 100
 1000 ms 3928 KB 
#include "bits/stdc++.h"

using namespace std;

const int N = 1e5 + 5;

vector<int> adj[N], vis;

int n, d;
int mx = INT_MIN;

int marked[N], dis[N], vis1[N];

int poz = 0;

int in_yakyn(int x){
	queue <int> q;
	for (int i = 0; i < n; ++i) vis1[i] = dis[i] = 0;
	q.push(x);
	vis1[x] = 1;	
	while(!q.empty()){
		int to = q.front();
		q.pop();
		for (int i : adj[to])
			if (!vis1[i]){
                dis[i] = dis[to] + 1;
                q.push(i);
                vis1[i] = 1;
                if (vis[i])
                    return dis[i];
		    }
	}
}


bool barla(){
    int cnt = count(vis.begin(), vis.end(), 1);
    if(cnt <= 1)
        return 1;
   	for (int i = 0; i < n; ++i)
   		if(vis[i])
   			if(in_yakyn(i) < d)
                return 0; 	
	return 1;
}

int sana(){
	int ret = 0;
	for (int i = 0; i < n; ++i)
		ret += vis[i];
	return ret;
}

void f(int x){
    if(x == n){
        if(barla())
            mx = max(mx, sana());
        return;
    }
    for(int i = 0; i <= 1; ++i){
        vis[x] = i;
        f(x + 1);
    }
}

int main() { 
    scanf("%d%d", &n, &d);
    for(int i = 1; i <= n - 1; ++i) {
        int a;
        scanf("%d", &a);
        adj[a].push_back(i);
        adj[i].push_back(a);
    }
    vis.resize(n);
    f(0);
    printf("%d\n", mx);
    return 0;
}

Compilation message

catinatree.cpp: In function 'bool barla()':
catinatree.cpp:38:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   38 |     if(cnt <= 1)
      |     ^~
catinatree.cpp:40:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   40 |     for (int i = 0; i < n; ++i)
      |     ^~~
catinatree.cpp: In function 'int in_yakyn(int)':
catinatree.cpp:17:14: warning: control reaches end of non-void function [-Wreturn-type]
   17 |  queue <int> q;
      |              ^
catinatree.cpp: In function 'int main()':
catinatree.cpp:67:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   67 |     scanf("%d%d", &n, &d);
      |     ~~~~~^~~~~~~~~~~~~~~~
catinatree.cpp:70:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |         scanf("%d", &a);
      |         ~~~~~^~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3672 KB Output is correct
2 Correct 1 ms 3676 KB Output is correct
3 Correct 2 ms 3676 KB Output is correct
4 Correct 1 ms 3676 KB Output is correct
5 Correct 4 ms 3672 KB Output is correct
6 Correct 2 ms 3676 KB Output is correct
7 Correct 7 ms 3676 KB Output is correct
8 Correct 5 ms 3676 KB Output is correct
9 Correct 119 ms 3752 KB Output is correct
10 Correct 17 ms 3928 KB Output is correct
11 Correct 108 ms 3756 KB Output is correct
12 Correct 64 ms 3928 KB Output is correct
13 Correct 54 ms 3928 KB Output is correct
14 Correct 15 ms 3676 KB Output is correct
15 Correct 17 ms 3672 KB Output is correct
16 Correct 110 ms 3752 KB Output is correct
17 Correct 23 ms 3676 KB Output is correct
18 Correct 17 ms 3676 KB Output is correct
19 Correct 17 ms 3676 KB Output is correct
20 Correct 17 ms 3776 KB Output is correct

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3672 KB Output is correct
2 Correct 1 ms 3676 KB Output is correct
3 Correct 2 ms 3676 KB Output is correct
4 Correct 1 ms 3676 KB Output is correct
5 Correct 4 ms 3672 KB Output is correct
6 Correct 2 ms 3676 KB Output is correct
7 Correct 7 ms 3676 KB Output is correct
8 Correct 5 ms 3676 KB Output is correct
9 Correct 119 ms 3752 KB Output is correct
10 Correct 17 ms 3928 KB Output is correct
11 Correct 108 ms 3756 KB Output is correct
12 Correct 64 ms 3928 KB Output is correct
13 Correct 54 ms 3928 KB Output is correct
14 Correct 15 ms 3676 KB Output is correct
15 Correct 17 ms 3672 KB Output is correct
16 Correct 110 ms 3752 KB Output is correct
17 Correct 23 ms 3676 KB Output is correct
18 Correct 17 ms 3676 KB Output is correct
19 Correct 17 ms 3676 KB Output is correct
20 Correct 17 ms 3776 KB Output is correct
21 Execution timed out 1052 ms 3676 KB Time limit exceeded
22 Halted 0 ms 0 KB -

Subtask #3
0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 3672 KB Output is correct
2 Correct 1 ms 3676 KB Output is correct
3 Correct 2 ms 3676 KB Output is correct
4 Correct 1 ms 3676 KB Output is correct
5 Correct 4 ms 3672 KB Output is correct
6 Correct 2 ms 3676 KB Output is correct
7 Correct 7 ms 3676 KB Output is correct
8 Correct 5 ms 3676 KB Output is correct
9 Correct 119 ms 3752 KB Output is correct
10 Correct 17 ms 3928 KB Output is correct
11 Correct 108 ms 3756 KB Output is correct
12 Correct 64 ms 3928 KB Output is correct
13 Correct 54 ms 3928 KB Output is correct
14 Correct 15 ms 3676 KB Output is correct
15 Correct 17 ms 3672 KB Output is correct
16 Correct 110 ms 3752 KB Output is correct
17 Correct 23 ms 3676 KB Output is correct
18 Correct 17 ms 3676 KB Output is correct
19 Correct 17 ms 3676 KB Output is correct
20 Correct 17 ms 3776 KB Output is correct
21 Execution timed out 1052 ms 3676 KB Time limit exceeded
22 Halted 0 ms 0 KB -