oj.uz

Submission #1085887

# Submission time Handle Problem Language Result Execution time Memory
1085887 2024-09-09T01:30:05 Z underwaterkillerwhale Mergers (JOI19_mergers) C++17
10 / 100
 38 ms 20180 KB 
#include <bits/stdc++.h>
#define ll              long long
#define pii             pair<int,int>
#define pll             pair<ll,ll>
#define rep(i,m,n)      for(int i=(m); i<=(n); i++)
#define reb(i,m,n)      for(int i=(m); i>=(n); i--)
#define iter(id, v)     for(auto id : v)
#define fs              first
#define se              second
#define MP              make_pair
#define pb              push_back
#define bit(msk, i)     ((msk >> i) & 1)
#define SZ(v)           (ll)v.size()
#define ALL(v)          v.begin(),v.end()

using namespace std;

mt19937_64 rd(chrono :: steady_clock :: now ().time_since_epoch().count());
ll Rand (ll l, ll r) { return uniform_int_distribution<ll> (l, r) (rd); }

const int N = 5e5 + 7;
const int Mod = 1e9 + 2022;
const int INF = 1e9;
const ll BASE = 137;
const int szBL = 350;

int n, K;
vector<int> ke[N];
int a[N];
int ccnt[N], num_cpn, tot_cpn[N], num_ok;
int ein[N], nC[N];
pii dp[N];
int res = 0;

void pdfs (int u, int p) {
    static int time_dfs = 0;
    ein[u] = ++time_dfs;
    nC[u] = 1;
    iter (&v, ke[u]) {
        if (v != p) {
            pdfs(v, u);
            nC[u] += nC[v];
        }
    }
}

void Assign (int u, int delta) {
    if (delta == 1) {
        if (ccnt[a[u]] == 0) ++num_cpn;
        ccnt[a[u]]++;
        if (ccnt[a[u]] == tot_cpn[a[u]]) ++num_ok;
    }
    else {
        if (ccnt[a[u]] == tot_cpn[a[u]]) --num_ok;
        ccnt[a[u]]--;
        if (ccnt[a[u]] == 0) --num_cpn;
    }
}

void update (int u, int p, int delta) {
    Assign(u, delta);
    iter (&v, ke[u]) {
        if (v != p) update (v, u, delta);
    }
}

void dfs (int u, int p) {
    int mxV = -1;
    iter (&v, ke[u]) if (v != p && (mxV == -1 || nC[v] > nC[mxV])) mxV = v;
    iter (&v, ke[u]) if (v != p && v != mxV) {
        dfs(v, u);
        update (v, u, -1);
    }
    if (mxV != -1) dfs(mxV, u);
    iter (&v, ke[u]) if (v != p && v != mxV) {
        update(v, u, 1);
    }
    int prv = 0;
    int numP = 0;
    iter (&v, ke[u]) {
        if (v != p) {
            numP += min(prv, dp[v].fs);
            prv = abs(prv - dp[v].fs);
        }
    }
    Assign (u, 1);
    bool okE = 0;
    if (u != 1 && num_ok == num_cpn) okE = 1;
    if (numP == 0) {
        if (prv == 0) dp[u] = {okE, 0};
        else {
            iter (&v, ke[u]) if (v != p && dp[v].fs != 0) {
                dp[u] = dp[v];
            }
            dp[u].se = dp[u].se | okE;
        }
        return;
    }
    if (prv == 0 && numP > 0) {
        --numP;
        prv = 2;
    }
    res += numP;
    dp[u].fs = prv;
}

void solution() {
    cin >> n >> K;
    rep (i, 1, n - 1) {
        int u, v;
        cin >> u >> v;
        ke[u].pb(v);
        ke[v].pb(u);
    }
    rep (i, 1, n) cin >> a[i], tot_cpn[a[i]]++;
    pdfs(1, 0);
    dfs(1, 0);
    if (dp[1].fs <= 1) res += dp[1].fs;
    else res += 1 + dp[1].se;
    cout << res <<"\n";
}

