제출 #894937

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
894937		vjudge1	Zagrade (COI17_zagrade)	C++11	40 / 100	177 ms	40208 KiB

zagrade

#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 3 * 1e5 + 10;
const ll mod = 1e9 + 7;

ll um(ll a, ll b){
	return ((1LL * a * b) % mod + mod) % mod;
}
ll subr(ll a, ll b){
	return ((1LL * a - b) % mod + mod) % mod;
}
ll add(ll a, ll b){
	return (1LL * a + b) % mod;
}
ll binpow(ll x, ll step){
	ll res = 1LL;
	while(step){
		if(step & 1) res = um(res, x);
		x = um(x, x);
		step /= 2;
	}
	return res;
}
vector <ll> q[N];
bool arr[N];
ll ans, n;
void over(){
	ll cur = 0, mx = 0;
	map<ll, ll> mp;
	for(ll i = 1; i <= n; i++){
		if(arr[i]){
			mp[cur]++;
			cur--;
		} else{
			mp[cur] = 0;
			cur++;
			ans += mp[cur];
		}
	}
	cur = mx = 0;
	map<ll, ll> mp1;
	for(ll i = n; i >= 1; i--){
		if(arr[i]){
			mp1[cur]++;
			cur--;
		} else{
			mp1[cur] = 0;
			cur++;
			ans += mp1[cur];
		}
	}
}
void dfs(ll v, ll p, ll cnt){
	if(cnt == 0) ans++;
	for(auto u : q[v]){
		if(u == p) continue;
		if(arr[u]) dfs(u, v, cnt + 1);
		else{
			if(cnt > 0) dfs(u, v, cnt - 1);
		}
	}
}
void subtask1(){
	for(ll i = 1; i <= n; i++){
		if(arr[i] == true) dfs(i, -1, 1);
	}
}
int main() {
	ios::sync_with_stdio(false);
  	cin.tie(NULL);
	string s;
  	cin >> n >> s;
  	for(ll i = 0; i < n; i++){
  		if(s[i] == '(') arr[i + 1] = true;
  	}
  	for(ll i = 0, a, b; i < n - 1; i++){
  		cin >> a >> b;
  		q[a].pb(b);
  		q[b].pb(a);
  	}
  	if(n <= 1000) subtask1();
  	else over();
  	cout << ans;
  	
  	// subtask1();
  	// cout << ans << endl;
  	// ans = 0;
  	// over();
  	// cout << ans;
  return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 30 / 30
• Subtask 3: 0 / 60