oj.uz

Submission #593409

# Submission time Handle Problem Language Result Execution time Memory
593409 2022-07-11T05:52:28 Z haojiandan Triple Jump (JOI19_jumps) C++14
100 / 100
 877 ms 110348 KB 
// wygzgyw
#include <bits/stdc++.h>
using namespace std;
template <typename T> void read(T &t) {
	t=0; char ch=getchar(); int f=1;
	while (ch<'0'||ch>'9') { if (ch=='-') f=-1; ch=getchar(); }
	do { (t*=10)+=ch-'0'; ch=getchar(); } while ('0'<=ch&&ch<='9'); t*=f;
}
template <typename T> void write(T t) {
	if (t<0) { putchar('-'); write(-t); return; }
	if (t>9) write(t/10);
	putchar('0'+t%10);
}
template <typename T> void writeln(T t) { write(t); puts(""); }
#define MP make_pair
typedef long long ll;
const ll INF=1e10;
const int maxn=(5e5)+10;
int n,a[maxn];
int q,st[maxn],tot;
struct node {
	int r,id;
};
vector<int> A[maxn];
vector<node> g[maxn];
ll ans[maxn];
namespace Seg {
ll mx[maxn*4],tr[maxn*4],MX[maxn*4];
ll lazy[maxn*4];
void pushup(int root) {
	tr[root]=max(tr[root<<1],tr[root<<1|1]);
	mx[root]=max(mx[root<<1],mx[root<<1|1]);
	MX[root]=max(MX[root<<1],MX[root<<1|1]);
}
void build(int l,int r,int root) {
	tr[root]=mx[root]=lazy[root]=-INF;
	if (l==r) { MX[root]=a[l]; return; }
	int mid=(l+r)>>1;
	build(l,mid,root<<1),build(mid+1,r,root<<1|1);
	pushup(root);
}
void puttag(int root,ll delta) {
	tr[root]=delta+MX[root],mx[root]=lazy[root]=delta;
}
void pushdown(int root) {
	if (lazy[root]!=-INF) puttag(root<<1,lazy[root]),puttag(root<<1|1,lazy[root]),lazy[root]=-INF;
}
void update(int L,int R,int l,int r,int root,ll delta) {
	if (L>R) return;
	if (L<=l&&r<=R) { puttag(root,delta); return; }
	int mid=(l+r)>>1; pushdown(root);
	if (L<=mid) update(L,R,l,mid,root<<1,delta);
	if (mid<R) update(L,R,mid+1,r,root<<1|1,delta);
	pushup(root);
}
int query(int L,int R,int l,int r,int root,ll delta) {
	if (mx[root]<=delta) return n+1;
	if (L<=l&&r<=R) {
		if (l==r) return l;
		int mid=(l+r)>>1; pushdown(root);
		if (mx[root<<1]>delta) return query(L,R,l,mid,root<<1,delta);
		return query(L,R,mid+1,r,root<<1|1,delta);
	}
	int mid=(l+r)>>1;
	pushdown(root);
	int res=n+1;
	if (L<=mid) {
		res=query(L,R,l,mid,root<<1,delta);
		if (res!=n+1) return res;
	}
	if (mid<R) res=query(L,R,mid+1,r,root<<1|1,delta);
	return res;
}
ll query(int L,int R,int l,int r,int root) {
	if (L<=l&&r<=R) return tr[root];
	int mid=(l+r)>>1; pushdown(root);
	ll res=-INF;
	if (L<=mid) res=max(res,query(L,R,l,mid,root<<1));
	if (mid<R) res=max(res,query(L,R,mid+1,r,root<<1|1));
	return res;
}
};
int main() {
	//freopen("1.txt","r",stdin);
	read(n);
	for (int i=1;i<=n;i++) read(a[i]);
	for (int i=1;i<=n;i++) {
		while (tot&&a[st[tot]]<a[i]) tot--;
		if (tot) A[st[tot]].push_back(i); st[++tot]=i;
	}
	tot=0;
	for (int i=n;i>=1;i--) {
		while (tot&&a[st[tot]]<a[i]) tot--;
		if (tot) A[i].push_back(st[tot]); st[++tot]=i;
	}
	read(q);
	for (int i=1;i<=q;i++) {
		int x,y; read(x),read(y);
		g[x].push_back((node){y,i});
	}
	Seg::build(1,n,1);
	for (int i=n;i>=1;i--) {
		for (int &j : A[i]) if (j*2-i<=n) {
		//	printf("i=%d,j=%d\n",i,j);
			int R=Seg::query(j*2-i,n,1,n,1,a[i]+a[j])-1;
			Seg::update(j*2-i,R,1,n,1,a[i]+a[j]);
		}
		for (node &A : g[i]) {
			ans[A.id]=Seg::query(1,A.r,1,n,1);
		}
	}
	for (int i=1;i<=q;i++) printf("%lld\n",ans[i]);
	return 0;
}
/*
  0. Enough array size? Enough array size? Enough array size? Integer overflow?
  
  1. Think TWICE, Code ONCE!
  Are there any counterexamples to your algo?
    
  2. Be careful about the BOUNDARIES!
  N=1? P=1? Something about 0?
    
  3. Do not make STUPID MISTAKES!
  Time complexity? Memory usage? Precision error?
*/

