oj.uz

Submission #162792

# Submission time Handle Problem Language Result Execution time Memory
162792 2019-11-09T18:50:59 Z DS007 Zagrade (COI17_zagrade) C++14
0 / 100
 173 ms 58892 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 3e5;
string s;
list<int> adj[N];
int n;
long long ans = 0;
map<int, int> m1, m2;

void dfs(int v, int p = -1, int d = 0) {
    bool check = true;
    for (int i : adj[v]) {
        if (i != p) {
            dfs(i, v, s[v] == ')' ? d + 1 : d - 1);
            if (check) {
                check = false;
                if (s[v] == ')')
                    ans += m1[d], m2[d + 1]++;
                else
                    ans += m2[d], m1[d - 1]++;
            }
        }
    }

    if (check) {
        if (s[v] == ')')
            ans += m1[d], m2[d + 1]++;
        else
            ans += m2[d], m1[d - 1]++;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

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

    int r = -1;
    for (int i = 0; i < n; i++) {
        if (adj[i].size() == 1) {
            r = i;
            break;
        }
    }

    dfs(r);
    cout << ans;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 30.0

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

Subtask #3
0 / 60.0

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