oj.uz

Submission #781858

# Submission time Handle Problem Language Result Execution time Memory
781858 2023-07-13T12:03:03 Z kshitij_sodani Cats or Dogs (JOI18_catdog) C++14
100 / 100
 594 ms 107144 KB 
#include <bits/stdc++.h>
using namespace std;
#define a first
#define b second
#define pb push_back
typedef long long llo;
//#define endl '\n'


#include "catdog.h"

llo x;
vector<llo> adj[100001];
llo dp[100001][2];
llo it[100001];
llo par[100001];
llo ss[100001];
llo st[100001];
llo par3[100001];
llo n;
vector<vector<vector<llo>>> tree[100001];
vector<llo> pre[100001];

void dfs(llo no,llo par2=-1){
	ss[no]=1;
	par[no]=par2;
	vector<pair<llo,llo>> tt;
	for(auto j:adj[no]){
		if(j!=par2){
			dfs(j,no);
			tt.pb({ss[j],j});
			ss[no]+=ss[j];
		}
	}
	sort(tt.begin(),tt.end());
	adj[no].clear();
	while(tt.size()){
		adj[no].pb(tt.back().b);
		tt.pop_back();
	}
}
llo co=0;

void dfs2(llo no,llo par2=-1){
	par3[no]=no;
	st[no]=co;
	co++;
	if(par2!=-1){
		if(st[no]==st[par2]+1){
			par3[no]=par3[par2];
		}
	}
//	ind[no]=pre[par3[no]].size();
	pre[par3[no]].pb(no);
	vector<llo> kk;
	kk.pb(0);
	kk.pb(0);
	vector<vector<llo>> ll;
	ll.pb(kk);
	ll.pb(kk);
	for(llo i=0;i<4;i++){
		tree[par3[no]].pb(ll);
	}
	for(auto j:adj[no]){
		if(j!=par2){
			dfs2(j,no);
		}
	}
}
void build(llo ind,llo no,llo l,llo r){
	if(l==r){
		tree[ind][no][0][0]=0;
		tree[ind][no][1][1]=0;
		tree[ind][no][1][0]=1e6;
		tree[ind][no][0][1]=1e6;
	}
	else{
		llo mid=(l+r)/2;
		build(ind,no*2+1,l,mid);
		build(ind,no*2+2,mid+1,r);
		tree[ind][no][0][0]=0;
		tree[ind][no][1][1]=0;
		tree[ind][no][1][0]=1e6;
		tree[ind][no][0][1]=1e6;		/*for(llo i=0;i<2;i++){
			for(llo j=0;j<2;j++){
				for(llo l=0;l<2;l++){
					for(llo k=0;k<2;k++){
						llo x=1;
						if(j==l){
							x=0;
						}
						tree[ind][no][i][k]=min(tree[ind][no][i][k],tree[ind][no*2+1][i][j]+tree[ind][no*2+2][l][k]+x);
					}
				}
			}
		}*/

	}
}
void update(llo ind,llo no,llo l,llo r,llo i,llo j){
	if(l==r){
		tree[ind][no][0][0]=dp[j][0];
		tree[ind][no][1][1]=dp[j][1];
		if(it[j]==2){
			//cout<<22<<endl;
			tree[ind][no][0][0]=1e6;
		}
		if(it[j]==1){

			tree[ind][no][1][1]=1e6;
		}
	//	cout<<j<<","<<tree[ind][no][0][0]<<","<<tree[ind][no][1][1]<<endl;
		tree[ind][no][1][0]=1e6;
		tree[ind][no][0][1]=1e6;
	}
	else{
		llo mid=(l+r)/2;
		if(i<=mid){
			update(ind,no*2+1,l,mid,i,j);
		}
		else{
			update(ind,no*2+2,mid+1,r,i,j);
		}
		tree[ind][no][0][0]=1e6;
		tree[ind][no][1][1]=1e6;
		tree[ind][no][1][0]=1e6;
		tree[ind][no][0][1]=1e6;
		for(llo ii=0;ii<2;ii++){
			for(llo jj=0;jj<2;jj++){
				for(llo l=0;l<2;l++){
					for(llo k=0;k<2;k++){
						llo x=0;
						if(jj!=l){
							x++;
						}
						/*if(j==6 and no==0 and  tree[ind][no*2+1][ii][jj]+tree[ind][no*2+2][l][k]+x==0){
							cout<<1111<<endl;
							cout<<ii<<":"<<jj<<":"<<l<<":"<<k<<endl;
						}*/
						tree[ind][no][ii][k]=min(tree[ind][no][ii][k],tree[ind][no*2+1][ii][jj]+tree[ind][no*2+2][l][k]+x);
					}
				}
			}
		}
	/*	if(no==0){
			cout<<tree[ind][no*2+1][0][0]<<"?"<<tree[ind][no*2+2][1][1]<<endl;
		}*/

	}
	/*cout<<no<<":"<<l<<":"<<r<<endl;
	for(int ii=0;ii<2;ii++){
		for(int jj=0;jj<2;jj++){
			cout<<tree[ind][no][ii][jj]<<"<";
		}
		cout<<endl;
	}*/
}
void initialize(int nn, std::vector<int> aa, std::vector<int> bb) {
	n=nn;
	for(llo i=0;i<n-1;i++){
		adj[aa[i]-1].pb(bb[i]-1);
		adj[bb[i]-1].pb(aa[i]-1);
	}
	dfs(0);
	dfs2(0);
	for(llo i=0;i<n;i++){
		if(pre[i].size()){
			build(i,0,0,pre[i].size()-1);
		}
	}
	for(llo i=0;i<n;i++){
		it[i]=0;
		dp[i][0]=0;
		dp[i][1]=0;
	}
}
void apply(llo i){
	//<llo> xx;
 	llo cur=i;
 	while(true){
 		cur=par3[cur];
 		if(cur==0){
 			break;
 		}
 		dp[par[cur]][0]-=min(min(tree[cur][0][0][0],tree[cur][0][0][1]),min(tree[cur][0][1][0],tree[cur][0][1][1])+1);
 		dp[par[cur]][1]-=min(min(tree[cur][0][0][0],tree[cur][0][0][1])+1,min(tree[cur][0][1][0],tree[cur][0][1][1]));
 		cur=par[cur];
 	}
 	update(par3[i],0,0,pre[par3[i]].size()-1,st[i]-st[par3[i]],i);
 //	cout<<i<<"::"<<par3[i]<<endl;
 //	cout<<st[i]-st[par3[i]]<<endl;
 	cur=i;
 	while(true){
 		cur=par3[cur];
 		if(cur==0){
 			break;
 		}
 		dp[par[cur]][0]+=min(min(tree[cur][0][0][0],tree[cur][0][0][1]),min(tree[cur][0][1][0],tree[cur][0][1][1])+1);
 		dp[par[cur]][1]+=min(min(tree[cur][0][0][0],tree[cur][0][0][1])+1,min(tree[cur][0][1][0],tree[cur][0][1][1]));
 		cur=par[cur];
 	//	cout<<11<<endl;
 		update(par3[cur],0,0,pre[par3[cur]].size()-1,st[cur]-st[par3[cur]],cur);
 	}
}
int cat(int i) {
	i--;
	it[i]=1;
	apply(i);
 	//dp[i][1]=1e6;
 //	dfs(0);
 	llo ans=1e6;
 	for(llo i=0;i<2;i++){
 		for(llo j=0;j<2;j++){
 			ans=min(ans,tree[0][0][i][j]);
 		}
 	}
 /*	for(llo i=0;i<n;i++){
 		cout<<dp[i][0]<<","<<dp[i][1]<<endl;
 	}*/
 //	cout<<ans<<endl;
	return ans;
}