Compilation message

jumps.cpp: In function 'int main()':
jumps.cpp:89:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   89 |   if (tot) A[st[tot]].push_back(i); st[++tot]=i;
      |   ^~
jumps.cpp:89:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   89 |   if (tot) A[st[tot]].push_back(i); st[++tot]=i;
      |                                     ^~
jumps.cpp:94:3: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   94 |   if (tot) A[i].push_back(st[tot]); st[++tot]=i;
      |   ^~
jumps.cpp:94:37: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   94 |   if (tot) A[i].push_back(st[tot]); st[++tot]=i;
      |                                     ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23800 KB Output is correct
3 Correct 12 ms 23776 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 12 ms 23792 KB Output is correct
7 Correct 14 ms 23856 KB Output is correct
8 Correct 13 ms 23796 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23800 KB Output is correct
3 Correct 12 ms 23776 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 12 ms 23792 KB Output is correct
7 Correct 14 ms 23856 KB Output is correct
8 Correct 13 ms 23796 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct
11 Correct 195 ms 41324 KB Output is correct
12 Correct 201 ms 41248 KB Output is correct
13 Correct 189 ms 41288 KB Output is correct
14 Correct 194 ms 41148 KB Output is correct
15 Correct 163 ms 41104 KB Output is correct
16 Correct 173 ms 40420 KB Output is correct
17 Correct 169 ms 40520 KB Output is correct
18 Correct 206 ms 40344 KB Output is correct
19 Correct 181 ms 40952 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 47980 KB Output is correct
2 Correct 97 ms 48332 KB Output is correct
3 Correct 85 ms 48320 KB Output is correct
4 Correct 173 ms 47820 KB Output is correct
5 Correct 189 ms 47864 KB Output is correct
6 Correct 168 ms 47868 KB Output is correct
7 Correct 172 ms 48460 KB Output is correct
8 Correct 160 ms 48588 KB Output is correct
9 Correct 168 ms 48792 KB Output is correct

Subtask #4
54.0 / 54.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23764 KB Output is correct
2 Correct 12 ms 23800 KB Output is correct
3 Correct 12 ms 23776 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 12 ms 23764 KB Output is correct
6 Correct 12 ms 23792 KB Output is correct
7 Correct 14 ms 23856 KB Output is correct
8 Correct 13 ms 23796 KB Output is correct
9 Correct 11 ms 23764 KB Output is correct
10 Correct 12 ms 23764 KB Output is correct
11 Correct 195 ms 41324 KB Output is correct
12 Correct 201 ms 41248 KB Output is correct
13 Correct 189 ms 41288 KB Output is correct
14 Correct 194 ms 41148 KB Output is correct
15 Correct 163 ms 41104 KB Output is correct
16 Correct 173 ms 40420 KB Output is correct
17 Correct 169 ms 40520 KB Output is correct
18 Correct 206 ms 40344 KB Output is correct
19 Correct 181 ms 40952 KB Output is correct
20 Correct 173 ms 47980 KB Output is correct
21 Correct 97 ms 48332 KB Output is correct
22 Correct 85 ms 48320 KB Output is correct
23 Correct 173 ms 47820 KB Output is correct
24 Correct 189 ms 47864 KB Output is correct
25 Correct 168 ms 47868 KB Output is correct
26 Correct 172 ms 48460 KB Output is correct
27 Correct 160 ms 48588 KB Output is correct
28 Correct 168 ms 48792 KB Output is correct
29 Correct 844 ms 101328 KB Output is correct
30 Correct 636 ms 105996 KB Output is correct
31 Correct 640 ms 105872 KB Output is correct
32 Correct 832 ms 104548 KB Output is correct
33 Correct 837 ms 104596 KB Output is correct
34 Correct 847 ms 102336 KB Output is correct
35 Correct 837 ms 101952 KB Output is correct
36 Correct 877 ms 102056 KB Output is correct
37 Correct 841 ms 103368 KB Output is correct
38 Correct 621 ms 110348 KB Output is correct
39 Correct 639 ms 110192 KB Output is correct
40 Correct 666 ms 107072 KB Output is correct
41 Correct 648 ms 106476 KB Output is correct
42 Correct 589 ms 106476 KB Output is correct
43 Correct 577 ms 108104 KB Output is correct
44 Correct 607 ms 109564 KB Output is correct
45 Correct 619 ms 109544 KB Output is correct
46 Correct 611 ms 106544 KB Output is correct
47 Correct 596 ms 106144 KB Output is correct
48 Correct 616 ms 106020 KB Output is correct
49 Correct 612 ms 108084 KB Output is correct
50 Correct 699 ms 107716 KB Output is correct
51 Correct 696 ms 107652 KB Output is correct
52 Correct 650 ms 105316 KB Output is correct
53 Correct 654 ms 104932 KB Output is correct
54 Correct 671 ms 104940 KB Output is correct
55 Correct 684 ms 106608 KB Output is correct