oj.uz

Submission #559406

# Submission time Handle Problem Language Result Execution time Memory
559406 2022-05-09T17:45:35 Z keta_tsimakuridze Constellation 3 (JOI20_constellation3) C++14
35 / 100
 895 ms 524288 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define endl "\n"
const int N = 2e5 + 5, mod = 1e9 + 7; //!
int t, le_[400 * N], a[N], ri_[400 * N], cur, root[N], f[N], p[N], n;
vector<pii> comp[N];
ll tree[400 * N], lazy[400 * N];
void push(int u,int l,int r) {
	if(!lazy[u]) return;
	tree[u] += lazy[u];
	if(l != r) {
		lazy[le_[u]] += lazy[u];
		lazy[ri_[u]] += lazy[u];
	}
	lazy[u] = 0;
}
void UPD(int u) {
	if(!le_[u]) le_[u] = ++cur;
	if(!ri_[u]) ri_[u] = ++cur;
}
void upd(int u, int st, int en, int l, int r, ll v) {
	if(!le_[u]) return;
	UPD(u);
	push(u, l, r);
	if(l > en || r < st) return;
	
	if(st <= l && r <= en) {
		lazy[u] = v;
		push(u, l, r);
		return;
	}
	int mid = (l + r) / 2;
	upd(le_[u], st, en, l, mid, v); upd(ri_[u], st, en, mid + 1, r, v);
	tree[u] = max(tree[le_[u]], tree[ri_[u]]);
}
void upd(int u,int id, int l,int r,ll v) {
	UPD(u);
	push(u, l, r);
	if(l > id || r < id) return;
	
	if(l == r) {
		tree[u] = max(tree[u], v);
		return;
	}
	int mid = (l + r) / 2;	
	upd(le_[u], id, l, mid, v); upd(ri_[u], id, mid + 1, r, v);
	tree[u] = max(tree[le_[u]], tree[ri_[u]]);
}
 
ll get(int u, int st, int en, int l,int r) {
	if(!u) return 0;
	UPD(u);
	push(u, l, r);
	if(l > en || r < st) return 0;
	if(st <= l && r <= en) return tree[u];
	int mid = (l + r) / 2;
	return max(get(le_[u], st, en, l, mid), get(ri_[u], st, en ,mid + 1, r));
}
 
int find(int u) {
	return (p[u] == u ? p[u] : p[u] = find(p[u]));
}
void merge(int u, int v, int H) {
	u = find(u); v = find(v);
	assert(u != v); 
	if(comp[v].size() > comp[u].size()) swap(u, v);
	p[v] = u; 
	
	ll ul = get(root[u], 1, H, 1, n), vl = get(root[v], 1, H, 1, n);
	upd(root[u], 1, n, 1, n, vl); 
	
	for(int i = 0; i < comp[v].size(); i++) {
		if(comp[v][i].f <= H) continue;
		upd(root[u], comp[v][i].f, 1, n, get(root[v], 1, comp[v][i].f, 1, n) + ul);
		
		comp[u].push_back(comp[v][i]);
	}
//	cout << tree[root[u]] << "  ? " << endl;
}
main() {
//	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	int m;
	cin >> n;
	vector<pii> h;
	for(int i = 1; i <= n; i++) {
		cin >> a[i];
		h.push_back({a[i], i});
	}
	cin >> m;
	ll call = 0;
	while(m--) {
		int x, y, w;
		cin >> x >> y >> w;
		comp[x].push_back({y, w});
		call += w;
	}
	for(int i = 1; i <= n; i++) {
		p[i] = i;
		root[i] = ++cur;
		for(int j = 0; j < comp[i].size(); j++)
		upd(root[i], comp[i][j].f, 1, n, comp[i][j].s);
	}
	sort(h.begin(), h.end());
	
	for(int i = 0; i < h.size(); i++) {
		
		int id = h[i].s, H = h[i].f;
		if(f[id - 1]) merge(id - 1, id, H); 
		if(f[id + 1]) merge(id + 1, id, H);
		f[id] = 1;
	}
	
	cout << call - tree[root[find(1)]];
}

Compilation message

