oj.uz

Submission #545223

# Submission time Handle Problem Language Result Execution time Memory
545223 2022-04-04T03:57:50 Z NhatMinh0208 Zagrade (COI17_zagrade) C++14
100 / 100
 1293 ms 85048 KB 
#ifndef CPL_TEMPLATE
#define CPL_TEMPLATE
/*
	Normie's Template v2.5
	Changes:
    Added warning against using pragmas on USACO.
*/
// Standard library in one include.
#include <bits/stdc++.h>
using namespace std;
 
// ordered_set library.
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update>
 
// AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.)
//#include <atcoder/all>
//using namespace atcoder;

//Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 
//File I/O.
#define FILE_IN "cseq.inp"
#define FILE_OUT "cseq.out"
#define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout)
 
//Fast I/O.
#define fio ios::sync_with_stdio(0);cin.tie(0)
#define nfio cin.tie(0)
#define endl "\n"
 
//Order checking.
#define ord(a,b,c) ((a>=b)and(b>=c))
 
//min/max redefines, so i dont have to resolve annoying compile errors.
#define min(a,b) (((a)<(b))?(a):(b))
#define max(a,b) (((a)>(b))?(a):(b))

// Fast min/max assigns to use with AVX.
// Requires g++ 9.2.0.
template<typename T>
__attribute__((always_inline)) void chkmin(T& a, const T& b) {
    a=(a<b)?a:b;
}

template<typename T>
__attribute__((always_inline)) void chkmax(T& a, const T& b) {
    a=(a>b)?a:b;
}
 
//Constants.
#define MOD (ll(998244353))
#define MAX 300001
#define mag 320
const long double PI=3.14159265358979;
 
//Pairs and 3-pairs.
#define p1 first
#define p2 second.first
#define p3 second.second
#define fi first
#define se second
#define pii(element_type) pair<element_type,element_type>
#define piii(element_type) pair<element_type,pii(element_type)>
 
//Quick power of 2.
#define pow2(x) (ll(1)<<x)
 
//Short for-loops.
#define ff(i,__,___) for(int i=__;i<=___;i++)
#define rr(i,__,___) for(int i=__;i>=___;i--)
 
//Typedefs.
#define bi BigInt
typedef long long ll;
typedef long double ld;
typedef short sh;

// Binpow and stuff
ll BOW(ll a, ll x, ll p)
{
	if (!x) return 1;
	ll res=BOW(a,x/2,p);
	res*=res;
	res%=p;
	if (x%2) res*=a;
	return res%p;
}
ll INV(ll a, ll p)
{
	return BOW(a,p-2,p);
}
//---------END-------//
#endif
set<int> gt[300001];
int n,m,i,j,k,t,t1,u,v,a,b,glob;
ll res;
string s;
int l[300001];
int r[300001];
int sz[300001];
int arr[300001];
map<int,int> mpr,mpl;
void prepare(int x, int p) {
	sz[x]=1;
	for (auto g : gt[x]) if (g-p) {
		prepare(g,x);
		sz[x]+=sz[g];
	}
}

void init(int x, int p) {
	if (x==p) {
		if (s[x-1]=='(') arr[x]=1;
		else arr[x]=-1;
		l[x]=min(0,arr[x]);
		r[x]=max(0,arr[x]);
	}
	else {
		if (s[x-1]=='(') arr[x]=arr[p]+1;
		else arr[x]=arr[p]-1;
		l[x]=min(l[p],arr[x]);
		r[x]=max(r[p],arr[x]);
	}
	if (arr[x]==0 && arr[x]==l[x]) res++;
	if (arr[x]==0 && arr[x]==r[x]) res++;
	for (auto g : gt[x]) if (g-p) init(g,x);

}
void calc(int x, int p) {
	if (l[x]==arr[x]) res+=mpr[glob-arr[x]];
	if (r[x]==arr[x]) res+=mpl[glob-arr[x]];
	for (auto g : gt[x]) if (g-p) calc(g,x);
}
void add(int x, int p) {
	if (l[x]==arr[x]) mpl[arr[x]]++;
	if (r[x]==arr[x]) mpr[arr[x]]++;
	for (auto g : gt[x]) if (g-p) add(g,x);
}

