oj.uz

답안 #447164

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
447164 2021-07-24T20:01:13 Z aryan12 Mergers (JOI19_mergers) C++17
10 / 100
 161 ms 39480 KB 
/*
@blue5002's code
*/
#include <iostream>
#include <set>
#include <vector>
#include <set>
using namespace std;
 
const int maxN = 500'000;
 
vector<int> edge[1+maxN];
vector<int> parent(1+maxN, 0);
vector<int> subtree(1+maxN, 1);
vector<int> max_child(1+maxN, -1);
 
int rt = 1;
 
void dfs1(int u)
{
    for(int v: edge[u])
    {
        if(parent[u] == v) continue;
        parent[v] = u;
        dfs1(v);
        subtree[u] += subtree[v];
        if(max_child[u] == -1 || subtree[v] > subtree[ max_child[u] ])
            max_child[u] = v;
    }
}
 
 
 
 
struct state
{
    int i;
    int c;
};
 
bool operator < (state A, state B)
{
    return A.i < B.i;
}
 
int S[1+maxN];
vector<int> state_count(1+maxN, 0);
 
set<state>* T[1+maxN];
 
 
 
void add_state(int u, state x)
{
    // cerr << "add_state " << u << ' ' << x.i << ' ' << x.c << '\n';
    set<state>::iterator it = T[u]->find(x);
    if(it == T[u]->end())
    {
        // cerr << "case A\n";
        if(x.c != state_count[x.i])
            T[u]->insert(x);
    }
    else
    {
        // cerr << "case B\n";
        int ct = it->c + x.c;
        T[u]->erase(it);
        if(ct != state_count[x.i])
        {
            T[u]->insert(state{x.i, ct});
        }
    }
}
 
vector<int> is_bad(1+maxN, 0);
 
vector<int> bad_count(1+maxN, 0);
 
int meeting_point = 0;
 