int dog(int i) {
	i--;
	it[i]=2;
	apply(i);
 	llo ans=1e6;
 //	cout<<dp[0][0]<<":"<<dp[0][1]<<endl;
 //	cout<<tree[0][0][0][1]<<":::"<<endl;
  	//	cout<<par3[i]<<"::"<<endl;
 	for(llo i=0;i<2;i++){
 		for(llo j=0;j<2;j++){
 			ans=min(ans,tree[0][0][i][j]);
 			//<<tree[0][0][i][j]<<",,";
 		}
 		//cout<<endl;
 	}

 /*	for(llo i=0;i<n;i++){
 		cout<<dp[i][0]<<","<<dp[i][1]<<endl;
 	}*/
 	//cout<<ans<<endl;

	return ans;
}

int neighbor(int i) {
	i--;
	it[i]=0;
	apply(i);
 	llo ans=1e6;
 	for(llo i=0;i<2;i++){
 		for(llo j=0;j<2;j++){
 			ans=min(ans,tree[0][0][i][j]);
 		}
 	}

 	/*for(llo i=0;i<n;i++){
 		cout<<dp[i][0]<<","<<dp[i][1]<<endl;
 	}*/
 	//cout<<ans<<endl;
	return ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7320 KB Output is correct
2 Correct 3 ms 7380 KB Output is correct
3 Correct 5 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 5 ms 7380 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 4 ms 7388 KB Output is correct
13 Correct 4 ms 7280 KB Output is correct
14 Correct 4 ms 7380 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7320 KB Output is correct
2 Correct 3 ms 7380 KB Output is correct
3 Correct 5 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 5 ms 7380 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 4 ms 7388 KB Output is correct
13 Correct 4 ms 7280 KB Output is correct
14 Correct 4 ms 7380 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 7 ms 7856 KB Output is correct
18 Correct 5 ms 8020 KB Output is correct
19 Correct 5 ms 7860 KB Output is correct
20 Correct 4 ms 7508 KB Output is correct
21 Correct 5 ms 7508 KB Output is correct
22 Correct 5 ms 7636 KB Output is correct
23 Correct 5 ms 8020 KB Output is correct
24 Correct 5 ms 7892 KB Output is correct
25 Correct 6 ms 7636 KB Output is correct
26 Correct 4 ms 7636 KB Output is correct
27 Correct 4 ms 7636 KB Output is correct
28 Correct 5 ms 8048 KB Output is correct
29 Correct 5 ms 8148 KB Output is correct
30 Correct 5 ms 7508 KB Output is correct
31 Correct 5 ms 7892 KB Output is correct
32 Correct 5 ms 7508 KB Output is correct

Subtask #3
62.0 / 62.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7320 KB Output is correct
2 Correct 3 ms 7380 KB Output is correct
3 Correct 5 ms 7380 KB Output is correct
4 Correct 3 ms 7380 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 5 ms 7380 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 5 ms 7380 KB Output is correct
11 Correct 4 ms 7380 KB Output is correct
12 Correct 4 ms 7388 KB Output is correct
13 Correct 4 ms 7280 KB Output is correct
14 Correct 4 ms 7380 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 7 ms 7856 KB Output is correct
18 Correct 5 ms 8020 KB Output is correct
19 Correct 5 ms 7860 KB Output is correct
20 Correct 4 ms 7508 KB Output is correct
21 Correct 5 ms 7508 KB Output is correct
22 Correct 5 ms 7636 KB Output is correct
23 Correct 5 ms 8020 KB Output is correct
24 Correct 5 ms 7892 KB Output is correct
25 Correct 6 ms 7636 KB Output is correct
26 Correct 4 ms 7636 KB Output is correct
27 Correct 4 ms 7636 KB Output is correct
28 Correct 5 ms 8048 KB Output is correct
29 Correct 5 ms 8148 KB Output is correct
30 Correct 5 ms 7508 KB Output is correct
31 Correct 5 ms 7892 KB Output is correct
32 Correct 5 ms 7508 KB Output is correct
33 Correct 252 ms 45712 KB Output is correct
34 Correct 183 ms 55680 KB Output is correct
35 Correct 197 ms 32952 KB Output is correct
36 Correct 521 ms 74684 KB Output is correct
37 Correct 55 ms 29900 KB Output is correct
38 Correct 594 ms 82760 KB Output is correct
39 Correct 479 ms 82744 KB Output is correct
40 Correct 517 ms 82704 KB Output is correct
41 Correct 521 ms 82772 KB Output is correct
42 Correct 468 ms 82760 KB Output is correct
43 Correct 488 ms 82704 KB Output is correct
44 Correct 549 ms 82748 KB Output is correct
45 Correct 490 ms 82764 KB Output is correct
46 Correct 560 ms 82788 KB Output is correct
47 Correct 521 ms 82788 KB Output is correct
48 Correct 144 ms 61520 KB Output is correct
49 Correct 169 ms 76576 KB Output is correct
50 Correct 49 ms 20648 KB Output is correct
51 Correct 83 ms 34116 KB Output is correct
52 Correct 32 ms 21168 KB Output is correct
53 Correct 331 ms 81608 KB Output is correct
54 Correct 195 ms 38552 KB Output is correct
55 Correct 367 ms 58004 KB Output is correct
56 Correct 221 ms 40812 KB Output is correct
57 Correct 322 ms 74512 KB Output is correct
58 Correct 62 ms 38812 KB Output is correct
59 Correct 56 ms 31248 KB Output is correct
60 Correct 145 ms 68212 KB Output is correct
61 Correct 167 ms 70604 KB Output is correct
62 Correct 116 ms 59232 KB Output is correct
63 Correct 141 ms 54036 KB Output is correct
64 Correct 128 ms 59748 KB Output is correct
65 Correct 238 ms 91380 KB Output is correct
66 Correct 71 ms 25720 KB Output is correct
67 Correct 183 ms 65584 KB Output is correct
68 Correct 267 ms 93928 KB Output is correct
69 Correct 28 ms 13068 KB Output is correct
70 Correct 8 ms 8080 KB Output is correct
71 Correct 101 ms 45604 KB Output is correct
72 Correct 183 ms 79788 KB Output is correct
73 Correct 321 ms 107144 KB Output is correct
74 Correct 302 ms 93372 KB Output is correct
75 Correct 304 ms 106608 KB Output is correct
76 Correct 287 ms 96060 KB Output is correct
77 Correct 332 ms 93316 KB Output is correct