oj.uz

Submission #201600

# Submission time Handle Problem Language Result Execution time Memory
201600 2020-02-11T11:43:03 Z Noam527 Fire (JOI20_ho_t5) C++17
100 / 100
 420 ms 84368 KB 
#include <bits/stdc++.h>
#define finish(x) return cout << x << endl, 0
typedef long long ll;
typedef long double ldb;
const int md = 1e9 + 7;
const ll inf = 4e18;
const int OO = 1;
const int OOO = 1;
using namespace std;

struct fenwick {
	int n;
	vector<ll> t;
	fenwick() {}
	fenwick(int sz) {
		n = sz;
		t.resize(n + 1, 0);
	}
	void clear() {
		for (auto &i : t) i = 0;
	}
	void add(int x, ll v) {
		for (x++; x <= n; x += (x & -x)) t[x] += v;
	}
	ll query(int x) {
		ll rtn = 0;
		for (x++; x; x ^= (x & -x)) rtn += t[x];
		return rtn;
	}
	ll query(int l, int r) {
		return query(r) - query(l - 1);
	}
};

struct query {
	int l, r, i;
	query() {}
	query(int _l, int _r, int _i) {
		l = _l;
		r = _r;
		i = _i;
	}
};

struct eve {
	int i;
	ll v;
	eve(int _i, ll _v) {
		i = _i;
		v = _v;
	}
};

const int N = 2e5 + 5;

int n, q;
vector<int> s, L, R;

vector<query> que[N];
vector<ll> ans;

vector<eve> line[N], diag[N];
fenwick f;

void addline(int x, int y, int len, ll v) {
	line[x].push_back(eve(y, v));
	if (x + len <= n)
		line[x + len].push_back(eve(y, -v));
}
void adddiag(int x, int y, int len, ll v) {
	y = y - x + n;
	diag[x].push_back(eve(y, v));
	if (x + len <= n)
		diag[x + len].push_back(eve(y, -v));
}

int main() {
	ios::sync_with_stdio(0), cin.tie(0);
	cin >> n >> q;
	s.resize(n), L.resize(n), R.resize(n);
	ans.resize(q, 0);
	f = fenwick(2 * n);

	for (auto &i : s) cin >> i;
	for (int i = 0, t, l, r; i < q; i++) {
		cin >> t >> l >> r;
		--l, --r;
		que[t].push_back(query(l, r, i));
	}

	vector<pair<int, int>> st;
	st.emplace_back(md, -md);
	for (int i = 0; i < n; i++) {
		while (st.back().first <= s[i]) st.pop_back();
		L[i] = st.back().second;
		st.emplace_back(s[i], i);
	}
	st.clear(), st.emplace_back(md, n);
	for (int i = n - 1; i >= 0; i--) {
		while (s[i] > st.back().first) st.pop_back();
		R[i] = st.back().second;
		st.emplace_back(s[i], i);
	}
	for (int i = 0; i < n; i++) {
		if (i - L[i] < R[i] - i) {
			// diagonal
			for (int j = 0; j < i - L[i]; j++)
				adddiag(j, i, R[i] - i, s[i]);
		}
		else {
			// horizontal
			for (int j = 0; j < R[i] - i; j++)
				addline(j, i + j, i - L[i], s[i]);
		}
	}

	// diagonal sweepline
	for (int t = 0; t <= n; t++) {
		for (const auto &i : diag[t])
			f.add(i.i, i.v);
		for (const auto &i : que[t])
			ans[i.i] += f.query(i.l - t + n, i.r - t + n);
	}
	f.clear();
	// horizontal sweepline
	for (int t = 0; t <= n; t++) {
		for (const auto &i : line[t])
			f.add(i.i, i.v);
		for (const auto &i : que[t])
			ans[i.i] += f.query(i.l, i.r);
	}
	for (const auto &i : ans) cout << i << '\n';
}

