oj.uz

Submission #650369

# Submission time Handle Problem Language Result Execution time Memory
650369 2022-10-13T15:24:54 Z 600Mihnea Fire (JOI20_ho_t5) C++17
1 / 100
 1000 ms 33176 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct Op {
	int limit;
	int k;
	int id;
};

bool operator < (Op a, Op b) {
	return a.k < b.k;
}

vector<pair<ll, int>> treemxa;
vector<ll> a;

void buildtreemxa(int v, int tl, int tr) {
	if (tl == tr) {
		treemxa[v] = {a[tl], tl};
	} else {
		int tm = (tl + tr) / 2;
		buildtreemxa(2 * v, tl, tm);
		buildtreemxa(2 * v + 1, tm + 1, tr);
		treemxa[v] = max(treemxa[2 * v], treemxa[2 * v + 1]);
	}
}

pair<ll, int> getmxa(int v, int tl, int tr, int l, int r) {
	if (tr < l || r < tl) {
		return {-1LL, 0};
	}
	if (l <= tl && tr <= r) {
		return treemxa[v];
	}
	int tm = (tl + tr) / 2;
	return max(getmxa(2 * v, tl, tm, l, r), getmxa(2 * v + 1, tm + 1, tr, l, r));
}

int n;
vector<pair<ll, ll>> aib1d;

pair<ll, ll> get1d(int x) {
	x++;
	pair<ll, ll> sol = {0, 0};
	while (x) {
		sol.first += aib1d[x].first;
		sol.second += aib1d[x].second;
		x -= x & (-x);
	}
	return sol;
}

void add1d(int x, pair<ll, ll> v) {
	x++;
	while (x <= n) {
		aib1d[x].first += v.first;
		aib1d[x].second += v.second;
		x += x & (-x);
	}
}


int main() {
#ifndef ONPC
  ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#endif
	
	int q;
	cin >> n >> q;
	a.resize(n);
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	aib1d.resize(n + 1);
	treemxa.resize(4 * (n + 7));
	buildtreemxa(1, 0, n - 1);
	// l, r, t
	vector<ll> prn(2 * q, 0);
	vector<Op> ops;
	for (int i = 0; i < q; i++) {
		int l, r, t;
		cin >> t >> l >> r;
		l--, r--;
		ops.push_back({l - 1, t, i});
		ops.push_back({r, t, i + q});
	}
	// next bigger
	const int INF = (int) 1e9 + 7;
	vector<int> s(n, INF), f(n, -INF);
	{
		vector<int> stk;
		for (int i = n - 1; i >= 0; i--) {
			while (!stk.empty() && a[stk.back()] < a[i]) {
				stk.pop_back();
			}
			if (!stk.empty()) {
				s[i] = stk.back() - 1;
			}
			stk.push_back(i);
		}	
	}
	{
		vector<int> stk;
		for (int i = 0; i < n; i++) {
			while (!stk.empty() && a[stk.back()] <= a[i]) {
				stk.pop_back();
			}
			if (!stk.empty()) {
				f[i] = stk.back() + 1;
			}
			stk.push_back(i);
		}	
	}
	sort(ops.begin(), ops.end());
	ll h = 0;
	vector<int> c1(n, 1), c2(n, 1);
	vector<int> indsfi(n); iota(indsfi.begin(), indsfi.end(), 0);
	vector<int> indssi(n); iota(indssi.begin(), indssi.end(), 0);
	vector<int> indsfisi(n); iota(indsfisi.begin(), indsfisi.end(), 0);

	sort(indsfi.begin(), indsfi.end(), [&] (int i, int j) {
		return i - f[i] > j - f[j];
	});
	sort(indssi.begin(), indssi.end(), [&] (int i, int j) {
		return s[i] - i > s[j] - j;
	});	
	sort(indsfisi.begin(), indsfisi.end(), [&] (int i, int j) {
		return s[i] - f[i] > s[j] - f[j];
	});
	vector<ll> foo(n, 0), bar(n, 0);
	for (int i = 0; i < n; i++) {
		foo[i] += a[i];
		bar[i] += a[i];
		if (f[i] == -INF) {
			add1d(i, {a[i], a[i]});
		}
	}
	for (auto &it : ops) {
		int limit = it.limit;
		if (limit < 0) {
			//cout << "skip\n";
			continue;
		}
		int k = it.k;
		int id = it.id;
			
		while (!indsfi.empty()) {
			int i = indsfi.back();
			if (i - f[i] <= k) {
				indsfi.pop_back();
				c1[i]--;
				foo[i] += a[i] * (i - f[i]);
				bar[i] -= a[i];
				
				if (f[i] == -INF) {
					add1d(i, {a[i] * (i - f[i]), a[i]});	
				}
			} else {
				break;
			}
		}
				
		while (!indssi.empty()) {
			int i = indssi.back();
			if (s[i] - i <= k) {
				indssi.pop_back();
				c2[i]--;
				foo[i] += a[i] * (s[i] - i);
				bar[i] -= a[i];

				if (f[i] == -INF) {
					add1d(i, {a[i] * (s[i] - i), -a[i]});	
				}
			} else {
				break;
			}
		}

		while (!indsfisi.empty()) {
			int i = indsfisi.back();
			if (f[i] > s[i] - k) {
				indsfisi.pop_back();
				foo[i] = bar[i] = 0;
				if (f[i] == -INF) {
					add1d(i, {-foo[i], -bar[i]});	
				}
			} else {
				break;
			}
		}

		ll sol = 0;		
		{
			int i = getmxa(1, 0, n - 1, max(0, limit - k), limit).second; 
			sol += 1LL * a[i] * (limit - min(s[i], i + k));	
		}
		
		pair<ll, ll> s = get1d(limit);
		sol += s.first + s.second * k;
	
		for (int i = 0; i < n; i++) {
 			if (0 <= f[i] && f[i] <= limit - k && i <= limit) {		
				sol += (foo[i] + bar[i] * k);
 			}
		}
	
		prn[id] = sol;
	}
	for (int i = 0; i < q; i++) {
		h = h * 777777 + prn[i];
		h = h * 777777 + prn[i + q];
		cout << prn[i + q] - prn[i] << "\n";
	}
#ifdef ONPC
	assert(h == 5799234416310137250);
	cout << "h = " << h << "\n";
#endif
	return 0;
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 232 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 232 KB Output is correct
2 Execution timed out 1092 ms 33040 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 232 KB Output is correct
2 Execution timed out 1096 ms 33176 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 6.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1099 ms 32688 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 232 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Execution timed out 1092 ms 33040 KB Time limit exceeded
34 Halted 0 ms 0 KB -