Submission #860828

#	Time	Username	Problem	Language	Result	Execution time	Memory
860828		green_gold_dog	Unique Cities (JOI19_ho_t5)	C++17	4 / 100	2057 ms	20544 KiB

joi2019_ho_t5

//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void dfs(ll v, ll p, vector<vector<ll>>& tree, vector<pair<ll, ll>>& all, ll h) {
        if (h) {
                all.emplace_back(h, v);
        }
        h++;
        for (auto i : tree[v]) {
                if (i != p) {
                        dfs(i, v, tree, all, h);
                }
        }
}

void solve() {
        ll n, m;
        cin >> n >> m;
        vector<vector<ll>> arr(n);
        for (ll i = 1; i < n; i++) {
                ll a, b;
                cin >> a >> b;
                a--;
                b--;
                arr[a].push_back(b);
                arr[b].push_back(a);
        }
        vector<ll> c(n);
        for (ll i = 0; i < n; i++) {
                cin >> c[i];
                c[i]--;
        }
        for (ll i = 0; i < n; i++) {
                vector<pair<ll, ll>> all;
                dfs(i, i, arr, all, 0);
                vector<ll> col(n, 0);
                for (auto[a, b] : all) {
                        col[a]++;
                }
                set<ll> s;
                for (auto[a, b] : all) {
                        if (col[a] == 1) {
                                s.insert(c[b]);
                        }
                }
                cout << s.size() << '\n';
        }
}

int main() {
        if (IS_FILE) {
                freopen("", "r", stdin);
                freopen("", "w", stdout);
        }
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);
        ll t = 1;
        if (IS_TEST_CASES) {
                cin >> t;
        }
        for (ll i = 0; i < t; i++) {
                solve();
        }
}

Compilation message (stderr)

joi2019_ho_t5.cpp: In function 'int main()':
joi2019_ho_t5.cpp:98:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |                 freopen("", "r", stdin);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~
joi2019_ho_t5.cpp:99:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |                 freopen("", "w", stdout);
      |                 ~~~~~~~^~~~~~~~~~~~~~~~~

• Subtask 1: 4 / 4
• Subtask 2: 0 / 32
• Subtask 3: 0 / 32
• Subtask 4: 0 / 32