oj.uz

Submission #982469

# Submission time Handle Problem Language Result Execution time Memory
982469 2024-05-14T09:33:50 Z shadow_sami Capital City (JOI20_capital_city) C++17
1 / 100
 408 ms 69888 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
ll a[mx];
vi adj[mx];
ll up[mx];
vi lis[mx];
bool is2[mx];
bool is[mx];
bool mark[mx];
bool cc[mx];
queue<ll> q;
ll sz[mx];
vi v;

void dfs(ll u,ll par){
	v.push_back(u);
	up[u] = par;
	sz[u] = 1;
	fx(adj[u])
		if(x!=par && !mark[x]){
			dfs(x,u);
			sz[u] += sz[x];
		}
	return;
}

ll get(ll u,ll par,ll d){
	fx(adj[u])
		if(x!=par && !mark[x] && 2*sz[x]>d)
			return get(x,u,d);
	return u;
}

void divide(ll u){		
	dfs(u,u);
	u = get(u,u,sz[u]);
	v.clear();
	dfs(u,u);
	mark[u] = 1;
	fx(v)
		cc[x] = 1;
	res = 0;
	q.push(a[u]); 
	f = 1;
	while(q.size()){
		auto it = q.front();        		
		q.pop();
		if(is2[it])
			continue;
		is2[it] = 1;
		res++;
		fx(lis[it]){
			is[x] = 1;
			if(!cc[x]){
				f = 0;
				break;
			}
			if(a[up[x]] != a[x] && !is2[a[up[x]]])
				q.push(a[up[x]]);        			
		}        	
		if(!f)	        		
			break;
	}
	if(f)
		ans = min(ans,res-1);
	fx(v){
		cc[x] = 0;
		is[x] = 0;
		is2[a[x]] = 0;		
	}
	fx(adj[u])
		if(!mark[x])
			divide(x);
	return;	
}



int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
        // freopen("input1.txt", "r", stdin);
        // freopen("output1.txt", "w", stdout);
        // freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m;
        ll sr,de;
        fip(0,n-1){
        	cin>>sr>>de;
        	adj[sr].push_back(de);
        	adj[de].push_back(sr);
        }
        fip(1,n+1)	{
        	cin>>a[i];
        	lis[a[i]].push_back(i);
        }
        ans = 1e18;
        divide(1);
        cout<<ans<<nli;
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 31068 KB Output is correct
2 Correct 6 ms 31068 KB Output is correct
3 Correct 6 ms 31068 KB Output is correct
4 Correct 7 ms 31068 KB Output is correct
5 Correct 6 ms 31064 KB Output is correct
6 Correct 6 ms 31068 KB Output is correct
7 Correct 6 ms 31068 KB Output is correct
8 Correct 6 ms 31068 KB Output is correct
9 Correct 6 ms 31176 KB Output is correct
10 Correct 6 ms 31068 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 31068 KB Output is correct
2 Correct 6 ms 31068 KB Output is correct
3 Correct 6 ms 31068 KB Output is correct
4 Correct 7 ms 31068 KB Output is correct
5 Correct 6 ms 31064 KB Output is correct
6 Correct 6 ms 31068 KB Output is correct
7 Correct 6 ms 31068 KB Output is correct
8 Correct 6 ms 31068 KB Output is correct
9 Correct 6 ms 31176 KB Output is correct
10 Correct 6 ms 31068 KB Output is correct
11 Correct 7 ms 31324 KB Output is correct
12 Correct 7 ms 31192 KB Output is correct
13 Correct 7 ms 31324 KB Output is correct
14 Correct 7 ms 31324 KB Output is correct
15 Correct 7 ms 31324 KB Output is correct
16 Correct 7 ms 31324 KB Output is correct
17 Correct 7 ms 31324 KB Output is correct
18 Correct 7 ms 31324 KB Output is correct
19 Correct 8 ms 31732 KB Output is correct
20 Correct 7 ms 31324 KB Output is correct
21 Correct 7 ms 31324 KB Output is correct
22 Correct 7 ms 31324 KB Output is correct
23 Correct 7 ms 31572 KB Output is correct
24 Correct 7 ms 31324 KB Output is correct
25 Incorrect 7 ms 31324 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 382 ms 64916 KB Output is correct
2 Correct 168 ms 69668 KB Output is correct
3 Correct 347 ms 68796 KB Output is correct
4 Correct 157 ms 69304 KB Output is correct
5 Correct 338 ms 66500 KB Output is correct
6 Correct 165 ms 69888 KB Output is correct
7 Correct 334 ms 65184 KB Output is correct
8 Correct 147 ms 69140 KB Output is correct
9 Incorrect 408 ms 63940 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #4
0 / 59.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 31068 KB Output is correct
2 Correct 6 ms 31068 KB Output is correct
3 Correct 6 ms 31068 KB Output is correct
4 Correct 7 ms 31068 KB Output is correct
5 Correct 6 ms 31064 KB Output is correct
6 Correct 6 ms 31068 KB Output is correct
7 Correct 6 ms 31068 KB Output is correct
8 Correct 6 ms 31068 KB Output is correct
9 Correct 6 ms 31176 KB Output is correct
10 Correct 6 ms 31068 KB Output is correct
11 Correct 7 ms 31324 KB Output is correct
12 Correct 7 ms 31192 KB Output is correct
13 Correct 7 ms 31324 KB Output is correct
14 Correct 7 ms 31324 KB Output is correct
15 Correct 7 ms 31324 KB Output is correct
16 Correct 7 ms 31324 KB Output is correct
17 Correct 7 ms 31324 KB Output is correct
18 Correct 7 ms 31324 KB Output is correct
19 Correct 8 ms 31732 KB Output is correct
20 Correct 7 ms 31324 KB Output is correct
21 Correct 7 ms 31324 KB Output is correct
22 Correct 7 ms 31324 KB Output is correct
23 Correct 7 ms 31572 KB Output is correct
24 Correct 7 ms 31324 KB Output is correct
25 Incorrect 7 ms 31324 KB Output isn't correct
26 Halted 0 ms 0 KB -