oj.uz

Submission #1069032

# Submission time Handle Problem Language Result Execution time Memory
1069032 2024-08-21T14:51:24 Z codexistent Mag (COCI16_mag) C++14
36 / 120
 614 ms 201052 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 1000005
#define FOR(i, a, b) for(ll i = a; i <= b; i++)

ll n, m[MAXN], dp[MAXN][2];
vector<ll> adj[MAXN];
pair<ll, ll> r = {-1, -1};

void dfs(ll v, ll p){
    dp[v][0] = dp[v][1] = -1;

    ll z1 = -1, z2 = -1, o1 = -1;
    for(ll v2 : adj[v]) if(v2 != p) {
        dfs(v2, v);
        if(m[v] >= 3) continue;
        if(dp[v2][0] != -1){
            if(m[v] == 2){
                dp[v][1] = max(dp[v][1], dp[v2][0] + 1);
                if(r.first == -1 || r.first * dp[v][1] > 2 * r.second){
                    r = {2, dp[v][1]};
                }
            }else if(m[v] == 1){
                dp[v][0] = max(dp[v][0], dp[v2][0] + 1);
                if(r.first == -1 || r.first * dp[v][0] > r.second){
                    r = {1, dp[v][0]};
                }
            }

            if(dp[v2][0] > z1) {
                z2 = z1;
                z1 = dp[v2][0];
            }else if(dp[v2][0] > z2){
                z2 = dp[v2][0];
            }
        }
        if(dp[v2][1] != -1){
            if(m[v] == 1){
                dp[v][1] = max(dp[v][1], dp[v2][1] + 1);
                if(r.first == -1 || r.first * dp[v][1] > 2 * r.second){
                    r = {1, dp[v][1]};
                }
            }

            o1 = max(o1, dp[v2][1]);
        }
    }

    if(m[v] == 1){
        // 2 on one side, 1 on the other
        if(r.first == -1 || r.first * (1 + z1 + o1) > 2 * r.second){
            r = {2, 1 + z1 + o1};
        }

        // 1 on both sides
        if(r.first == -1 || r.first * (1 + z1 + z2) > r.second){
            r = {1, 1 + z1 + z2};
        }

        // start own dp[v][0]
        dp[v][0] = max(dp[v][0], 1ll);
    }

    if(m[v] == 2){
        // 1 on both sides
        if(r.first == -1 || r.first * (1 + z1 + z2) > 2 * r.second){
            r = {2, 1 + z1 + z2};
        }
        
        // start own dp[v][1]
        dp[v][1] = max(dp[v][1], 1ll);
    }

    if(m[v] >= 3){
        //cout << "HERE with m[v] = " << m[v] << "!!! " << endl;
        if(r.first == -1 || r.first > m[v] * r.second){
            r = {m[v], 1};
        }
    }
}

int main(){
    cin >> n;
    FOR(i, 1, n - 1) {
        ll a, b;
        cin >> a >> b;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    FOR(i, 1, n) cin >> m[i];

    dfs(1, -1);
    if(r.first == 2 && r.second % 2 == 0) r.first /= 2, r.second /= 2;

    cout << r.first << "/" << r.second << endl;
}

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 23900 KB Output is correct
2 Incorrect 4 ms 23924 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 23936 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 465 ms 125268 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 23900 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 614 ms 201052 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 547 ms 93524 KB Output is correct
2 Incorrect 387 ms 75348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 539 ms 97976 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 82 ms 31316 KB Output is correct
2 Correct 522 ms 94408 KB Output is correct
3 Correct 312 ms 61776 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 507 ms 91296 KB Output is correct
2 Correct 522 ms 94668 KB Output is correct

Subtask #10
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 526 ms 94692 KB Output isn't correct
2 Halted 0 ms 0 KB -