oj.uz

Submission #246051

# Submission time Handle Problem Language Result Execution time Memory
246051 2020-07-08T05:56:03 Z Vladikus004 Mag (COCI16_mag) C++14
108 / 120
 695 ms 227832 KB 
#include <bits/stdc++.h>
#define int long long
//#pragma comment(linker, "/STACK:6666777216")
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair <int, int> pii;

const int N = 1000000 + 3;
int n, z[N], p[N], udp[N], ddp[N];
vector <vector <int> > v, mx;

void udfs(int x){
    p[x] = 1;
//    cout << x << " " << v[x].size() << "\n";
//    cout << p[v[x][0]] << " " << p[v[x][1]] << "!!!\n";
//    if ( x == 432518) {
//        exit(0);
//    }
    for (auto u: v[x]){
        if (p[u]) continue;
        udfs(u);
        mx[x].push_back(udp[u]);
        udp[x] = max(udp[x], udp[u]);
    }
    if (z[x] == 1) udp[x]++;
    else udp[x] = 0;
    if (mx[x].size()){
    sort(all(mx[x]));
    reverse(all(mx[x]));
    }
}

int ans ;
int e_ans ;
int mn = inf;

void ddfs(int x, int way){
    p[x] = 1;
    mn = min(mn, z[x]);
    e_ans = max(e_ans, way);
    if (z[x] == 2){
        if (!mx[x].empty()){
        vector <int> buff;
        buff.push_back(way);
        buff.push_back(mx[x][0]);
        if (mx[x].size() > 1)
        buff.push_back(mx[x][1]);
        sort(all(buff));
        ans = max(ans, buff[(buff.size() - 1) / 2] * 2 + 1);
        }
    }
    for (auto u: v[x]){
        if (p[u]) continue;
        if (z[x] != 1) {
            ddfs(u, 0);
            continue;
        }
        e_ans = max(e_ans, udp[u]);
        if (udp[u] == mx[x][0]){
            if (mx[x].size() > 1)
            ddfs(u, max(way + 1, mx[x][1]));
            else ddfs(u, way + 1);
        }else{
            ddfs(u, max(way + 1, mx[x][0]));
        }
    }
    if (mx[x].size()){
    int t = mx[x][0];
    if (mx[x].size() > 1) t += mx[x][1];
    if (z[x] == 1) e_ans = max(e_ans, t + 1);
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    #ifdef LOCAL
        freopen("input.txt", "r", stdin);
    #endif // LOCAL
    cin >> n;
    v.resize(n);
    mx.resize(n);
    for (int i = 0; i < n - 1; i++){
        int a, b;
        cin >> a >> b;
        --a; --b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    for (int i = 0; i < n; i++) cin >> z[i];
    udfs(0);
    memset(p, 0, sizeof p);
    ddfs(0, 0);
    if (ans){
        if (e_ans * 2 < ans)
            cout << "2/"<<ans;
        else
            cout << "1/"<<e_ans;
    }else
    if (e_ans){
        cout << "1/"<<e_ans;
    }else
        cout << mn<<"/1";
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8320 KB Output is correct
2 Correct 9 ms 8320 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8320 KB Output is correct
2 Correct 9 ms 8320 KB Output is correct

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 485 ms 146856 KB Output isn't correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8192 KB Output is correct
2 Correct 695 ms 226012 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 638 ms 223980 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 556 ms 134468 KB Output is correct
2 Correct 401 ms 100984 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 538 ms 128096 KB Output is correct
2 Correct 103 ms 21240 KB Output is correct
3 Correct 620 ms 227832 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 21368 KB Output is correct
2 Correct 538 ms 135164 KB Output is correct
3 Correct 523 ms 69240 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 488 ms 122896 KB Output is correct
2 Correct 548 ms 132728 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 547 ms 135932 KB Output is correct
2 Correct 501 ms 68992 KB Output is correct