oj.uz

답안 #257201

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
257201 2020-08-03T19:57:49 Z b00n0rp Cat in a tree (BOI17_catinatree) C++17
100 / 100
 714 ms 66024 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,fma")
*/ 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <bits/stdc++.h>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, 
// tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
/*
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
*/
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cout << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MX = 200005;
const int SQRTN = 1003;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
// -----------------------</Consts>-----------------------
/*
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
*/
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // comment when using scanf,printf
    FAST_IO
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES)
    // cin >> t;
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM)
        // printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n,d;
int par[MX][LOGN];
vi adj[MX];
bitset<MX> vis;
int sz[MX],dep[MX];

int tot;

int cenpar[MX];
int closest[MX];

void dfs1(int u,int p,int de = 0){
	sz[u] = 1;
	dep[u] = de;
	for(auto v:adj[u]){
		if(v != p and vis[v] == 0){
			dfs1(v,u,de+1);
			sz[u] += sz[v];
		}
	}
	tot++;
}

int find_centroid(int u,int p){
	for(auto v:adj[u]){
		if(v != p and vis[v] == 0 and sz[v]*2 > tot) return find_centroid(v,u);
	}
	return u;
}

void centroid_decomposition(int u,int prev = -1){
	tot = 0;
	dfs1(u,u);
	int cen = find_centroid(u,u);
	// trace(u,cen);
	cenpar[cen] = prev;
	vis[cen] = 1;
	for(auto v:adj[cen]){
		if(!vis[v]) centroid_decomposition(v,cen);
	}
}

int lca(int u,int v){
	if(dep[u] > dep[v]) swap(u,v);
	FORD(j,LOGN-1,0){
		if(dep[v]-(1<<j) >= dep[u]) v = par[v][j];
	}
	if(u == v) return u;
	FORD(j,LOGN-1,0){
		if(par[u][j] != par[v][j]){
			u = par[u][j];
			v = par[v][j];
		}
	}
	return par[u][0];
}
 
int dist(int u,int v){
	// trace(u,v,dep[u]+dep[v]-2*dep[lca(u,v)]);
	return dep[u]+dep[v]-2*dep[lca(u,v)];
}

void solvethetestcase(){
    cin >> n >> d;
    FOR(i,1,n){
    	cin >> par[i][0];
    	adj[par[i][0]].pb(i);
    	adj[i].pb(par[i][0]);
    }
    FOR(j,1,LOGN){
    	REP(i,n) par[i][j] = par[par[i][j-1]][j-1];
    }
    centroid_decomposition(0);
    vis.reset();
    dfs1(0,0);

    vpii order;
    REP(i,n){
    	order.pb({-dep[i],i});
    	closest[i] = INF;
    	// trace(i,cenpar[i]);
    }
    sort(all(order));
    int ans = 0;
    for(auto x:order){
    	int u = x.S;
    	int mn = INF,cur = u;
    	while(cur != -1){
    		// trace(cur);
    		remin(mn,dist(cur,u)+closest[cur]);
    		cur = cenpar[cur];
    	}
    	// trace(u,mn);
    	if(mn >= d){
    		ans ++;
    		cur = u;
    		while(cur != -1){
    			// trace(cur);
    			remin(closest[cur],dist(cur,u));
    			cur = cenpar[cur];
    		}
    	}
    }
    cout << ans << "\n";
}

Subtask #1
11.0 / 11.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5120 KB Output is correct
2 Correct 3 ms 5120 KB Output is correct
3 Correct 3 ms 5120 KB Output is correct
4 Correct 3 ms 5120 KB Output is correct
5 Correct 3 ms 5120 KB Output is correct
6 Correct 3 ms 5120 KB Output is correct
7 Correct 3 ms 5120 KB Output is correct
8 Correct 3 ms 5120 KB Output is correct
9 Correct 3 ms 5120 KB Output is correct
10 Correct 3 ms 5248 KB Output is correct
11 Correct 3 ms 5120 KB Output is correct
12 Correct 3 ms 5120 KB Output is correct
13 Correct 3 ms 5120 KB Output is correct
14 Correct 4 ms 5120 KB Output is correct
15 Correct 4 ms 5120 KB Output is correct
16 Correct 4 ms 5120 KB Output is correct
17 Correct 3 ms 5120 KB Output is correct
18 Correct 5 ms 5120 KB Output is correct
19 Correct 3 ms 5120 KB Output is correct
20 Correct 4 ms 5120 KB Output is correct
21 Correct 5 ms 5632 KB Output is correct
22 Correct 4 ms 5248 KB Output is correct
23 Correct 4 ms 5248 KB Output is correct
24 Correct 4 ms 5248 KB Output is correct
25 Correct 5 ms 5376 KB Output is correct
26 Correct 4 ms 5376 KB Output is correct
27 Correct 4 ms 5376 KB Output is correct
28 Correct 5 ms 5504 KB Output is correct
29 Correct 5 ms 5504 KB Output is correct
30 Correct 5 ms 5504 KB Output is correct
31 Correct 5 ms 5504 KB Output is correct
32 Correct 5 ms 5504 KB Output is correct
33 Correct 5 ms 5504 KB Output is correct
34 Correct 4 ms 5504 KB Output is correct
35 Correct 5 ms 5504 KB Output is correct
36 Correct 6 ms 5504 KB Output is correct
37 Correct 5 ms 5504 KB Output is correct
38 Correct 7 ms 5504 KB Output is correct
39 Correct 6 ms 5504 KB Output is correct
40 Correct 5 ms 5632 KB Output is correct
41 Correct 256 ms 55268 KB Output is correct
42 Correct 307 ms 31724 KB Output is correct
43 Correct 254 ms 31596 KB Output is correct
44 Correct 281 ms 31724 KB Output is correct
45 Correct 281 ms 31600 KB Output is correct
46 Correct 714 ms 58220 KB Output is correct
47 Correct 565 ms 58088 KB Output is correct
48 Correct 580 ms 58100 KB Output is correct
49 Correct 578 ms 58344 KB Output is correct
50 Correct 150 ms 31980 KB Output is correct
51 Correct 149 ms 31980 KB Output is correct
52 Correct 150 ms 31980 KB Output is correct
53 Correct 344 ms 58604 KB Output is correct
54 Correct 333 ms 58604 KB Output is correct
55 Correct 340 ms 58604 KB Output is correct
56 Correct 7 ms 5888 KB Output is correct
57 Correct 44 ms 12416 KB Output is correct
58 Correct 254 ms 38304 KB Output is correct
59 Correct 673 ms 66024 KB Output is correct
60 Correct 209 ms 56296 KB Output is correct
61 Correct 511 ms 55516 KB Output is correct