constellation3.cpp: In function 'void merge(int, int, int)':
constellation3.cpp:76: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]
   76 |  for(int i = 0; i < comp[v].size(); i++) {
      |                 ~~^~~~~~~~~~~~~~~~
constellation3.cpp: At global scope:
constellation3.cpp:84:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   84 | main() {
      | ^~~~
constellation3.cpp: In function 'int main()':
constellation3.cpp:104:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  104 |   for(int j = 0; j < comp[i].size(); j++)
      |                  ~~^~~~~~~~~~~~~~~~
constellation3.cpp:109: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]
  109 |  for(int i = 0; i < h.size(); i++) {
      |                 ~~^~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5460 KB Output is correct
2 Correct 4 ms 5460 KB Output is correct
3 Correct 4 ms 5460 KB Output is correct
4 Correct 4 ms 5588 KB Output is correct
5 Correct 4 ms 5460 KB Output is correct
6 Correct 3 ms 5460 KB Output is correct
7 Correct 4 ms 5460 KB Output is correct
8 Correct 4 ms 5460 KB Output is correct
9 Correct 4 ms 5460 KB Output is correct
10 Correct 4 ms 5332 KB Output is correct
11 Correct 4 ms 5460 KB Output is correct
12 Correct 4 ms 5460 KB Output is correct
13 Correct 5 ms 5408 KB Output is correct
14 Correct 4 ms 5376 KB Output is correct
15 Correct 4 ms 5404 KB Output is correct
16 Correct 4 ms 5204 KB Output is correct
17 Correct 4 ms 5204 KB Output is correct
18 Correct 4 ms 5332 KB Output is correct
19 Correct 3 ms 5204 KB Output is correct
20 Correct 3 ms 5276 KB Output is correct
21 Correct 3 ms 5332 KB Output is correct
22 Correct 3 ms 5280 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5460 KB Output is correct
2 Correct 4 ms 5460 KB Output is correct
3 Correct 4 ms 5460 KB Output is correct
4 Correct 4 ms 5588 KB Output is correct
5 Correct 4 ms 5460 KB Output is correct
6 Correct 3 ms 5460 KB Output is correct
7 Correct 4 ms 5460 KB Output is correct
8 Correct 4 ms 5460 KB Output is correct
9 Correct 4 ms 5460 KB Output is correct
10 Correct 4 ms 5332 KB Output is correct
11 Correct 4 ms 5460 KB Output is correct
12 Correct 4 ms 5460 KB Output is correct
13 Correct 5 ms 5408 KB Output is correct
14 Correct 4 ms 5376 KB Output is correct
15 Correct 4 ms 5404 KB Output is correct
16 Correct 4 ms 5204 KB Output is correct
17 Correct 4 ms 5204 KB Output is correct
18 Correct 4 ms 5332 KB Output is correct
19 Correct 3 ms 5204 KB Output is correct
20 Correct 3 ms 5276 KB Output is correct
21 Correct 3 ms 5332 KB Output is correct
22 Correct 3 ms 5280 KB Output is correct
23 Correct 11 ms 9684 KB Output is correct
24 Correct 10 ms 9812 KB Output is correct
25 Correct 10 ms 9684 KB Output is correct
26 Correct 12 ms 9940 KB Output is correct
27 Correct 10 ms 9824 KB Output is correct
28 Correct 11 ms 9944 KB Output is correct
29 Correct 11 ms 9876 KB Output is correct
30 Correct 12 ms 10068 KB Output is correct
31 Correct 12 ms 9760 KB Output is correct
32 Correct 13 ms 8148 KB Output is correct
33 Correct 14 ms 8692 KB Output is correct
34 Correct 11 ms 8788 KB Output is correct
35 Correct 10 ms 8996 KB Output is correct
36 Correct 9 ms 8092 KB Output is correct
37 Correct 9 ms 8260 KB Output is correct
38 Correct 8 ms 6308 KB Output is correct
39 Correct 9 ms 7508 KB Output is correct
40 Correct 9 ms 7848 KB Output is correct
41 Correct 9 ms 7328 KB Output is correct
42 Correct 10 ms 7644 KB Output is correct
43 Correct 10 ms 8068 KB Output is correct
44 Correct 12 ms 7176 KB Output is correct

Subtask #3
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5460 KB Output is correct
2 Correct 4 ms 5460 KB Output is correct
3 Correct 4 ms 5460 KB Output is correct
4 Correct 4 ms 5588 KB Output is correct
5 Correct 4 ms 5460 KB Output is correct
6 Correct 3 ms 5460 KB Output is correct
7 Correct 4 ms 5460 KB Output is correct
8 Correct 4 ms 5460 KB Output is correct
9 Correct 4 ms 5460 KB Output is correct
10 Correct 4 ms 5332 KB Output is correct
11 Correct 4 ms 5460 KB Output is correct
12 Correct 4 ms 5460 KB Output is correct
13 Correct 5 ms 5408 KB Output is correct
14 Correct 4 ms 5376 KB Output is correct
15 Correct 4 ms 5404 KB Output is correct
16 Correct 4 ms 5204 KB Output is correct
17 Correct 4 ms 5204 KB Output is correct
18 Correct 4 ms 5332 KB Output is correct
19 Correct 3 ms 5204 KB Output is correct
20 Correct 3 ms 5276 KB Output is correct
21 Correct 3 ms 5332 KB Output is correct
22 Correct 3 ms 5280 KB Output is correct
23 Correct 11 ms 9684 KB Output is correct
24 Correct 10 ms 9812 KB Output is correct
25 Correct 10 ms 9684 KB Output is correct
26 Correct 12 ms 9940 KB Output is correct
27 Correct 10 ms 9824 KB Output is correct
28 Correct 11 ms 9944 KB Output is correct
29 Correct 11 ms 9876 KB Output is correct
30 Correct 12 ms 10068 KB Output is correct
31 Correct 12 ms 9760 KB Output is correct
32 Correct 13 ms 8148 KB Output is correct
33 Correct 14 ms 8692 KB Output is correct
34 Correct 11 ms 8788 KB Output is correct
35 Correct 10 ms 8996 KB Output is correct
36 Correct 9 ms 8092 KB Output is correct
37 Correct 9 ms 8260 KB Output is correct
38 Correct 8 ms 6308 KB Output is correct
39 Correct 9 ms 7508 KB Output is correct
40 Correct 9 ms 7848 KB Output is correct
41 Correct 9 ms 7328 KB Output is correct
42 Correct 10 ms 7644 KB Output is correct
43 Correct 10 ms 8068 KB Output is correct
44 Correct 12 ms 7176 KB Output is correct
45 Runtime error 895 ms 524288 KB Execution killed with signal 9
46 Halted 0 ms 0 KB -