oj.uz

Submission #624795

# Submission time Handle Problem Language Result Execution time Memory
624795 2022-08-08T18:18:02 Z CSQ31 Abduction 2 (JOI17_abduction2) C++17
44 / 100
 53 ms 22252 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;
typedef long long int ll;
const int MAXN = 5e4+5;
vector<int>a,b;
int h,w,q;
map<int,ll>dp[2][MAXN];
int lg[MAXN];
struct spt{
	vector<int>a;
	vector<vector<int>>mx;
	int n;
	spt(){}
	spt(vector<int>_a){
		a = _a;
		n = a.size();
		mx.resize(20);
		for(int i=0;i<20;i++)mx[i].assign(n,-1e9);
		for(int i=0;i<n;i++)mx[0][i] = a[i];
		for(int i=1;i<20;i++){
			for(int j=0;j+(1<<i)-1<n;j++){
				mx[i][j] = max(mx[i-1][j],mx[i-1][j+(1<<(i-1))]);
			}
		}
	}
	int query(int l,int r){
		int v = lg[r-l+1];
		int res = max(mx[v][l],mx[v][r-(1<<v)+1]);
		return res;
	}
	void print(){
		for(int i=0;i<20;i++){
			for(int j=0;j+(1<<i)-1<n;j++)cout<<mx[i][j]<<" ";
			cout<<'\n';
		}
		
		
	}
}mw,mh;
ll solve(ll i,ll j,ll k){
	if(dp[k][i].find(j) != dp[k][i].end())return dp[k][i][j];
	if(!k){
		dp[0][i][j] = -1e9;
	     ll l = j+1,r = w-1;
		while(r>=l){
			ll 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){
			ll 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;
		ll l = i+1,r = h-1;
		while(r>=l){
			ll mid = (l+r)/2;
			if(mh.query(i+1,mid) > b[j])r=mid-1;
			else l = mid+1;
		}
		if(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){
			ll 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(a);
	mw = spt(b);
	//mh.print();
	//mw.print();
	while(q--){
		int i,j;
		cin>>i>>j;
		i--;
		j--;
		ll 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 5204 KB Output is correct
2 Correct 4 ms 5204 KB Output is correct
3 Correct 3 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 4 ms 5204 KB Output is correct
8 Correct 3 ms 5204 KB Output is correct
9 Correct 2 ms 5204 KB Output is correct
10 Correct 3 ms 5144 KB Output is correct
11 Correct 2 ms 5204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5204 KB Output is correct
2 Correct 4 ms 5204 KB Output is correct
3 Correct 3 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 4 ms 5204 KB Output is correct
8 Correct 3 ms 5204 KB Output is correct
9 Correct 2 ms 5204 KB Output is correct
10 Correct 3 ms 5144 KB Output is correct
11 Correct 2 ms 5204 KB Output is correct
12 Correct 3 ms 5460 KB Output is correct
13 Correct 3 ms 5460 KB Output is correct
14 Correct 3 ms 5460 KB Output is correct
15 Correct 3 ms 5460 KB Output is correct
16 Correct 3 ms 5460 KB Output is correct
17 Correct 3 ms 5460 KB Output is correct
18 Correct 3 ms 5588 KB Output is correct
19 Correct 4 ms 5716 KB Output is correct
20 Correct 4 ms 5844 KB Output is correct
21 Correct 4 ms 5716 KB Output is correct
22 Correct 5 ms 5972 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5204 KB Output is correct
2 Correct 4 ms 5204 KB Output is correct
3 Correct 3 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 4 ms 5204 KB Output is correct
8 Correct 3 ms 5204 KB Output is correct
9 Correct 2 ms 5204 KB Output is correct
10 Correct 3 ms 5144 KB Output is correct
11 Correct 2 ms 5204 KB Output is correct
12 Correct 3 ms 5460 KB Output is correct
13 Correct 3 ms 5460 KB Output is correct
14 Correct 3 ms 5460 KB Output is correct
15 Correct 3 ms 5460 KB Output is correct
16 Correct 3 ms 5460 KB Output is correct
17 Correct 3 ms 5460 KB Output is correct
18 Correct 3 ms 5588 KB Output is correct
19 Correct 4 ms 5716 KB Output is correct
20 Correct 4 ms 5844 KB Output is correct
21 Correct 4 ms 5716 KB Output is correct
22 Correct 5 ms 5972 KB Output is correct
23 Correct 22 ms 13928 KB Output is correct
24 Correct 17 ms 13936 KB Output is correct
25 Correct 17 ms 13968 KB Output is correct
26 Correct 18 ms 13932 KB Output is correct
27 Correct 27 ms 13968 KB Output is correct
28 Correct 26 ms 19440 KB Output is correct
29 Correct 20 ms 14572 KB Output is correct
30 Correct 42 ms 20280 KB Output is correct
31 Correct 53 ms 22252 KB Output is correct
32 Correct 19 ms 14036 KB Output is correct
33 Correct 22 ms 15852 KB Output is correct

Subtask #4
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5716 KB Output is correct
2 Correct 5 ms 5716 KB Output is correct
3 Correct 4 ms 5716 KB Output is correct
4 Correct 4 ms 5716 KB Output is correct
5 Correct 5 ms 5716 KB Output is correct
6 Correct 4 ms 5844 KB Output is correct
7 Correct 3 ms 5716 KB Output is correct
8 Correct 5 ms 5936 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 5204 KB Output is correct
2 Correct 4 ms 5204 KB Output is correct
3 Correct 3 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 4 ms 5204 KB Output is correct
8 Correct 3 ms 5204 KB Output is correct
9 Correct 2 ms 5204 KB Output is correct
10 Correct 3 ms 5144 KB Output is correct
11 Correct 2 ms 5204 KB Output is correct
12 Correct 3 ms 5460 KB Output is correct
13 Correct 3 ms 5460 KB Output is correct
14 Correct 3 ms 5460 KB Output is correct
15 Correct 3 ms 5460 KB Output is correct
16 Correct 3 ms 5460 KB Output is correct
17 Correct 3 ms 5460 KB Output is correct
18 Correct 3 ms 5588 KB Output is correct
19 Correct 4 ms 5716 KB Output is correct
20 Correct 4 ms 5844 KB Output is correct
21 Correct 4 ms 5716 KB Output is correct
22 Correct 5 ms 5972 KB Output is correct
23 Correct 22 ms 13928 KB Output is correct
24 Correct 17 ms 13936 KB Output is correct
25 Correct 17 ms 13968 KB Output is correct
26 Correct 18 ms 13932 KB Output is correct
27 Correct 27 ms 13968 KB Output is correct
28 Correct 26 ms 19440 KB Output is correct
29 Correct 20 ms 14572 KB Output is correct
30 Correct 42 ms 20280 KB Output is correct
31 Correct 53 ms 22252 KB Output is correct
32 Correct 19 ms 14036 KB Output is correct
33 Correct 22 ms 15852 KB Output is correct
34 Correct 4 ms 5716 KB Output is correct
35 Correct 5 ms 5716 KB Output is correct
36 Correct 4 ms 5716 KB Output is correct
37 Correct 4 ms 5716 KB Output is correct
38 Correct 5 ms 5716 KB Output is correct
39 Correct 4 ms 5844 KB Output is correct
40 Correct 3 ms 5716 KB Output is correct
41 Correct 5 ms 5936 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 19 ms 14096 KB Output is correct
46 Correct 19 ms 14096 KB Output is correct
47 Correct 19 ms 14064 KB Output is correct
48 Incorrect 19 ms 14064 KB Output isn't correct
49 Halted 0 ms 0 KB -