oj.uz

Submission #480305

# Submission time Handle Problem Language Result Execution time Memory
480305 2021-10-15T15:18:34 Z BERNARB01 Zagrade (COI17_zagrade) C++17
10 / 100
 86 ms 16956 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = (int) 3e5 + 9;

int n;
string a;
vector<int> g[N];

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> a;
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    --u; --v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  if (n <= 1000) {
    function<int(int, int, int)> DFS = [&](int v, int pr, int bal) {
      bal += (a[v] == '(') - (a[v] == ')');
      if (bal < 0) {
        return 0;
      }
      int ret = !bal;
      for (int u : g[v]) {
        if (u == pr) {
          continue;
        }
        ret += DFS(u, v, bal);
      }
      return ret;
    };
    int ans = 0;
    for (int i = 0; i < n; i++) {
      ans += DFS(i, -1, 0);
    }
    cout << ans << '\n';
  } else {
    long long ans = 0;
    vector<pair<char, int>> stk;
    for (int i = 0; i < n; i++) {
      if (a[i] == ')') {
        while (!stk.empty() && stk.back().first == ')') {
          stk.pop_back();
        }
        if (stk.empty()) {
          continue;
        }
        stk.back().first = ')';
        stk.back().second += 1;
        ans += stk.back().second;
      } else {
        if (stk.empty()) {
          stk.push_back({'(', 0});
          continue;
        }
        if (stk.back().first == '(') {
          stk.push_back({'(', 0});
          continue;
        }
        stk.push_back({'(', stk.back().second});
      }
    }
    cout << ans << '\n';
  }
  return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 7388 KB Output is correct
2 Correct 12 ms 7372 KB Output is correct
3 Correct 11 ms 7388 KB Output is correct
4 Correct 8 ms 7372 KB Output is correct
5 Correct 9 ms 7392 KB Output is correct
6 Correct 12 ms 7372 KB Output is correct
7 Correct 12 ms 7388 KB Output is correct
8 Correct 6 ms 7372 KB Output is correct
9 Correct 8 ms 7372 KB Output is correct
10 Correct 8 ms 7372 KB Output is correct

Subtask #2
0 / 30.0

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

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 7388 KB Output is correct
2 Correct 12 ms 7372 KB Output is correct
3 Correct 11 ms 7388 KB Output is correct
4 Correct 8 ms 7372 KB Output is correct
5 Correct 9 ms 7392 KB Output is correct
6 Correct 12 ms 7372 KB Output is correct
7 Correct 12 ms 7388 KB Output is correct
8 Correct 6 ms 7372 KB Output is correct
9 Correct 8 ms 7372 KB Output is correct
10 Correct 8 ms 7372 KB Output is correct
11 Incorrect 86 ms 16956 KB Output isn't correct
12 Halted 0 ms 0 KB -