oj.uz

답안 #860828

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
860828 2023-10-14T13:23:49 Z green_gold_dog Unique Cities (JOI19_ho_t5) C++17
4 / 100
 2000 ms 20544 KB 
//#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

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.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 33 ms 688 KB Output is correct
3 Correct 55 ms 604 KB Output is correct
4 Correct 56 ms 604 KB Output is correct
5 Correct 44 ms 580 KB Output is correct
6 Correct 90 ms 844 KB Output is correct
7 Correct 56 ms 600 KB Output is correct
8 Correct 35 ms 604 KB Output is correct
9 Correct 42 ms 696 KB Output is correct
10 Correct 46 ms 616 KB Output is correct
11 Correct 42 ms 688 KB Output is correct
12 Correct 35 ms 812 KB Output is correct
13 Correct 84 ms 856 KB Output is correct
14 Correct 46 ms 604 KB Output is correct
15 Correct 47 ms 604 KB Output is correct
16 Correct 32 ms 604 KB Output is correct
17 Correct 57 ms 604 KB Output is correct
18 Correct 49 ms 604 KB Output is correct
19 Correct 40 ms 604 KB Output is correct
20 Correct 249 ms 1108 KB Output is correct
21 Correct 90 ms 604 KB Output is correct
22 Correct 36 ms 604 KB Output is correct
23 Correct 45 ms 604 KB Output is correct
24 Correct 40 ms 600 KB Output is correct
25 Correct 40 ms 600 KB Output is correct
26 Correct 42 ms 604 KB Output is correct
27 Correct 176 ms 856 KB Output is correct
28 Correct 121 ms 604 KB Output is correct
29 Correct 60 ms 764 KB Output is correct
30 Correct 33 ms 604 KB Output is correct
31 Correct 101 ms 604 KB Output is correct
32 Correct 68 ms 600 KB Output is correct

Subtask #2
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2029 ms 13432 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2057 ms 20544 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 33 ms 688 KB Output is correct
3 Correct 55 ms 604 KB Output is correct
4 Correct 56 ms 604 KB Output is correct
5 Correct 44 ms 580 KB Output is correct
6 Correct 90 ms 844 KB Output is correct
7 Correct 56 ms 600 KB Output is correct
8 Correct 35 ms 604 KB Output is correct
9 Correct 42 ms 696 KB Output is correct
10 Correct 46 ms 616 KB Output is correct
11 Correct 42 ms 688 KB Output is correct
12 Correct 35 ms 812 KB Output is correct
13 Correct 84 ms 856 KB Output is correct
14 Correct 46 ms 604 KB Output is correct
15 Correct 47 ms 604 KB Output is correct
16 Correct 32 ms 604 KB Output is correct
17 Correct 57 ms 604 KB Output is correct
18 Correct 49 ms 604 KB Output is correct
19 Correct 40 ms 604 KB Output is correct
20 Correct 249 ms 1108 KB Output is correct
21 Correct 90 ms 604 KB Output is correct
22 Correct 36 ms 604 KB Output is correct
23 Correct 45 ms 604 KB Output is correct
24 Correct 40 ms 600 KB Output is correct
25 Correct 40 ms 600 KB Output is correct
26 Correct 42 ms 604 KB Output is correct
27 Correct 176 ms 856 KB Output is correct
28 Correct 121 ms 604 KB Output is correct
29 Correct 60 ms 764 KB Output is correct
30 Correct 33 ms 604 KB Output is correct
31 Correct 101 ms 604 KB Output is correct
32 Correct 68 ms 600 KB Output is correct
33 Execution timed out 2029 ms 13432 KB Time limit exceeded
34 Halted 0 ms 0 KB -