oj.uz

Submission #203379

# Submission time Handle Problem Language Result Execution time Memory
203379 2020-02-20T12:24:02 Z Bruteforceman Fire (JOI20_ho_t5) C++17
1 / 100
 1000 ms 46724 KB 
#include <bits/stdc++.h>
using namespace std;
#define prev previous
const int maxn = 200005;
using pii = pair <int, int>;

int n;
int s[maxn];
struct query {
	int l, r, t;
} Q[maxn];
vector <int> v[maxn];
int prev[maxn];
int l[maxn], r[maxn];
vector <int> g[maxn];
int sub[maxn];
long long pred[maxn];
vector <pii> h[maxn];

void eulerOrder(int x) {
	static int current = 0;
	l[x] = ++current;
	for(int i : g[x]) {
		eulerOrder(i);
		pred[i] = sub[x];
		sub[x] += sub[i]; 
	}
	sub[x] += 1;
	r[x] = current;
}
struct BinaryIndexedTree {
	long long t[maxn]; 
	int size;
	void update(int x, long long val) {
		x += 1;
		for(int i = x; i <= size + 1; i += i & (-i)) {
			t[i] += val;
		}
	}
	long long sum(int x) {
		x = min(x, size);
		x += 1;
		long long ans = 0;
		for(int i = x; i > 0; i -= i & (-i)) {
			ans += t[i];
		}
		return ans;
	}
	long long sum(int l, int r) {
		if(l > r) return 0;
		return sum(r) - sum(l - 1);
	}
};
int main() {
	int q;
	scanf("%d %d", &n, &q);
	for_each(s + 1, s + n + 1, [] (int &i) { scanf("%d", &i); });
	for_each(Q + 1, Q + q + 1, [&] (query &i) { 
					scanf("%d %d %d", &i.t, &i.l, &i.r); 
					v[i.r].emplace_back(i.t);
					v[i.l - 1].emplace_back(i.t); });
	stack <int> st;
	for(int i = 1; i <= n; i++) {
		while(!st.empty() && s[st.top()] < s[i]) {
			st.pop();
		} 
		prev[i] = st.empty() ? 0 : st.top();
		st.push(i);
	}
	for(int i = 1; i <= n; i++) {
		g[prev[i]].push_back(i);
	}
	eulerOrder(0);
	map <pii, long long> res;
	auto cost = [&] (int x) {
		if(prev[x] == 0) return 0;
		else return s[prev[x]] - s[x];
	};
	BinaryIndexedTree A, B, C, D;
	A.size = B.size = C.size = D.size = n;
	vector <int> rmq;;
	for(int i = 1; i <= n; i++) {
		while(!rmq.empty() && s[rmq.back()] < s[i]) {
			rmq.pop_back();
		}
		rmq.push_back(i);
		for(int t : v[i]) {
			if(res.find(pii(i, t)) != res.end()) continue;
			int last = *lower_bound(rmq.begin(), rmq.end(), i - t);
			long long ans = 1LL * s[last] * (i - last);
			for(int k = 1; k <= last; k++) {
				ans += s[k];
			}
			h[last].emplace_back(i, t);
			res[pii(i, t)] += ans;
		}
	}
	for(int i = 1; i <= n; i++) {
		int k = i;
		A.update(pred[k], 1LL * cost(k) * pred[k]);
		B.update(pred[k], 1LL * cost(k));
		C.update(pred[k] + sub[k], 1LL * cost(k) * (sub[k] + pred[k]));
		D.update(pred[k] + sub[k], 1LL * cost(k));	
		for(auto j : h[i]) {
			int t = j.second;
			res[j] += B.sum(t) * t - A.sum(t);
			res[j] += C.sum(t) - D.sum(t) * t;
		}
	}
	for_each(Q + 1, Q + q + 1, [&] (query i) { 
				printf("%lld\n", res[pii(i.r, i.t)] - res[pii(i.l - 1, i.t)]); });
	return 0;
}

