oj.uz

Submission #819952

# Submission time Handle Problem Language Result Execution time Memory
819952 2023-08-10T16:15:37 Z stefanopulos Zagrade (COI17_zagrade) C++17
40 / 100
 3000 ms 49508 KB 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <bits/stdc++.h>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ldb;
 
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ldb,ldb> pdd;

#define ff(i,a,b) for(int i = a; i <= b; i++)
#define fb(i,b,a) for(int i = b; i >= a; i--)
#define trav(a,x) for(auto& a : x)
 
#define sz(a) (int)(a).size()
#define fi first
#define se second
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

// os.order_of_key(k) the number of elements in the os less than k
// *os.find_by_order(k)  print the k-th smallest number in os(0-based)

const int mod = 1000000007;
const int inf = 1e9 + 5;
const int mxN = 300005; 

int n;
string s;

vector<int> g[mxN];

int cnt[mxN];
bool bio[mxN];
void dfs_cnt(int v, int p){
    cnt[v] = 1;
    for(auto u : g[v]){
        if(u != p && !bio[u]){
            dfs_cnt(u, v);
            cnt[v] += cnt[u];
        }
    }
}

int centroid(int v, int p, int vel){
    for(auto u : g[v]){
        if(u == p || bio[u])continue;
        if(cnt[v] > vel / 2)return centroid(u, v, vel);
    }
    return v;
}

ll br = 0;
vector<int> cuvaj;
map<int,int> kol;

int X = 0; bool f = 0;
void dfs(int v, int p, int sumA, int dlA, int grB, int X, bool f){
    int Y = (s[v] == '(' ? 1 : -1);
    sumA += Y; dlA = min(dlA, sumA); grB = min(0, grB + Y);

    if(dlA >= sumA && kol.count(sumA) == 1)br += kol[sumA];

    if(f == 1){
        if(sumA + X == 0 && min(0, dlA + X) >= 0)br += 1;
        if(sumA + X == 0 && grB >= 0)br += 1;
    }

    if(grB == 0)cuvaj.pb(-(sumA + X));
    for(auto u : g[v]){
        if(u != p && !bio[u]){
            dfs(u, v, sumA, dlA, grB, X, f);
        }
    }


}


void decompose(int v, int p){
    dfs_cnt(v, -1); int cen = centroid(v, -1, cnt[v]);
    bio[cen] = 1; int X = (s[cen] == '(' ? 1 : -1);

    kol.clear(); 
    for(auto u : g[cen]){
        if(u != p && !bio[u]){
            dfs(u, cen, 0, 0, min(0, X), X, 1);
            
            for(auto c : cuvaj)kol[c] += 1;
            cuvaj.clear();

        }
    }

    reverse(all(g[cen]));

    kol.clear(); 
    for(auto u : g[cen]){
        if(u != p && !bio[u]){
            dfs(u, cen, 0, 0, min(0, X), X, 0);
            
            for(auto c : cuvaj)kol[c] += 1;
            cuvaj.clear();

        }
    }

    // reverse(all(g[cen]));
    for(auto u : g[cen]){
        if(u != p && !bio[u]){
            decompose(u, cen);
        }
    }


}

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

    cin >> n >> s;
    s = ' ' + s;
    ff(i,1,n - 1){
        int u, v;
        cin >> u >> v;
        g[u].pb(v);
        g[v].pb(u);
    }

    decompose(1, -1);

    cout << br << '\n';

    return 0;
}
/*



// probati bojenje sahovski
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7364 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7416 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7336 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 6 ms 7432 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 312 ms 42208 KB Output is correct
2 Correct 282 ms 41912 KB Output is correct
3 Correct 356 ms 42000 KB Output is correct
4 Correct 287 ms 41992 KB Output is correct
5 Correct 342 ms 42008 KB Output is correct
6 Correct 406 ms 43088 KB Output is correct
7 Correct 307 ms 42004 KB Output is correct
8 Correct 427 ms 43024 KB Output is correct
9 Correct 300 ms 41924 KB Output is correct
10 Correct 541 ms 49508 KB Output is correct
11 Correct 262 ms 42916 KB Output is correct

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7364 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7416 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7336 KB Output is correct
9 Correct 4 ms 7380 KB Output is correct
10 Correct 6 ms 7432 KB Output is correct
11 Correct 312 ms 42208 KB Output is correct
12 Correct 282 ms 41912 KB Output is correct
13 Correct 356 ms 42000 KB Output is correct
14 Correct 287 ms 41992 KB Output is correct
15 Correct 342 ms 42008 KB Output is correct
16 Correct 406 ms 43088 KB Output is correct
17 Correct 307 ms 42004 KB Output is correct
18 Correct 427 ms 43024 KB Output is correct
19 Correct 300 ms 41924 KB Output is correct
20 Correct 541 ms 49508 KB Output is correct
21 Correct 262 ms 42916 KB Output is correct
22 Correct 775 ms 19588 KB Output is correct
23 Correct 894 ms 19292 KB Output is correct
24 Correct 899 ms 19668 KB Output is correct
25 Correct 807 ms 19364 KB Output is correct
26 Execution timed out 3062 ms 30776 KB Time limit exceeded
27 Halted 0 ms 0 KB -