Subtask #1
1.0 / 1.0

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

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14456 KB Output is correct
2 Correct 313 ms 74204 KB Output is correct
3 Correct 326 ms 79452 KB Output is correct
4 Correct 318 ms 75872 KB Output is correct
5 Correct 325 ms 79324 KB Output is correct
6 Correct 316 ms 77156 KB Output is correct
7 Correct 306 ms 75364 KB Output is correct
8 Correct 338 ms 78052 KB Output is correct
9 Correct 332 ms 78052 KB Output is correct
10 Correct 312 ms 74460 KB Output is correct
11 Correct 325 ms 76064 KB Output is correct
12 Correct 322 ms 76004 KB Output is correct
13 Correct 315 ms 75232 KB Output is correct
14 Correct 331 ms 76952 KB Output is correct
15 Correct 325 ms 77276 KB Output is correct
16 Correct 338 ms 81892 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14456 KB Output is correct
2 Correct 400 ms 80212 KB Output is correct
3 Correct 388 ms 78928 KB Output is correct
4 Correct 415 ms 84368 KB Output is correct
5 Correct 369 ms 75472 KB Output is correct
6 Correct 389 ms 77392 KB Output is correct
7 Correct 391 ms 77400 KB Output is correct
8 Correct 396 ms 77648 KB Output is correct
9 Correct 384 ms 75984 KB Output is correct
10 Correct 399 ms 79444 KB Output is correct
11 Correct 420 ms 81488 KB Output is correct
12 Correct 391 ms 80340 KB Output is correct
13 Correct 401 ms 80980 KB Output is correct
14 Correct 373 ms 73808 KB Output is correct
15 Correct 388 ms 79444 KB Output is correct
16 Correct 396 ms 80852 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 34232 KB Output is correct
2 Correct 228 ms 35808 KB Output is correct
3 Correct 225 ms 36364 KB Output is correct
4 Correct 225 ms 34652 KB Output is correct
5 Correct 232 ms 36320 KB Output is correct
6 Correct 211 ms 35044 KB Output is correct
7 Correct 227 ms 35184 KB Output is correct
8 Correct 232 ms 35936 KB Output is correct
9 Correct 230 ms 35040 KB Output is correct
10 Correct 225 ms 34624 KB Output is correct
11 Correct 224 ms 35048 KB Output is correct
12 Correct 240 ms 36204 KB Output is correct
13 Correct 228 ms 35036 KB Output is correct
14 Correct 232 ms 36576 KB Output is correct

