oj.uz

Submission #473738

# Submission time Handle Problem Language Result Execution time Memory
473738 2021-09-16T03:57:57 Z ntabc05101 Mag (COCI16_mag) C++14
84 / 120
 786 ms 262148 KB 
#include<bits/stdc++.h>
using namespace std;

const int MAX = 1000000;

bool cmp(const pair<int, int> &a, const pair<int, int> &b) {
  return (long long)a.first * b.second < (long long)a.second * b.first;
}

int p[MAX];
int dpup[MAX], dpdown[MAX];
vector<int> L[MAX], R[MAX];
int lft[MAX], rgt[MAX];
vector<int> adj[MAX];
pair<int, int> res = {1e9, 1};

void dfsdown(int node, int par) {
  L[node].push_back(0);
  for (auto it : adj[node]) {
    if (it != par) {
      dfsdown(it, node);
      lft[it] = (int)L[node].size() - 1;
      L[node].push_back(max(L[node].back(), p[it] == 1 ? dpdown[it] + 1 : 0));
    }
  }

  R[node].push_back(0);
  for (int i = (int)adj[node].size() - 1; i >= 0; i--) {
    int it = adj[node][i];
    if (it != par) {
      rgt[it] = (int)R[node].size() - 1;
      R[node].push_back(max(R[node].back(), p[it] == 1 ? dpdown[it] + 1 : 0));
    }
  }

  dpdown[node] = L[node].back();
}

void dfsup(int node, int par) {
  if (node) {
    dpup[node] = (p[par] == 1 ? (1 + max(dpup[par], max(L[par][lft[node]], R[par][rgt[node]]))) : 0);
  }

  pair<int, int> a = {p[node], 1};
  if (cmp(a, res)) {
    res = a;
  }
  int mx = dpup[node];

  for (auto it : adj[node]) {
    if (it == par) {
      continue;
    }

    int val = (p[it] == 1 ? dpdown[it] + 1 : 0);
    pair<int, int> tmp = {p[node], 1 + mx + val};
    if (cmp(tmp, res)) {
      res = tmp;
    }
    mx = max(mx, val);
    dfsup(it, node);
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);

  int n; cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int a, b; cin >> a >> b;
    a--; b--;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }

  for (int i = 0; i < n; i++) {
    cin >> p[i];
  }

  dfsdown(0, -1);
  dfsup(0, -1);

  int gc = __gcd(res.first, res.second);
  cout << res.first / gc << "/" << res.second / gc << endl;

  return 0;
}

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 70852 KB Output is correct
2 Correct 39 ms 70780 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 70900 KB Output is correct
2 Correct 38 ms 70796 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 586 ms 205836 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 70768 KB Output is correct
2 Runtime error 574 ms 262148 KB Execution killed with signal 9

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Runtime error 555 ms 262148 KB Execution killed with signal 9

Subtask #6
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 654 ms 183732 KB Output is correct
2 Correct 510 ms 154148 KB Output is correct

Subtask #7
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 617 ms 187244 KB Output is correct
2 Correct 169 ms 82756 KB Output is correct
3 Runtime error 556 ms 262148 KB Execution killed with signal 9

Subtask #8
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 172 ms 82820 KB Output is correct
2 Correct 645 ms 184532 KB Output is correct
3 Correct 696 ms 129484 KB Output is correct

Subtask #9
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 605 ms 176260 KB Output is correct
2 Correct 687 ms 182312 KB Output is correct

Subtask #10
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 669 ms 185052 KB Output is correct
2 Correct 786 ms 129412 KB Output is correct