oj.uz

Submission #241471

# Submission time Handle Problem Language Result Execution time Memory
241471 2020-06-24T08:33:43 Z Vimmer Mag (COCI16_mag) C++14
108 / 120
 641 ms 223584 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 1000501
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9


using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 3> a3;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


int a[N];

ll f[N];

ld ans = -1;

ll l, r;

vector <int> g[N];

void dfs(int v, int p)
{
    if (ans == -1 || ans - ld(a[v]) > 0) {ans = a[v]; l = a[v]; r = 1;}

    if (a[v] == 1) f[v] = 1;

    for (auto it : g[v])
    {
        if (it == p) continue;

        dfs(it, v);

        if (a[v] != 1) continue;

        f[v] = max(f[v], 1 + f[it]);
    }
}

void rec(int v, int p, int koler)
{
    vector <int> pr; pr.clear();

    for (auto it : g[v])
    {
        if (it == p) continue;

        pr.pb(f[it]);
    }

    sort(pr.begin(), pr.end());

    reverse(pr.begin(), pr.end());

    if (sz(pr) > 1)
    {
        ll sum = a[v], kol = pr[0] + pr[1] + 1;

        ld val = ld(sum) / ld(kol);

        if (ans == -1 || ans - val > 0) {ans = val; l = sum; r = kol;}
    }

    if (sz(pr) > 0)
    {
        ll sum = a[v], kol = koler + pr[0] + 1;

        ld val = ld(sum) / ld(kol);

        if (ans == -1 || ans - val > 0) {ans = val; l = sum; r = kol;}
    }

    for (auto it : g[v])
    {
        if (it == p) continue;

        rec(it, v, (a[v] == 1 ? koler + 1 : 0));
    }
}

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;

    cin >> n;

    for (int i = 1; i < n; i++)
    {
        int x, y;

        cin >> x >> y;

        g[x].pb(y);

        g[y].pb(x);
    }

    for (int i = 1; i <= n; i++)  cin >> a[i];

    dfs(1, -1);

    rec(1, -1, 0);

    ll gcd = __gcd(l, r);

    l /= gcd;

    r /= gcd;

    cout << l << "/" << r << endl;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 19 ms 23936 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 23936 KB Output is correct
2 Correct 19 ms 23936 KB Output is correct

Subtask #3
0 / 12.0

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

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 23936 KB Output is correct
2 Correct 628 ms 221644 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 615 ms 218568 KB Output is correct

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 490 ms 66736 KB Output is correct
2 Correct 361 ms 55888 KB Output is correct

Subtask #7
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 460 ms 70888 KB Output is correct
2 Correct 87 ms 28280 KB Output is correct
3 Correct 641 ms 223584 KB Output is correct

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 93 ms 28280 KB Output is correct
2 Correct 479 ms 68088 KB Output is correct
3 Correct 393 ms 46072 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 437 ms 65984 KB Output is correct
2 Correct 484 ms 66448 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 502 ms 67832 KB Output is correct
2 Correct 391 ms 45944 KB Output is correct