#define file(name) freopen(name".inp","r",stdin); \
freopen(name".out","w",stdout);
int main () {
//    file("c");
    ios_base :: sync_with_stdio(false); cin.tie(0); cout.tie(0);
    int num_Test = 1;
//    cin >> num_Test;
    while (num_Test--)
        solution();
}
/*
no bug +5
9 6
7 6
9 1
2 4
4 5
9 2
8 6
9 3
8 1
3
1
6
4
4
2
5
5
6


*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12208 KB Output is correct
2 Correct 6 ms 12124 KB Output is correct
3 Correct 6 ms 12124 KB Output is correct
4 Correct 6 ms 12124 KB Output is correct
5 Correct 6 ms 12124 KB Output is correct
6 Correct 5 ms 12124 KB Output is correct
7 Correct 5 ms 12124 KB Output is correct
8 Correct 6 ms 12120 KB Output is correct
9 Correct 5 ms 12124 KB Output is correct
10 Correct 5 ms 12216 KB Output is correct
11 Correct 5 ms 12124 KB Output is correct
12 Correct 6 ms 12256 KB Output is correct
13 Correct 6 ms 12124 KB Output is correct
14 Correct 6 ms 12100 KB Output is correct
15 Correct 6 ms 12124 KB Output is correct
16 Correct 6 ms 12124 KB Output is correct
17 Correct 5 ms 12124 KB Output is correct
18 Correct 6 ms 12152 KB Output is correct
19 Correct 5 ms 12120 KB Output is correct
20 Correct 6 ms 12124 KB Output is correct
21 Correct 6 ms 12124 KB Output is correct
22 Correct 5 ms 12124 KB Output is correct
23 Correct 6 ms 12124 KB Output is correct
24 Correct 6 ms 12124 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12208 KB Output is correct
2 Correct 6 ms 12124 KB Output is correct
3 Correct 6 ms 12124 KB Output is correct
4 Correct 6 ms 12124 KB Output is correct
5 Correct 6 ms 12124 KB Output is correct
6 Correct 5 ms 12124 KB Output is correct
7 Correct 5 ms 12124 KB Output is correct
8 Correct 6 ms 12120 KB Output is correct
9 Correct 5 ms 12124 KB Output is correct
10 Correct 5 ms 12216 KB Output is correct
11 Correct 5 ms 12124 KB Output is correct
12 Correct 6 ms 12256 KB Output is correct
13 Correct 6 ms 12124 KB Output is correct
14 Correct 6 ms 12100 KB Output is correct
15 Correct 6 ms 12124 KB Output is correct
16 Correct 6 ms 12124 KB Output is correct
17 Correct 5 ms 12124 KB Output is correct
18 Correct 6 ms 12152 KB Output is correct
19 Correct 5 ms 12120 KB Output is correct
20 Correct 6 ms 12124 KB Output is correct
21 Correct 6 ms 12124 KB Output is correct
22 Correct 5 ms 12124 KB Output is correct
23 Correct 6 ms 12124 KB Output is correct
24 Correct 6 ms 12124 KB Output is correct
25 Incorrect 5 ms 12124 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12208 KB Output is correct
2 Correct 6 ms 12124 KB Output is correct
3 Correct 6 ms 12124 KB Output is correct
4 Correct 6 ms 12124 KB Output is correct
5 Correct 6 ms 12124 KB Output is correct
6 Correct 5 ms 12124 KB Output is correct
7 Correct 5 ms 12124 KB Output is correct
8 Correct 6 ms 12120 KB Output is correct
9 Correct 5 ms 12124 KB Output is correct
10 Correct 5 ms 12216 KB Output is correct
11 Correct 5 ms 12124 KB Output is correct
12 Correct 6 ms 12256 KB Output is correct
13 Correct 6 ms 12124 KB Output is correct
14 Correct 6 ms 12100 KB Output is correct
15 Correct 6 ms 12124 KB Output is correct
16 Correct 6 ms 12124 KB Output is correct
17 Correct 5 ms 12124 KB Output is correct
18 Correct 6 ms 12152 KB Output is correct
19 Correct 5 ms 12120 KB Output is correct
20 Correct 6 ms 12124 KB Output is correct
21 Correct 6 ms 12124 KB Output is correct
22 Correct 5 ms 12124 KB Output is correct
23 Correct 6 ms 12124 KB Output is correct
24 Correct 6 ms 12124 KB Output is correct
25 Incorrect 6 ms 12124 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 19144 KB Output is correct
2 Incorrect 33 ms 20180 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12208 KB Output is correct
2 Correct 6 ms 12124 KB Output is correct
3 Correct 6 ms 12124 KB Output is correct
4 Correct 6 ms 12124 KB Output is correct
5 Correct 6 ms 12124 KB Output is correct
6 Correct 5 ms 12124 KB Output is correct
7 Correct 5 ms 12124 KB Output is correct
8 Correct 6 ms 12120 KB Output is correct
9 Correct 5 ms 12124 KB Output is correct
10 Correct 5 ms 12216 KB Output is correct
11 Correct 5 ms 12124 KB Output is correct
12 Correct 6 ms 12256 KB Output is correct
13 Correct 6 ms 12124 KB Output is correct
14 Correct 6 ms 12100 KB Output is correct
15 Correct 6 ms 12124 KB Output is correct
16 Correct 6 ms 12124 KB Output is correct
17 Correct 5 ms 12124 KB Output is correct
18 Correct 6 ms 12152 KB Output is correct
19 Correct 5 ms 12120 KB Output is correct
20 Correct 6 ms 12124 KB Output is correct
21 Correct 6 ms 12124 KB Output is correct
22 Correct 5 ms 12124 KB Output is correct
23 Correct 6 ms 12124 KB Output is correct
24 Correct 6 ms 12124 KB Output is correct
25 Incorrect 5 ms 12124 KB Output isn't correct
26 Halted 0 ms 0 KB -