oj.uz

Submission #992376

# Submission time Handle Problem Language Result Execution time Memory
992376 2024-06-04T11:00:23 Z PagodePaiva Fish 3 (JOI24_fish3) C++17
100 / 100
 1241 ms 106672 KB 
#include<bits/stdc++.h>
#define int long long

using namespace std;
const int N = 300010;
const int inf = 1e18;
const int debug = 0;

int n, q, d;
vector <pair <int, int>> intervalos;
int h[N];
vector <pair <int, int>> queries;
map <pair <int, int>, int> res;
set <int> s[N];

struct Segtree{
	int tree[4*N], lazy[4*N];
	int join(int a, int b){
		return min(a, b);
	}
	void unlazy(int node, int l, int r){
		tree[node] += lazy[node];
		if(l != r) {
			lazy[2*node] += lazy[node];
			lazy[2*node+1] += lazy[node];
		}
		lazy[node] = 0;
	}
	void build(int node, int l, int r){
		if(l == r){
			tree[node] = h[l];
			lazy[node] = 0;
			return;
		}
		int mid = (l+r)/2;
		build(2*node, l, mid);
		build(2*node+1, mid+1, r);
		tree[node] = join(tree[2*node], tree[2*node+1]);
		lazy[node] = 0;
		return;
	}
	void update(int node, int l, int r, int tl, int tr, int val){
		unlazy(node, tl, tr);
		if(l > tr or tl > r) return;
		if(l <= tl and tr <= r){
			lazy[node] += val;
			unlazy(node, tl, tr);
			return;
		}
		int mid = (tl+tr)/2;
		update(2*node, l, r, tl, mid, val);
		update(2*node+1, l, r, mid+1, tr, val);
		tree[node] = join(tree[2*node], tree[2*node+1]);
		return;
	}
	int query(int node, int l, int r, int tl, int tr){
		unlazy(node, tl, tr);
		if(l > tr or tl > r) return inf;
		if(l <= tl and tr <= r) return tree[node];
		int mid = (tl+tr)/2;
		return join(query(2*node, l, r, tl, mid), query(2*node+1, l, r, mid+1, tr));
	}
} alturas;

struct Segtree2{
	int tree[4*N], lazy[4*N];
	int join(int a, int b){
		return a+b;
	}
	void unlazy(int node, int l, int r){
		tree[node] += lazy[node]*(r-l+1);
		if(l != r){
			lazy[2*node] += lazy[node];
			lazy[2*node+1] += lazy[node];
		}
		lazy[node] = 0;
	}
	void build(int node, int l, int r){
		if(l == r){
			tree[node] = 0;
			lazy[node] = 0;
			return;
		}
		int mid = (l+r)/2;
		build(2*node, l, mid);
		build(2*node+1, mid+1, r);
		tree[node] = join(tree[2*node], tree[2*node+1]);
		lazy[node] = 0;
		return;
	}
	void update(int node, int l, int r, int tl, int tr, int val){
		unlazy(node, tl, tr);
		if(l > tr or tl > r) return;
		if(l <= tl and tr <= r){
			lazy[node] += val;
			unlazy(node, tl, tr);
			return;
		}
		int mid = (tl+tr)/2;
		update(2*node, l, r, tl, mid, val);
		update(2*node+1, l, r, mid+1, tr, val);
		tree[node] = join(tree[2*node], tree[2*node+1]);
		return;
	}
	int query(int node, int l, int r, int tl, int tr){
		unlazy(node, tl, tr);
		if(l > tr or tl > r) return 0;
		if(l <= tl and tr <= r) return tree[node];
		int mid = (tl+tr)/2;
		return join(query(2*node, l, r, tl, mid), query(2*node+1, l, r, mid+1, tr));
	}
} resposta;

