oj.uz

Submission #624789

# Submission time Handle Problem Language Result Execution time Memory
624789 2022-08-08T18:11:57 Z CSQ31 Abduction 2 (JOI17_abduction2) C++17
44 / 100
 65 ms 24528 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
typedef pair<int,int> pii;
const int MAXN = 5e4+5;
vector<int>a,b;
int h,w,q;
map<int,int>dp[2][MAXN];
int lg[MAXN];
struct SPT
{
	vector<int>lg;
	vector<vector<int>> s;
	//zero indexed
	//modify s and a to whatever type works
	SPT(){}
	SPT(int n,int lim,vector<int>a)
	{
		s.resize(n);
		lg.resize(n+1);
		lg[1] = 0;
		for(int i=2;i<=n;i++)lg[i] = lg[i/2]+1;
		for(int i=0;i<n;i++){
			s[i].resize(lim+1);
			s[i][0] = a[i];
		}
		for(int k=1;k<=lim;k++){
			for(int i=0;i+(1<<k)-1<n;i++){
				s[i][k] = max(s[i][k-1] , s[i + (1<<(k-1))][k-1]);
			}
		}
	}
	int query(int l,int r)
	{
		int j = lg[r-l+1];
		return max(s[l][j],s[r-(1<<j)+1][j]);
	}
}mw,mh;
int solve(int i,int j,int k){
	if(dp[k][i].find(j) != dp[k][i].end())return dp[k][i][j];
	if(!k){
		dp[0][i][j] = -1e9;
		int l = j+1,r = w-1;
		while(r>=l){
			int mid = (l+r)/2;
			if(mw.query(j+1,mid) > a[i])r=mid-1;
			else l = mid+1;
		}
		if(l<w)dp[0][i][j] = max(dp[0][i][j],solve(i,l,1) + l - j);
		l = 0;
		r = j-1;
		while(r>=l){
			int mid = (l+r)/2;
			if(mw.query(mid,j-1) > a[i])l = mid+1;
			else r = mid-1;
		}
		if(r>=0)dp[0][i][j] = max(dp[0][i][j],solve(i,r,1) + j - r);
		if(dp[0][i][j] == -1e9)dp[0][i][j] = max(w-1-j,j);
	}else{
		dp[1][i][j] = -1e9;
		int l = i+1,r = h-1;
		while(r>=l){
			int mid = (l+r)/2;
			if(mh.query(i+1,mid) > b[j])r=mid-1;
			else l = mid+1;
		}
		if(l>i && l<h)dp[1][i][j] = max(dp[1][i][j],solve(l,j,0) + l - i);
		l = 0;
		r = i-1;
		while(r>=l){
			int mid = (l+r)/2;
			if(mh.query(mid,i-1) > b[j])l = mid+1;
			else r = mid-1;
		}
		if(r>=0)dp[1][i][j] = max(dp[1][i][j],solve(r,j,0) + i - r);
		if(dp[1][i][j] == -1e9)dp[1][i][j] = max(h-1-i,i);
	}
	return dp[k][i][j];
}
int main()
{
	owo
	cin>>h>>w>>q;
	a.resize(h);
	b.resize(w);
	for(int i=0;i<h;i++)cin>>a[i];
	for(int i=0;i<w;i++)cin>>b[i];
	lg[1] = 0;
	for(int i=2;i<=50000;i++)lg[i] = lg[i/2]+1;
	mh = SPT(h,20,a);
	mw = SPT(w,20,b);
	//mh.print();
	//mw.print();
	while(q--){
		int i,j;
		cin>>i>>j;
		i--;
		j--;
		int ans = max(solve(i,j,0),solve(i,j,1));
		cout<<ans<<'\n';
	}
	
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5200 KB Output is correct
2 Correct 3 ms 5204 KB Output is correct
3 Correct 4 ms 5204 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 4 ms 5204 KB Output is correct
6 Correct 3 ms 5204 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 2 ms 5204 KB Output is correct
9 Correct 2 ms 5204 KB Output is correct
10 Correct 3 ms 5204 KB Output is correct
11 Correct 3 ms 5204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5200 KB Output is correct
2 Correct 3 ms 5204 KB Output is correct
3 Correct 4 ms 5204 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 4 ms 5204 KB Output is correct
6 Correct 3 ms 5204 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 2 ms 5204 KB Output is correct
9 Correct 2 ms 5204 KB Output is correct
10 Correct 3 ms 5204 KB Output is correct
11 Correct 3 ms 5204 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 4 ms 5716 KB Output is correct
15 Correct 3 ms 5716 KB Output is correct
16 Correct 3 ms 5716 KB Output is correct
17 Correct 4 ms 5716 KB Output is correct
18 Correct 4 ms 5716 KB Output is correct
19 Correct 4 ms 5784 KB Output is correct
20 Correct 5 ms 5972 KB Output is correct
21 Correct 5 ms 5844 KB Output is correct
22 Correct 5 ms 6100 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5200 KB Output is correct
2 Correct 3 ms 5204 KB Output is correct
3 Correct 4 ms 5204 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 4 ms 5204 KB Output is correct
6 Correct 3 ms 5204 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 2 ms 5204 KB Output is correct
9 Correct 2 ms 5204 KB Output is correct
10 Correct 3 ms 5204 KB Output is correct
11 Correct 3 ms 5204 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 4 ms 5716 KB Output is correct
15 Correct 3 ms 5716 KB Output is correct
16 Correct 3 ms 5716 KB Output is correct
17 Correct 4 ms 5716 KB Output is correct
18 Correct 4 ms 5716 KB Output is correct
19 Correct 4 ms 5784 KB Output is correct
20 Correct 5 ms 5972 KB Output is correct
21 Correct 5 ms 5844 KB Output is correct
22 Correct 5 ms 6100 KB Output is correct
23 Correct 30 ms 17828 KB Output is correct
24 Correct 28 ms 17876 KB Output is correct
25 Correct 29 ms 17936 KB Output is correct
26 Correct 30 ms 17832 KB Output is correct
27 Correct 29 ms 17864 KB Output is correct
28 Correct 41 ms 22820 KB Output is correct
29 Correct 29 ms 18420 KB Output is correct
30 Correct 56 ms 23000 KB Output is correct
31 Correct 65 ms 24528 KB Output is correct
32 Correct 27 ms 17828 KB Output is correct
33 Correct 34 ms 19396 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5844 KB Output is correct
2 Correct 6 ms 5792 KB Output is correct
3 Correct 5 ms 5844 KB Output is correct
4 Correct 4 ms 5844 KB Output is correct
5 Correct 4 ms 5836 KB Output is correct
6 Correct 4 ms 5900 KB Output is correct
7 Correct 4 ms 5844 KB Output is correct
8 Correct 5 ms 6060 KB Output is correct
9 Correct 5 ms 5972 KB Output is correct
10 Correct 5 ms 5972 KB Output is correct
11 Correct 5 ms 6100 KB Output is correct

Subtask #5
0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5200 KB Output is correct
2 Correct 3 ms 5204 KB Output is correct
3 Correct 4 ms 5204 KB Output is correct
4 Correct 3 ms 5204 KB Output is correct
5 Correct 4 ms 5204 KB Output is correct
6 Correct 3 ms 5204 KB Output is correct
7 Correct 3 ms 5204 KB Output is correct
8 Correct 2 ms 5204 KB Output is correct
9 Correct 2 ms 5204 KB Output is correct
10 Correct 3 ms 5204 KB Output is correct
11 Correct 3 ms 5204 KB Output is correct
12 Correct 3 ms 5716 KB Output is correct
13 Correct 3 ms 5716 KB Output is correct
14 Correct 4 ms 5716 KB Output is correct
15 Correct 3 ms 5716 KB Output is correct
16 Correct 3 ms 5716 KB Output is correct
17 Correct 4 ms 5716 KB Output is correct
18 Correct 4 ms 5716 KB Output is correct
19 Correct 4 ms 5784 KB Output is correct
20 Correct 5 ms 5972 KB Output is correct
21 Correct 5 ms 5844 KB Output is correct
22 Correct 5 ms 6100 KB Output is correct
23 Correct 30 ms 17828 KB Output is correct
24 Correct 28 ms 17876 KB Output is correct
25 Correct 29 ms 17936 KB Output is correct
26 Correct 30 ms 17832 KB Output is correct
27 Correct 29 ms 17864 KB Output is correct
28 Correct 41 ms 22820 KB Output is correct
29 Correct 29 ms 18420 KB Output is correct
30 Correct 56 ms 23000 KB Output is correct
31 Correct 65 ms 24528 KB Output is correct
32 Correct 27 ms 17828 KB Output is correct
33 Correct 34 ms 19396 KB Output is correct
34 Correct 6 ms 5844 KB Output is correct
35 Correct 6 ms 5792 KB Output is correct
36 Correct 5 ms 5844 KB Output is correct
37 Correct 4 ms 5844 KB Output is correct
38 Correct 4 ms 5836 KB Output is correct
39 Correct 4 ms 5900 KB Output is correct
40 Correct 4 ms 5844 KB Output is correct
41 Correct 5 ms 6060 KB Output is correct
42 Correct 5 ms 5972 KB Output is correct
43 Correct 5 ms 5972 KB Output is correct
44 Correct 5 ms 6100 KB Output is correct
45 Correct 32 ms 17904 KB Output is correct
46 Correct 29 ms 17936 KB Output is correct
47 Correct 29 ms 17916 KB Output is correct
48 Incorrect 32 ms 17928 KB Output isn't correct
49 Halted 0 ms 0 KB -