Misc/Small_to_large.h

• View this file on GitHub
• Last update: 2025-06-07 01:24:49+07:00
• Link: https://oj.vnoi.info/src/6109008

Depends on

• template.h

Code

#include "../template.h"

const int N = 1e5 + 6;
vector<vector<int>> adj;
vector<int> color;
set<int> cnt[N];
vector<int> ans;

// AC: https://oj.vnoi.info/src/6109008
void dfs(int u, int par) {
    cnt[u].insert(color[u]);
    for (int v : adj[u]) {
        if (v == par) continue;
        dfs(v, u);
        if (cnt[u].size() < cnt[v].size()) {
            cnt[u].swap(cnt[v]);
        }
        for (int i : cnt[v]) {
            cnt[u].insert(i);
        }
    }
    ans[u] = cnt[u].size();
}

#line 2 "template.h"

#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
#define MOD (ll)(1e9+7)
#define all(x) (x).begin(),(x).end()
#define unique(x) x.erase(unique(all(x)), x.end())
#define INF32 ((1ull<<31)-1)
#define INF64 ((1ull<<63)-1)
#define inf (ll)1e18

#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second

const int mod = 998244353;

void solve();

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    // cin.exceptions(cin.failbit);
    // int t; cin >> t;
    // while(t--)
        solve();
    cerr << "\nTime run: " << 1000 * clock() / CLOCKS_PER_SEC << "ms" << '\n';
    return 0;
}
#line 2 "Misc/Small_to_large.h"

const int N = 1e5 + 6;
vector<vector<int>> adj;
vector<int> color;
set<int> cnt[N];
vector<int> ans;

// AC: https://oj.vnoi.info/src/6109008
void dfs(int u, int par) {
    cnt[u].insert(color[u]);
    for (int v : adj[u]) {
        if (v == par) continue;
        dfs(v, u);
        if (cnt[u].size() < cnt[v].size()) {
            cnt[u].swap(cnt[v]);
        }
        for (int i : cnt[v]) {
            cnt[u].insert(i);
        }
    }
    ans[u] = cnt[u].size();
}

Back to top page