int32_t main(){
	cin >> n >> d;
	for(int i = 1;i <= n;i++)
		cin >> h[i];
	alturas.build(1, 1, n);
	cin >> q;
	for(int i = 0;i < q;i++){
		int a, b;
		cin >> a >> b;
		queries.push_back({a, b});
		s[b].insert(a);
	}
	res[{1, 1}] = 0;
	intervalos.push_back({1, 1});
	for(int r = 2;r <= n;r++){
		if(h[r] >= h[r-1]){
			if(h[r]-d < h[r-1]){
				auto [p, _] = intervalos.back();
				intervalos.pop_back();
				intervalos.push_back({p, r});
			}
			else intervalos.push_back({r, r});
		}
		else{
			auto [p, q] = intervalos.back();
			int res;
			int alt = h[r];
			if(debug and r == 3){
				cout << '(' << q << ' ' << alturas.query(1, q, q, 1, n) << ' ';
				cout << alt << ' ' << (alturas.query(1,q, q, 1, n) > alt) << ')';
			}
			while(alturas.query(1, q, q, 1, n) > alt){
				int t = (-(alt - alturas.query(1, q, q, 1, n))+d-1)/d;
				//cout << t << 'a';
				alturas.update(1, p, q, 1, n, -t*d);
				resposta.update(1, p, q, 1, n, t);
				alt = alturas.query(1, p, p, 1, n);
				intervalos.pop_back();
				res = p;
				if(intervalos.empty()) break;
				p = intervalos.back().first;
				q = intervalos.back().second;
			}
			intervalos.push_back({res, r});
		}
		if(debug){
			for(int i = 1;i <= r;i++)
				cout << resposta.query(1, i, r, 1, n) << ' ';
			cout << '\n';
		}
		for(auto l : s[r]){
			res[{l,r}] = (alturas.query(1, l, r, 1, n) < 0 ? -1 : resposta.query(1, l, r, 1, n));
		}
	}
	if(debug) cout << '\n' << '\n';
	for(auto x : queries){
		cout << res[x] << '\n';
	}
	return 0;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 20824 KB Output is correct
2 Correct 3 ms 20824 KB Output is correct
3 Correct 3 ms 20828 KB Output is correct
4 Correct 9 ms 21596 KB Output is correct
5 Correct 8 ms 21340 KB Output is correct
6 Correct 8 ms 21340 KB Output is correct
7 Correct 6 ms 21340 KB Output is correct
8 Correct 7 ms 21336 KB Output is correct
9 Correct 6 ms 21340 KB Output is correct
10 Correct 8 ms 21484 KB Output is correct
11 Correct 7 ms 21340 KB Output is correct
12 Correct 8 ms 21596 KB Output is correct
13 Correct 7 ms 21452 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 930 ms 100044 KB Output is correct
2 Correct 834 ms 98220 KB Output is correct
3 Correct 503 ms 60076 KB Output is correct
4 Correct 710 ms 97456 KB Output is correct
5 Correct 736 ms 96484 KB Output is correct
6 Correct 764 ms 96452 KB Output is correct
7 Correct 731 ms 96944 KB Output is correct

Subtask #3
28.0 / 28.0

# Verdict Execution time Memory Grader output
1 Correct 614 ms 65340 KB Output is correct
2 Correct 1193 ms 105388 KB Output is correct
3 Correct 1086 ms 106024 KB Output is correct
4 Correct 1168 ms 104040 KB Output is correct
5 Correct 1160 ms 104920 KB Output is correct
6 Correct 1051 ms 98832 KB Output is correct
7 Correct 1073 ms 99760 KB Output is correct
8 Correct 1094 ms 102588 KB Output is correct
9 Correct 1082 ms 102880 KB Output is correct
10 Correct 870 ms 104624 KB Output is correct
11 Correct 873 ms 106420 KB Output is correct
12 Correct 1105 ms 104364 KB Output is correct
13 Correct 1080 ms 106160 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 797 ms 82864 KB Output is correct
2 Correct 780 ms 98220 KB Output is correct
3 Correct 669 ms 73644 KB Output is correct
4 Correct 896 ms 101696 KB Output is correct
5 Correct 1090 ms 104880 KB Output is correct
6 Correct 1197 ms 104112 KB Output is correct
7 Correct 1048 ms 88240 KB Output is correct
8 Correct 1127 ms 103936 KB Output is correct
9 Correct 674 ms 97880 KB Output is correct
10 Correct 692 ms 97760 KB Output is correct
11 Correct 859 ms 100484 KB Output is correct
12 Correct 842 ms 99756 KB Output is correct
13 Correct 1136 ms 105388 KB Output is correct
14 Correct 982 ms 99504 KB Output is correct
15 Correct 1156 ms 104988 KB Output is correct
16 Correct 936 ms 100272 KB Output is correct

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 20824 KB Output is correct
2 Correct 3 ms 20824 KB Output is correct
3 Correct 3 ms 20828 KB Output is correct
4 Correct 9 ms 21596 KB Output is correct
5 Correct 8 ms 21340 KB Output is correct
6 Correct 8 ms 21340 KB Output is correct
7 Correct 6 ms 21340 KB Output is correct
8 Correct 7 ms 21336 KB Output is correct
9 Correct 6 ms 21340 KB Output is correct
10 Correct 8 ms 21484 KB Output is correct
11 Correct 7 ms 21340 KB Output is correct
12 Correct 8 ms 21596 KB Output is correct
13 Correct 7 ms 21452 KB Output is correct
14 Correct 930 ms 100044 KB Output is correct
15 Correct 834 ms 98220 KB Output is correct
16 Correct 503 ms 60076 KB Output is correct
17 Correct 710 ms 97456 KB Output is correct
18 Correct 736 ms 96484 KB Output is correct
19 Correct 764 ms 96452 KB Output is correct
20 Correct 731 ms 96944 KB Output is correct
21 Correct 614 ms 65340 KB Output is correct
22 Correct 1193 ms 105388 KB Output is correct
23 Correct 1086 ms 106024 KB Output is correct
24 Correct 1168 ms 104040 KB Output is correct
25 Correct 1160 ms 104920 KB Output is correct
26 Correct 1051 ms 98832 KB Output is correct
27 Correct 1073 ms 99760 KB Output is correct
28 Correct 1094 ms 102588 KB Output is correct
29 Correct 1082 ms 102880 KB Output is correct
30 Correct 870 ms 104624 KB Output is correct
31 Correct 873 ms 106420 KB Output is correct
32 Correct 1105 ms 104364 KB Output is correct
33 Correct 1080 ms 106160 KB Output is correct
34 Correct 797 ms 82864 KB Output is correct
35 Correct 780 ms 98220 KB Output is correct
36 Correct 669 ms 73644 KB Output is correct
37 Correct 896 ms 101696 KB Output is correct
38 Correct 1090 ms 104880 KB Output is correct
39 Correct 1197 ms 104112 KB Output is correct
40 Correct 1048 ms 88240 KB Output is correct
41 Correct 1127 ms 103936 KB Output is correct
42 Correct 674 ms 97880 KB Output is correct
43 Correct 692 ms 97760 KB Output is correct
44 Correct 859 ms 100484 KB Output is correct
45 Correct 842 ms 99756 KB Output is correct
46 Correct 1136 ms 105388 KB Output is correct
47 Correct 982 ms 99504 KB Output is correct
48 Correct 1156 ms 104988 KB Output is correct
49 Correct 936 ms 100272 KB Output is correct
50 Correct 1179 ms 104856 KB Output is correct
51 Correct 1065 ms 98316 KB Output is correct
52 Correct 1117 ms 102600 KB Output is correct
53 Correct 846 ms 106668 KB Output is correct
54 Correct 1094 ms 105392 KB Output is correct
55 Correct 1135 ms 104436 KB Output is correct
56 Correct 854 ms 100756 KB Output is correct
57 Correct 870 ms 97324 KB Output is correct
58 Correct 825 ms 98156 KB Output is correct
59 Correct 1064 ms 101548 KB Output is correct
60 Correct 820 ms 100012 KB Output is correct
61 Correct 868 ms 106672 KB Output is correct
62 Correct 890 ms 101172 KB Output is correct
63 Correct 1241 ms 105900 KB Output is correct
64 Correct 903 ms 99588 KB Output is correct