Submission #1076818

#TimeUsernameProblemLanguageResultExecution timeMemory
1076818steveonalexMergers (JOI19_mergers)C++17
0 / 100
56 ms41164 KiB
// #include "aliens.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; #define MASK(i) (1LL << (i)) #define GETBIT(mask, i) (((mask) >> (i)) & 1) #define ALL(v) (v).begin(), (v).end() #define block_of_code if(true) ll max(ll a, ll b){return (a > b) ? a : b;} ll min(ll a, ll b){return (a < b) ? a : b;} ll gcd(ll a, ll b){return __gcd(a, b);} ll lcm(ll a, ll b){return a / gcd(a, b) * b;} ll LASTBIT(ll mask){return (mask) & (-mask);} int pop_cnt(ll mask){return __builtin_popcountll(mask);} int ctz(ull mask){return __builtin_ctzll(mask);} int logOf(ull mask){return 63 - __builtin_clzll(mask);} mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);} double rngesus_d(double l, double r){ double cur = rngesus(0, MASK(60) - 1); cur /= MASK(60) - 1; return l + cur * (r - l); } template <class T1, class T2> bool maximize(T1 &a, T2 b){ if (a < b) {a = b; return true;} return false; } template <class T1, class T2> bool minimize(T1 &a, T2 b){ if (a > b) {a = b; return true;} return false; } template <class T> void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){ for(auto item: container) out << item << separator; out << finish; } template <class T> void remove_dup(vector<T> &a){ sort(ALL(a)); a.resize(unique(ALL(a)) - a.begin()); } const int N = 5e5 + 69, LOG_N = 19; int n, k; int color[N], h[N], parent[N][LOG_N]; vector<int> graph[N]; vector<int> basket[N]; int dp[N], cnt[N]; void dfs(int u, int p){ h[u] = h[p] + 1; for(int j = 1; MASK(j) < h[u]; ++j) parent[u][j] = parent[parent[u][j-1]][j-1]; for(int v: graph[u]) if (v != p){ parent[v][0] = u; dfs(v, u); } } int LCA(int u, int v){ if (h[u] < h[v]) swap(u, v); int diff = h[u] - h[v]; for(int j = 0; j < LOG_N; ++j) if (GETBIT(diff, j)) u = parent[u][j]; if (u == v) return u; for(int j = LOG_N - 1; j>=0; --j) if (parent[u][j] != parent[v][j]){ u = parent[u][j]; v = parent[v][j]; } return parent[u][0]; } void go(int u, int p){ for(int v: graph[u]) if (v != p){ go(v, u); minimize(dp[u], dp[v]); cnt[u] += cnt[v]; } if (u != 1 && dp[u] == h[u]) cnt[u] = 1; } int main(void){ ios::sync_with_stdio(0);cin.tie(0); cout.tie(0); clock_t start = clock(); cin >> n >> k; for(int i = 1; i<n; ++i){ int u, v; cin >> u >> v; graph[u].push_back(v); graph[v].push_back(u); } for(int i = 1; i<=n; ++i){ cin >> color[i]; basket[color[i]].push_back(i); } dfs(1, 0); for(int i = 1; i<=k; ++i) if (basket[i].size()){ int lck = basket[i][0]; for(int j: basket[i]) lck = LCA(lck, j); for(int j: basket[i]) dp[j] = h[lck]; } go(1, 0); cout << (cnt[1]+1)/2 << "\n"; cerr << "Time elapsed: " << clock() - start << " ms\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...