Submission #401694

# Submission time Handle Problem Language Result Execution time Memory
401694 2021-05-10T17:20:36 Z AmineWeslati Cat in a tree (BOI17_catinatree) C++14
11 / 100
1000 ms 5068 KB
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
#define int ll
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

int N,D; 

vi adj[MX];

vi dist;
void dfs(int u){
	for(int v: adj[u]) if(dist[v]==-1){
		dist[v]=dist[u]+1;
		dfs(v);
	}
}

int cnt(int m){
	int ans=0;
	FOR(i,0,N) if((m>>i)&1) ans++;
	return ans; 
}

int32_t main() {
    boost; IO();
    	
    cin>>N>>D;
    FOR(i,1,N){
    	int u=i,v; cin>>v;
    	adj[u].pb(v);
    	adj[v].pb(u);
    }

    int ans=0;
    FOR(m,0,1<<N){
    	bool yes=1;
    	FOR(i,0,N) if((m>>i)&1){
    		dist.assign(N,-1); dist[i]=0;
    		dfs(i);
    		FOR(j,0,N) if(i!=j && (m>>j)&1 && dist[j]<D) yes=0;
    	}
    	if(yes) ckmax(ans,cnt(m));
    }
    cout << ans << endl;

    return 0;
}
//Change your approach 
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 4 ms 5024 KB Output is correct
3 Correct 7 ms 4940 KB Output is correct
4 Correct 8 ms 4940 KB Output is correct
5 Correct 25 ms 4940 KB Output is correct
6 Correct 23 ms 5020 KB Output is correct
7 Correct 100 ms 5012 KB Output is correct
8 Correct 101 ms 4940 KB Output is correct
9 Correct 491 ms 5000 KB Output is correct
10 Correct 484 ms 5012 KB Output is correct
11 Correct 465 ms 4992 KB Output is correct
12 Correct 455 ms 4996 KB Output is correct
13 Correct 219 ms 5060 KB Output is correct
14 Correct 235 ms 4992 KB Output is correct
15 Correct 474 ms 4992 KB Output is correct
16 Correct 525 ms 4940 KB Output is correct
17 Correct 486 ms 5000 KB Output is correct
18 Correct 482 ms 5008 KB Output is correct
19 Correct 505 ms 4996 KB Output is correct
20 Correct 474 ms 4940 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 4 ms 5024 KB Output is correct
3 Correct 7 ms 4940 KB Output is correct
4 Correct 8 ms 4940 KB Output is correct
5 Correct 25 ms 4940 KB Output is correct
6 Correct 23 ms 5020 KB Output is correct
7 Correct 100 ms 5012 KB Output is correct
8 Correct 101 ms 4940 KB Output is correct
9 Correct 491 ms 5000 KB Output is correct
10 Correct 484 ms 5012 KB Output is correct
11 Correct 465 ms 4992 KB Output is correct
12 Correct 455 ms 4996 KB Output is correct
13 Correct 219 ms 5060 KB Output is correct
14 Correct 235 ms 4992 KB Output is correct
15 Correct 474 ms 4992 KB Output is correct
16 Correct 525 ms 4940 KB Output is correct
17 Correct 486 ms 5000 KB Output is correct
18 Correct 482 ms 5008 KB Output is correct
19 Correct 505 ms 4996 KB Output is correct
20 Correct 474 ms 4940 KB Output is correct
21 Execution timed out 1080 ms 5068 KB Time limit exceeded
22 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 4940 KB Output is correct
2 Correct 4 ms 5024 KB Output is correct
3 Correct 7 ms 4940 KB Output is correct
4 Correct 8 ms 4940 KB Output is correct
5 Correct 25 ms 4940 KB Output is correct
6 Correct 23 ms 5020 KB Output is correct
7 Correct 100 ms 5012 KB Output is correct
8 Correct 101 ms 4940 KB Output is correct
9 Correct 491 ms 5000 KB Output is correct
10 Correct 484 ms 5012 KB Output is correct
11 Correct 465 ms 4992 KB Output is correct
12 Correct 455 ms 4996 KB Output is correct
13 Correct 219 ms 5060 KB Output is correct
14 Correct 235 ms 4992 KB Output is correct
15 Correct 474 ms 4992 KB Output is correct
16 Correct 525 ms 4940 KB Output is correct
17 Correct 486 ms 5000 KB Output is correct
18 Correct 482 ms 5008 KB Output is correct
19 Correct 505 ms 4996 KB Output is correct
20 Correct 474 ms 4940 KB Output is correct
21 Execution timed out 1080 ms 5068 KB Time limit exceeded
22 Halted 0 ms 0 KB -