Subtask #5
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 14456 KB Output is correct
2 Correct 14 ms 14456 KB Output is correct
3 Correct 14 ms 14456 KB Output is correct
4 Correct 14 ms 14456 KB Output is correct
5 Correct 14 ms 14456 KB Output is correct
6 Correct 14 ms 14468 KB Output is correct
7 Correct 14 ms 14452 KB Output is correct
8 Correct 15 ms 14584 KB Output is correct
9 Correct 14 ms 14456 KB Output is correct
10 Correct 14 ms 14456 KB Output is correct
11 Correct 14 ms 14456 KB Output is correct
12 Correct 14 ms 14456 KB Output is correct
13 Correct 16 ms 14456 KB Output is correct
14 Correct 14 ms 14456 KB Output is correct
15 Correct 15 ms 14456 KB Output is correct
16 Correct 14 ms 14456 KB Output is correct
17 Correct 14 ms 14456 KB Output is correct
18 Correct 14 ms 14456 KB Output is correct
19 Correct 13 ms 14456 KB Output is correct
20 Correct 14 ms 14456 KB Output is correct
21 Correct 15 ms 14456 KB Output is correct
22 Correct 14 ms 14460 KB Output is correct
23 Correct 14 ms 14456 KB Output is correct
24 Correct 14 ms 14456 KB Output is correct
25 Correct 14 ms 14456 KB Output is correct
26 Correct 14 ms 14456 KB Output is correct
27 Correct 14 ms 14460 KB Output is correct
28 Correct 14 ms 14456 KB Output is correct
29 Correct 15 ms 14456 KB Output is correct
30 Correct 14 ms 14456 KB Output is correct
31 Correct 14 ms 14456 KB Output is correct
32 Correct 14 ms 14456 KB Output is correct
33 Correct 396 ms 78852 KB Output is correct
34 Correct 406 ms 81360 KB Output is correct
35 Correct 409 ms 80080 KB Output is correct
36 Correct 391 ms 79696 KB Output is correct
37 Correct 410 ms 79420 KB Output is correct
38 Correct 405 ms 79696 KB Output is correct
39 Correct 398 ms 78160 KB Output is correct
40 Correct 406 ms 74960 KB Output is correct
41 Correct 399 ms 78544 KB Output is correct
42 Correct 415 ms 83920 KB Output is correct
43 Correct 363 ms 79444 KB Output is correct
44 Correct 351 ms 73684 KB Output is correct
45 Correct 332 ms 72656 KB Output is correct
46 Correct 353 ms 78032 KB Output is correct
47 Correct 368 ms 78364 KB Output is correct
48 Correct 345 ms 79184 KB Output is correct
49 Correct 367 ms 79568 KB Output is correct
50 Correct 343 ms 78032 KB Output is correct
51 Correct 352 ms 78420 KB Output is correct
52 Correct 356 ms 81232 KB Output is correct
53 Correct 357 ms 79060 KB Output is correct
54 Correct 339 ms 76496 KB Output is correct
55 Correct 351 ms 78800 KB Output is correct
56 Correct 366 ms 80592 KB Output is correct
57 Correct 352 ms 76240 KB Output is correct
58 Correct 358 ms 76116 KB Output is correct
59 Correct 313 ms 74204 KB Output is correct
60 Correct 326 ms 79452 KB Output is correct
61 Correct 318 ms 75872 KB Output is correct
62 Correct 325 ms 79324 KB Output is correct
63 Correct 316 ms 77156 KB Output is correct
64 Correct 306 ms 75364 KB Output is correct
65 Correct 338 ms 78052 KB Output is correct
66 Correct 332 ms 78052 KB Output is correct
67 Correct 312 ms 74460 KB Output is correct
68 Correct 325 ms 76064 KB Output is correct
69 Correct 322 ms 76004 KB Output is correct
70 Correct 315 ms 75232 KB Output is correct
71 Correct 331 ms 76952 KB Output is correct
72 Correct 325 ms 77276 KB Output is correct
73 Correct 338 ms 81892 KB Output is correct
74 Correct 400 ms 80212 KB Output is correct
75 Correct 388 ms 78928 KB Output is correct
76 Correct 415 ms 84368 KB Output is correct
77 Correct 369 ms 75472 KB Output is correct
78 Correct 389 ms 77392 KB Output is correct
79 Correct 391 ms 77400 KB Output is correct
80 Correct 396 ms 77648 KB Output is correct
81 Correct 384 ms 75984 KB Output is correct
82 Correct 399 ms 79444 KB Output is correct
83 Correct 420 ms 81488 KB Output is correct
84 Correct 391 ms 80340 KB Output is correct
85 Correct 401 ms 80980 KB Output is correct
86 Correct 373 ms 73808 KB Output is correct
87 Correct 388 ms 79444 KB Output is correct
88 Correct 396 ms 80852 KB Output is correct
89 Correct 225 ms 34232 KB Output is correct
90 Correct 228 ms 35808 KB Output is correct
91 Correct 225 ms 36364 KB Output is correct
92 Correct 225 ms 34652 KB Output is correct
93 Correct 232 ms 36320 KB Output is correct
94 Correct 211 ms 35044 KB Output is correct
95 Correct 227 ms 35184 KB Output is correct
96 Correct 232 ms 35936 KB Output is correct
97 Correct 230 ms 35040 KB Output is correct
98 Correct 225 ms 34624 KB Output is correct
99 Correct 224 ms 35048 KB Output is correct
100 Correct 240 ms 36204 KB Output is correct
101 Correct 228 ms 35036 KB Output is correct
102 Correct 232 ms 36576 KB Output is correct