oj.uz

Submission #743748

# Submission time Handle Problem Language Result Execution time Memory
743748 2023-05-17T22:25:38 Z nvujica Zagrade (COI17_zagrade) C++14
100 / 100
 277 ms 75120 KB 
#include <bits/stdc++.h>

#define ll long long
#define fi first
#define se second

using namespace std;

const int maxn = 3e5 + 10;

int n;
ll sol;
int a[maxn];
set <pair<int, int> > s[maxn];
vector <int> v[maxn];
int d[maxn];

void spoji(int x, int y){
//	cout << x << ' ' << y << endl;
	
	auto it = s[y].lower_bound({-d[y] - a[x], 0});
	if(it != s[y].end() && (*it).fi == -d[y] - a[x]) s[y].erase(it);
	
	//cout << "jos sam tu" << endl;
	
	int y2 = y;
	
	if(s[x].size() < s[y].size()){
		swap(s[x], s[y]);
		swap(d[x], d[y]);
		y2 = x;
	}
	
	vector <pair<int, int> > t;
	
	while(!s[y].empty()){
		//cout << "tu sam" << endl;
		
		int br = s[y].begin() -> fi;
		int cnt = s[y].begin() -> se;
		s[y].erase(s[y].begin());
		t.push_back({br, cnt});
		
		auto it = s[x].lower_bound({-(br + d[y]) - d[x], 0});
		if(it != s[x].end() && (*it).fi == -(br + d[y]) - d[x]){
			sol += cnt * (*it).se;
			
//			cout << x << ' ' << y << ' ' << cnt << ' ' << (*it).se << endl;
		}
	}
	
	d[y2] += a[x];
	
	for(int i = 0; i < t.size(); i++){
		int br = t[i].fi;
		int cnt = t[i].se;
		
		//cout << br << ' ' << cnt;
		
		auto it = s[x].lower_bound({br + d[y] - d[x], 0});
		if(it != s[x].end() && (*it).fi == br + d[y] - d[x]){
			cnt += (*it).se;
			s[x].erase(it);
		}
		
		s[x].insert({br + d[y] - d[x], cnt});
	}
}

void rek(int x, int p){
	s[x].insert({2 * a[x], 1});
	
	for(int i = 0; i < v[x].size(); i++){
		int x2 = v[x][i];
		
		if(x2 == p) continue;
		
		rek(x2, x);
		
		spoji(x, x2);
	}
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	cin >> n;
	
	for(int i = 1; i <= n; i++){
		char c;
		cin >> c;
		
		if(c == '(') a[i] = 1; 
		else a[i] = -1; 
	}
	
	for(int i = 0; i < n - 1; i++){
		int x, y;
		cin >> x >> y;
		
		v[x].push_back(y);
		v[y].push_back(x);
	}
	
	rek(1, 0);
	
	cout << sol;

	return 0;
}

Compilation message

zagrade.cpp: In function 'void spoji(int, int)':
zagrade.cpp:54:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   54 |  for(int i = 0; i < t.size(); i++){
      |                 ~~^~~~~~~~~~
zagrade.cpp: In function 'void rek(int, int)':
zagrade.cpp:73:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   73 |  for(int i = 0; i < v[x].size(); i++){
      |                 ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21460 KB Output is correct
2 Correct 11 ms 21460 KB Output is correct
3 Correct 13 ms 21416 KB Output is correct
4 Correct 11 ms 21420 KB Output is correct
5 Correct 11 ms 21460 KB Output is correct
6 Correct 12 ms 21476 KB Output is correct
7 Correct 12 ms 21460 KB Output is correct
8 Correct 12 ms 21460 KB Output is correct
9 Correct 15 ms 21460 KB Output is correct
10 Correct 11 ms 21476 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 190 ms 74964 KB Output is correct
2 Correct 210 ms 74956 KB Output is correct
3 Correct 190 ms 74916 KB Output is correct
4 Correct 207 ms 74864 KB Output is correct
5 Correct 193 ms 74876 KB Output is correct
6 Correct 212 ms 74828 KB Output is correct
7 Correct 204 ms 75120 KB Output is correct
8 Correct 208 ms 74828 KB Output is correct
9 Correct 188 ms 74820 KB Output is correct
10 Correct 277 ms 74920 KB Output is correct
11 Correct 147 ms 74836 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21460 KB Output is correct
2 Correct 11 ms 21460 KB Output is correct
3 Correct 13 ms 21416 KB Output is correct
4 Correct 11 ms 21420 KB Output is correct
5 Correct 11 ms 21460 KB Output is correct
6 Correct 12 ms 21476 KB Output is correct
7 Correct 12 ms 21460 KB Output is correct
8 Correct 12 ms 21460 KB Output is correct
9 Correct 15 ms 21460 KB Output is correct
10 Correct 11 ms 21476 KB Output is correct
11 Correct 190 ms 74964 KB Output is correct
12 Correct 210 ms 74956 KB Output is correct
13 Correct 190 ms 74916 KB Output is correct
14 Correct 207 ms 74864 KB Output is correct
15 Correct 193 ms 74876 KB Output is correct
16 Correct 212 ms 74828 KB Output is correct
17 Correct 204 ms 75120 KB Output is correct
18 Correct 208 ms 74828 KB Output is correct
19 Correct 188 ms 74820 KB Output is correct
20 Correct 277 ms 74920 KB Output is correct
21 Correct 147 ms 74836 KB Output is correct
22 Correct 254 ms 37624 KB Output is correct
23 Correct 277 ms 37560 KB Output is correct
24 Correct 269 ms 37452 KB Output is correct
25 Correct 257 ms 37536 KB Output is correct
26 Correct 194 ms 52844 KB Output is correct
27 Correct 185 ms 46488 KB Output is correct
28 Correct 198 ms 43856 KB Output is correct
29 Correct 276 ms 75004 KB Output is correct
30 Correct 247 ms 74872 KB Output is correct
31 Correct 102 ms 37208 KB Output is correct
32 Correct 155 ms 74864 KB Output is correct