Compilation message

ho_t5.cpp: In function 'int main()':
ho_t5.cpp:56:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &q);
  ~~~~~^~~~~~~~~~~~~~~~~
ho_t5.cpp: In lambda function:
ho_t5.cpp:57:48: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for_each(s + 1, s + n + 1, [] (int &i) { scanf("%d", &i); });
                                           ~~~~~^~~~~~~~~~
ho_t5.cpp: In lambda function:
ho_t5.cpp:59:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
      scanf("%d %d %d", &i.t, &i.l, &i.r); 
      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14456 KB Output is correct
2 Correct 14 ms 14456 KB Output is correct
3 Correct 13 ms 14584 KB Output is correct
4 Correct 13 ms 14584 KB Output is correct
5 Correct 13 ms 14584 KB Output is correct
6 Correct 14 ms 14584 KB Output is correct
7 Correct 13 ms 14460 KB Output is correct
8 Correct 13 ms 14584 KB Output is correct
9 Correct 13 ms 14456 KB Output is correct
10 Correct 13 ms 14456 KB Output is correct
11 Correct 14 ms 14584 KB Output is correct
12 Correct 13 ms 14584 KB Output is correct
13 Correct 13 ms 14456 KB Output is correct
14 Correct 13 ms 14584 KB Output is correct
15 Correct 14 ms 14456 KB Output is correct
16 Correct 13 ms 14584 KB Output is correct
17 Correct 15 ms 14584 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 13 ms 14456 KB Output is correct
22 Correct 13 ms 14584 KB Output is correct
23 Correct 14 ms 14584 KB Output is correct
24 Correct 13 ms 14456 KB Output is correct
25 Correct 13 ms 14584 KB Output is correct
26 Correct 14 ms 14584 KB Output is correct
27 Correct 13 ms 14456 KB Output is correct
28 Correct 13 ms 14584 KB Output is correct
29 Correct 13 ms 14584 KB Output is correct
30 Correct 13 ms 14456 KB Output is correct
31 Correct 13 ms 14584 KB Output is correct
32 Correct 13 ms 14456 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14456 KB Output is correct
2 Execution timed out 1090 ms 34076 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14456 KB Output is correct
2 Execution timed out 1096 ms 37616 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 1095 ms 46724 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 14456 KB Output is correct
2 Correct 14 ms 14456 KB Output is correct
3 Correct 13 ms 14584 KB Output is correct
4 Correct 13 ms 14584 KB Output is correct
5 Correct 13 ms 14584 KB Output is correct
6 Correct 14 ms 14584 KB Output is correct
7 Correct 13 ms 14460 KB Output is correct
8 Correct 13 ms 14584 KB Output is correct
9 Correct 13 ms 14456 KB Output is correct
10 Correct 13 ms 14456 KB Output is correct
11 Correct 14 ms 14584 KB Output is correct
12 Correct 13 ms 14584 KB Output is correct
13 Correct 13 ms 14456 KB Output is correct
14 Correct 13 ms 14584 KB Output is correct
15 Correct 14 ms 14456 KB Output is correct
16 Correct 13 ms 14584 KB Output is correct
17 Correct 15 ms 14584 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 13 ms 14456 KB Output is correct
22 Correct 13 ms 14584 KB Output is correct
23 Correct 14 ms 14584 KB Output is correct
24 Correct 13 ms 14456 KB Output is correct
25 Correct 13 ms 14584 KB Output is correct
26 Correct 14 ms 14584 KB Output is correct
27 Correct 13 ms 14456 KB Output is correct
28 Correct 13 ms 14584 KB Output is correct
29 Correct 13 ms 14584 KB Output is correct
30 Correct 13 ms 14456 KB Output is correct
31 Correct 13 ms 14584 KB Output is correct
32 Correct 13 ms 14456 KB Output is correct
33 Execution timed out 1099 ms 37356 KB Time limit exceeded
34 Halted 0 ms 0 KB -