Submission #974502

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
974502	2024-05-03T11:52:56 Z	KasymK	Cat in a tree (BOI17_catinatree)	C++17	Compilation error	0 ms	0 KB

catinatree

#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], see[N];

int in_yakyn(int x){
	for (int i = 0; i < n; ++i)
        see[i] = dis[i] = 0;
	queue<int> q;
    q.push(x);
	see[x] = 1;	
	while(!q.empty()){
		int id = q.front();
		q.pop();
		for (int i : adj[id])
			if (!see[i]){
                dis[i] = dis[id] + 1;
                see[i] = 1;
                if(vis[i])
                    return dis[i];
                q.push(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] and in_yakyn(i) < d)
            return 0; 	
	return 1;
}

void f(int x){
    if(x == n){
        if(barla())
            mx = max(mx, count(vis.begin(), vis.end(), 1));
        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:36:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   36 |     if(cnt <= 1)
      |     ^~
catinatree.cpp:38:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   38 |     for (int i = 0; i < n; ++i)
      |     ^~~
catinatree.cpp: In function 'void f(int)':
catinatree.cpp:47:58: error: no matching function for call to 'max(int&, std::__iterator_traits<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, void>::difference_type)'
   47 |             mx = max(mx, count(vis.begin(), vis.end(), 1));
      |                                                          ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from catinatree.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:254:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  254 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:254:5: note:   template argument deduction/substitution failed:
catinatree.cpp:47:58: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'std::__iterator_traits<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, void>::difference_type' {aka 'long int'})
   47 |             mx = max(mx, count(vis.begin(), vis.end(), 1));
      |                                                          ^
In file included from /usr/include/c++/10/bits/specfun.h:45,
                 from /usr/include/c++/10/cmath:1927,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:41,
                 from catinatree.cpp:1:
/usr/include/c++/10/bits/stl_algobase.h:300:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  300 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algobase.h:300:5: note:   template argument deduction/substitution failed:
catinatree.cpp:47:58: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'std::__iterator_traits<__gnu_cxx::__normal_iterator<int*, std::vector<int> >, void>::difference_type' {aka 'long int'})
   47 |             mx = max(mx, count(vis.begin(), vis.end(), 1));
      |                                                          ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from catinatree.cpp:1:
/usr/include/c++/10/bits/stl_algo.h:3480:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(std::initializer_list<_Tp>)'
 3480 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3480:5: note:   template argument deduction/substitution failed:
catinatree.cpp:47:58: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   47 |             mx = max(mx, count(vis.begin(), vis.end(), 1));
      |                                                          ^
In file included from /usr/include/c++/10/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:65,
                 from catinatree.cpp:1:
/usr/include/c++/10/bits/stl_algo.h:3486:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(std::initializer_list<_Tp>, _Compare)'
 3486 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/10/bits/stl_algo.h:3486:5: note:   template argument deduction/substitution failed:
catinatree.cpp:47:58: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   47 |             mx = max(mx, count(vis.begin(), vis.end(), 1));
      |                                                          ^
catinatree.cpp: In function 'int in_yakyn(int)':
catinatree.cpp:17:13: warning: control reaches end of non-void function [-Wreturn-type]
   17 |  queue<int> q;
      |             ^
catinatree.cpp: In function 'int main()':
catinatree.cpp:57:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |     scanf("%d%d", &n, &d);
      |     ~~~~~^~~~~~~~~~~~~~~~
catinatree.cpp:60:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   60 |         scanf("%d", &a);
      |         ~~~~~^~~~~~~~~~