void solve(int x) {
	prepare(x,x);
	int rt=x,p=x,a=0;
	while(true) {
		a=0;
		for (auto g : gt[rt]) if (g-p && sz[g]>sz[a]) a=g;
		if (sz[a]*2<=sz[x] && sz[rt]*2>=sz[x]) break;
		else {
			p=rt;
			rt=a;
		}
	}
	init(rt,rt);
	mpr.clear();
	mpl.clear();
	glob=arr[rt];
	for (auto g : gt[rt]) {
		calc(g,rt);
		add(g,rt);
	}
	for (auto g : gt[rt]) {
		gt[g].erase(rt);
		solve(g);
	}
}


int main()
{
	fio;
	cin>>n;
	cin>>s;
	for (i=1;i<n;i++) {
		cin>>u>>v;
		gt[u].insert(v);
		gt[v].insert(u);
	}
	solve(1);
	cout<<res;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14432 KB Output is correct
2 Correct 10 ms 14548 KB Output is correct
3 Correct 11 ms 14548 KB Output is correct
4 Correct 11 ms 14548 KB Output is correct
5 Correct 9 ms 14552 KB Output is correct
6 Correct 9 ms 14548 KB Output is correct
7 Correct 9 ms 14548 KB Output is correct
8 Correct 9 ms 14548 KB Output is correct
9 Correct 9 ms 14544 KB Output is correct
10 Correct 9 ms 14552 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 568 ms 71056 KB Output is correct
2 Correct 801 ms 76636 KB Output is correct
3 Correct 566 ms 71132 KB Output is correct
4 Correct 744 ms 75232 KB Output is correct
5 Correct 547 ms 71132 KB Output is correct
6 Correct 646 ms 72956 KB Output is correct
7 Correct 535 ms 71008 KB Output is correct
8 Correct 629 ms 73104 KB Output is correct
9 Correct 548 ms 71112 KB Output is correct
10 Correct 1096 ms 85020 KB Output is correct
11 Correct 478 ms 71016 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14432 KB Output is correct
2 Correct 10 ms 14548 KB Output is correct
3 Correct 11 ms 14548 KB Output is correct
4 Correct 11 ms 14548 KB Output is correct
5 Correct 9 ms 14552 KB Output is correct
6 Correct 9 ms 14548 KB Output is correct
7 Correct 9 ms 14548 KB Output is correct
8 Correct 9 ms 14548 KB Output is correct
9 Correct 9 ms 14544 KB Output is correct
10 Correct 9 ms 14552 KB Output is correct
11 Correct 568 ms 71056 KB Output is correct
12 Correct 801 ms 76636 KB Output is correct
13 Correct 566 ms 71132 KB Output is correct
14 Correct 744 ms 75232 KB Output is correct
15 Correct 547 ms 71132 KB Output is correct
16 Correct 646 ms 72956 KB Output is correct
17 Correct 535 ms 71008 KB Output is correct
18 Correct 629 ms 73104 KB Output is correct
19 Correct 548 ms 71112 KB Output is correct
20 Correct 1096 ms 85020 KB Output is correct
21 Correct 478 ms 71016 KB Output is correct
22 Correct 1293 ms 47456 KB Output is correct
23 Correct 1241 ms 47696 KB Output is correct
24 Correct 1202 ms 47576 KB Output is correct
25 Correct 1211 ms 47580 KB Output is correct
26 Correct 708 ms 55552 KB Output is correct
27 Correct 773 ms 51820 KB Output is correct
28 Correct 811 ms 50528 KB Output is correct
29 Correct 1068 ms 85044 KB Output is correct
30 Correct 1061 ms 85048 KB Output is correct
31 Correct 257 ms 47528 KB Output is correct
32 Correct 441 ms 70932 KB Output is correct