void dfs2(int u)
{
    // cerr << "dfs2 " << u << ' ' << max_child[u] << '\n';
    if(max_child[u] == -1)
    {
        // cerr << "case 1\n";
        T[u] = new set<state>;
        add_state(u, state{S[u], 1});
    }
    else
    {
        for(int v: edge[u])
        {
            if(v == parent[u]) continue;
            dfs2(v);
        }
 
        // cerr << "case 2\n";
        T[u] = T[ max_child[u] ];
        // cerr << "x\n";
        add_state(u, state{S[u], 1});
        // cerr << "check X\n";
        for(int v: edge[u])
        {
            // cerr << "v = " << v << '\n';
            if(v == parent[u] || v == max_child[u]) continue;
 
            for(state s: *(T[v]))
                add_state(u, s);
 
            T[v]->clear();
        }
    }
 
    int lower_bad_count = 0;;
    for(int v: edge[u])
    {
        if(v == parent[u]) continue;
        lower_bad_count += bad_count[v];
    }
 
    if(T[u]->size() == 0 && u != rt)
    {
        is_bad[u] = 1;
    }
 
    if(lower_bad_count)
    {
        bad_count[u] = lower_bad_count;
    }
    else if(is_bad[u])
    {
        bad_count[u] = 1;
    }
    else
    {
        bad_count[u] = 0;
    }
 
    if(bad_count[u] > bad_count[meeting_point]) meeting_point = u;
    else if(bad_count[u] == bad_count[meeting_point] && subtree[u] < subtree[meeting_point])
        meeting_point = u;
}
 
 
 
 
 
 
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
 
    bad_count[0] = -1;
    subtree[0] = 1e9;
 
    int N, K;
    cin >> N >> K;
 
    for(int i = 1; i <= N-1; i++)
    {
        int A, B;
        cin >> A >> B;
        edge[A].push_back(B);
        edge[B].push_back(A);
    }
 
    for(int i = 1; i <= N; i++)
    {
        cin >> S[i];
        state_count[ S[i] ]++;
    }
 
    if(N == 2)
    {
        if(K == 2) {
          cout << "1\n";
        }
      	else {
          cout << "0\n";
        }
        return 0;
    }
 
    // cerr << "check 0\n";
 
    for(rt = 1; edge[rt].size() == 1; rt++);
 
    parent[rt] = rt;
    dfs1(rt);
 
    // cerr << "check 1\n";
 
    dfs2(rt);
 
    int res = (1 + bad_count[rt])/2;
 
    cout << res << '\n';
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23756 KB Output is correct
2 Correct 14 ms 23756 KB Output is correct
3 Correct 14 ms 23756 KB Output is correct
4 Correct 14 ms 23804 KB Output is correct
5 Correct 16 ms 23764 KB Output is correct
6 Correct 15 ms 23740 KB Output is correct
7 Correct 14 ms 23756 KB Output is correct
8 Correct 14 ms 23756 KB Output is correct
9 Correct 14 ms 23724 KB Output is correct
10 Correct 14 ms 23756 KB Output is correct
11 Correct 14 ms 23756 KB Output is correct
12 Correct 14 ms 23748 KB Output is correct
13 Correct 14 ms 23756 KB Output is correct
14 Correct 14 ms 23828 KB Output is correct
15 Correct 14 ms 23828 KB Output is correct
16 Correct 14 ms 23756 KB Output is correct
17 Correct 14 ms 23756 KB Output is correct
18 Correct 14 ms 23788 KB Output is correct
19 Correct 14 ms 23756 KB Output is correct
20 Correct 14 ms 23740 KB Output is correct
21 Correct 15 ms 23756 KB Output is correct
22 Correct 15 ms 23784 KB Output is correct
23 Correct 14 ms 23756 KB Output is correct
24 Correct 14 ms 23828 KB Output is correct

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23756 KB Output is correct
2 Correct 14 ms 23756 KB Output is correct
3 Correct 14 ms 23756 KB Output is correct
4 Correct 14 ms 23804 KB Output is correct
5 Correct 16 ms 23764 KB Output is correct
6 Correct 15 ms 23740 KB Output is correct
7 Correct 14 ms 23756 KB Output is correct
8 Correct 14 ms 23756 KB Output is correct
9 Correct 14 ms 23724 KB Output is correct
10 Correct 14 ms 23756 KB Output is correct
11 Correct 14 ms 23756 KB Output is correct
12 Correct 14 ms 23748 KB Output is correct
13 Correct 14 ms 23756 KB Output is correct
14 Correct 14 ms 23828 KB Output is correct
15 Correct 14 ms 23828 KB Output is correct
16 Correct 14 ms 23756 KB Output is correct
17 Correct 14 ms 23756 KB Output is correct
18 Correct 14 ms 23788 KB Output is correct
19 Correct 14 ms 23756 KB Output is correct
20 Correct 14 ms 23740 KB Output is correct
21 Correct 15 ms 23756 KB Output is correct
22 Correct 15 ms 23784 KB Output is correct
23 Correct 14 ms 23756 KB Output is correct
24 Correct 14 ms 23828 KB Output is correct
25 Correct 13 ms 23840 KB Output is correct
26 Correct 16 ms 24012 KB Output is correct
27 Correct 16 ms 23960 KB Output is correct
28 Correct 16 ms 24140 KB Output is correct
29 Correct 17 ms 24012 KB Output is correct
30 Correct 17 ms 24008 KB Output is correct
31 Correct 15 ms 23756 KB Output is correct
32 Correct 16 ms 24140 KB Output is correct
33 Correct 14 ms 23764 KB Output is correct
34 Correct 16 ms 24316 KB Output is correct
35 Correct 16 ms 23984 KB Output is correct
36 Incorrect 16 ms 24028 KB Output isn't correct
37 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23756 KB Output is correct
2 Correct 14 ms 23756 KB Output is correct
3 Correct 14 ms 23756 KB Output is correct
4 Correct 14 ms 23804 KB Output is correct
5 Correct 16 ms 23764 KB Output is correct
6 Correct 15 ms 23740 KB Output is correct
7 Correct 14 ms 23756 KB Output is correct
8 Correct 14 ms 23756 KB Output is correct
9 Correct 14 ms 23724 KB Output is correct
10 Correct 14 ms 23756 KB Output is correct
11 Correct 14 ms 23756 KB Output is correct
12 Correct 14 ms 23748 KB Output is correct
13 Correct 14 ms 23756 KB Output is correct
14 Correct 14 ms 23828 KB Output is correct
15 Correct 14 ms 23828 KB Output is correct
16 Correct 14 ms 23756 KB Output is correct
17 Correct 14 ms 23756 KB Output is correct
18 Correct 14 ms 23788 KB Output is correct
19 Correct 14 ms 23756 KB Output is correct
20 Correct 14 ms 23740 KB Output is correct
21 Correct 15 ms 23756 KB Output is correct
22 Correct 15 ms 23784 KB Output is correct
23 Correct 14 ms 23756 KB Output is correct
24 Correct 14 ms 23828 KB Output is correct
25 Correct 15 ms 23752 KB Output is correct
26 Correct 94 ms 39480 KB Output is correct
27 Correct 141 ms 31428 KB Output is correct
28 Correct 16 ms 23992 KB Output is correct
29 Correct 14 ms 23756 KB Output is correct
30 Correct 14 ms 23756 KB Output is correct
31 Correct 108 ms 31356 KB Output is correct
32 Correct 16 ms 24268 KB Output is correct
33 Correct 131 ms 38308 KB Output is correct
34 Correct 161 ms 31420 KB Output is correct
35 Incorrect 16 ms 24012 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 39416 KB Output is correct
2 Correct 76 ms 34788 KB Output is correct
3 Correct 17 ms 23992 KB Output is correct
4 Correct 16 ms 23884 KB Output is correct
5 Correct 16 ms 23828 KB Output is correct
6 Correct 14 ms 23812 KB Output is correct
7 Correct 17 ms 24268 KB Output is correct
8 Correct 116 ms 31264 KB Output is correct
9 Incorrect 16 ms 24136 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 23756 KB Output is correct
2 Correct 14 ms 23756 KB Output is correct
3 Correct 14 ms 23756 KB Output is correct
4 Correct 14 ms 23804 KB Output is correct
5 Correct 16 ms 23764 KB Output is correct
6 Correct 15 ms 23740 KB Output is correct
7 Correct 14 ms 23756 KB Output is correct
8 Correct 14 ms 23756 KB Output is correct
9 Correct 14 ms 23724 KB Output is correct
10 Correct 14 ms 23756 KB Output is correct
11 Correct 14 ms 23756 KB Output is correct
12 Correct 14 ms 23748 KB Output is correct
13 Correct 14 ms 23756 KB Output is correct
14 Correct 14 ms 23828 KB Output is correct
15 Correct 14 ms 23828 KB Output is correct
16 Correct 14 ms 23756 KB Output is correct
17 Correct 14 ms 23756 KB Output is correct
18 Correct 14 ms 23788 KB Output is correct
19 Correct 14 ms 23756 KB Output is correct
20 Correct 14 ms 23740 KB Output is correct
21 Correct 15 ms 23756 KB Output is correct
22 Correct 15 ms 23784 KB Output is correct
23 Correct 14 ms 23756 KB Output is correct
24 Correct 14 ms 23828 KB Output is correct
25 Correct 13 ms 23840 KB Output is correct
26 Correct 16 ms 24012 KB Output is correct
27 Correct 16 ms 23960 KB Output is correct
28 Correct 16 ms 24140 KB Output is correct
29 Correct 17 ms 24012 KB Output is correct
30 Correct 17 ms 24008 KB Output is correct
31 Correct 15 ms 23756 KB Output is correct
32 Correct 16 ms 24140 KB Output is correct
33 Correct 14 ms 23764 KB Output is correct
34 Correct 16 ms 24316 KB Output is correct
35 Correct 16 ms 23984 KB Output is correct
36 Incorrect 16 ms 24028 KB Output isn't correct
37 Halted 0 ms 0 KB -