oj.uz

Submission #209711

# Submission time Handle Problem Language Result Execution time Memory
209711 2020-03-15T11:11:14 Z alishahali1382 Zagrade (COI17_zagrade) C++14
100 / 100
 1018 ms 43712 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 300010, LOG=20;

int n, m, k, u, v, x, y, t, a, b;
ll ans;
int A[MAXN];
int sz[MAXN];
bool dead[MAXN];
int cnt[MAXN];
vector<int> G[MAXN];

int dfs1(int node, int par){
	sz[node]=1;
	for (int v:G[node]) if (v!=par && !dead[v]) sz[node]+=dfs1(v, node);
	return sz[node];
}

int Centroid(int node, int par, int n){
	for (int v:G[node]) if (v!=par && !dead[v] && 2*sz[v]>n) return Centroid(v, node, n);
	return node;
}

void dfs2(int node, int par, int sum, int mn){
	mn=min(mn, sum+=A[node]);
	//cerr<<"dfs2 "<<node<<" : "<<sum<<' '<<mn<<endl;
	if (mn==sum) ans+=cnt[-sum];
	for (int v:G[node]) if (!dead[v] && v!=par) dfs2(v, node, sum, mn);
}

void dfs3(int node, int par, int sum, int mn){
	sum+=A[node];
	mn=min(A[node], mn+A[node]);
	mn=min(mn, 0);
	if (!mn) cnt[sum]++;
	for (int v:G[node]) if (!dead[v] && v!=par) dfs3(v, node, sum, mn);
}

void Decompose(int node){
	int root=Centroid(node, node, dfs1(node, node));
	dead[root]=1;
	
	fill(cnt, cnt+sz[node]+1, 0);
	cnt[0]=1;
	for (int v:G[root]) if (!dead[v]){
		dfs2(v, root, A[root], min(0, A[root]));
		dfs3(v, root, 0, 0);
	}
	if (A[root]==-1) ans+=cnt[1];
	reverse(all(G[root]));
	fill(cnt, cnt+sz[node]+1, 0);
	for (int v:G[root]) if (!dead[v]){
		dfs2(v, root, A[root], min(0, A[root]));
		dfs3(v, root, 0, 0);
	}
	
	for (int v:G[root]) if (!dead[v]) Decompose(v);
}


int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n;
	for (int i=1; i<=n; i++){
		char ch;
		cin>>ch;
		A[i]=(ch=='('?+1:-1);
	}
	for (int i=1; i<n; i++){
		cin>>u>>v;
		G[u].pb(v);
		G[v].pb(u);
	}
	
	Decompose(1);
	cout<<ans<<'\n';
	
	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7416 KB Output is correct
2 Correct 10 ms 7416 KB Output is correct
3 Correct 10 ms 7416 KB Output is correct
4 Correct 10 ms 7416 KB Output is correct
5 Correct 11 ms 7416 KB Output is correct
6 Correct 10 ms 7420 KB Output is correct
7 Correct 11 ms 7416 KB Output is correct
8 Correct 10 ms 7544 KB Output is correct
9 Correct 10 ms 7544 KB Output is correct
10 Correct 10 ms 7416 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 467 ms 43512 KB Output is correct
2 Correct 483 ms 43644 KB Output is correct
3 Correct 459 ms 43512 KB Output is correct
4 Correct 509 ms 43512 KB Output is correct
5 Correct 472 ms 43516 KB Output is correct
6 Correct 485 ms 43712 KB Output is correct
7 Correct 476 ms 43640 KB Output is correct
8 Correct 466 ms 43512 KB Output is correct
9 Correct 493 ms 43640 KB Output is correct
10 Correct 457 ms 43640 KB Output is correct
11 Correct 475 ms 43512 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 7416 KB Output is correct
2 Correct 10 ms 7416 KB Output is correct
3 Correct 10 ms 7416 KB Output is correct
4 Correct 10 ms 7416 KB Output is correct
5 Correct 11 ms 7416 KB Output is correct
6 Correct 10 ms 7420 KB Output is correct
7 Correct 11 ms 7416 KB Output is correct
8 Correct 10 ms 7544 KB Output is correct
9 Correct 10 ms 7544 KB Output is correct
10 Correct 10 ms 7416 KB Output is correct
11 Correct 467 ms 43512 KB Output is correct
12 Correct 483 ms 43644 KB Output is correct
13 Correct 459 ms 43512 KB Output is correct
14 Correct 509 ms 43512 KB Output is correct
15 Correct 472 ms 43516 KB Output is correct
16 Correct 485 ms 43712 KB Output is correct
17 Correct 476 ms 43640 KB Output is correct
18 Correct 466 ms 43512 KB Output is correct
19 Correct 493 ms 43640 KB Output is correct
20 Correct 457 ms 43640 KB Output is correct
21 Correct 475 ms 43512 KB Output is correct
22 Correct 1000 ms 24980 KB Output is correct
23 Correct 961 ms 24952 KB Output is correct
24 Correct 957 ms 24952 KB Output is correct
25 Correct 1018 ms 24952 KB Output is correct
26 Correct 603 ms 31096 KB Output is correct
27 Correct 606 ms 28280 KB Output is correct
28 Correct 595 ms 27132 KB Output is correct
29 Correct 453 ms 43512 KB Output is correct
30 Correct 446 ms 43640 KB Output is correct
31 Correct 116 ms 24560 KB Output is correct
32 Correct 448 ms 43616 KB Output is correct