oj.uz

답안 #827498

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
827498 2023-08-16T14:09:27 Z MohamedAhmed04 유괴 2 (JOI17_abduction2) C++14
27 / 100
 43 ms 64632 KB 
#include <bits/stdc++.h>

using namespace std ;

const int MAX = 2004 ;

int a[MAX] , b[MAX] ;
int n , m , q ;

int dp[MAX][MAX][2] ;

set<int>sr[MAX] , sc[MAX] ;

int solve(int i , int j , bool flag)
{
	if(i < 1 || i > n || j < 1 || j > m)
		return 0 ;
	int &ret = dp[i][j][flag] ;
	if(ret != -1)
		return ret ;
	ret = 0 ;
	if(a[i] > b[j] || flag)
	{
		int j2 = j+1 ;
		while(j2 <= m && b[j2] < a[i])
			++j2 ;
		if(j2 == m+1)
			ret = max(ret , m-j) ;
		else
			ret = max(ret , solve(i , j2 , 0) + j2-j) ;
		if(!flag)
			sr[i].insert(j2) ;
		j2 = j-1 ;
		while(j2 >= 1 && b[j2] < a[i])
			--j2 ;
		if(!j2)
			ret = max(ret , j-1) ;
		else
			ret = max(ret , solve(i , j2 , 0) + j-j2) ;
		if(!flag)
			sr[i].insert(j2) ;
	}
	if(a[i] < b[j] || flag)
	{
		int i2 = i+1 ;
		while(i2 <= n && a[i2] < b[j])
			++i2 ;
		if(i2 == n+1)
			ret = max(ret , n-i) ;
		else
			ret = max(ret , solve(i2 , j , 0) + i2-i) ;
		if(!flag)
			sc[j].insert(i2) ;
		i2 = i-1 ;
		while(i2 >= 1 && a[i2] < b[j])
			--i2 ;
		if(!i2)
			ret = max(ret , i-1) ;
		else
			ret = max(ret , solve(i2 , j , 0) + i-i2) ;	
		if(!flag)
			sc[j].insert(i2) ;
	}
 	return ret ;
}

int main()
{
	memset(dp , -1 , sizeof(dp)) ;
	ios_base::sync_with_stdio(0) ;
	cin.tie(0) ;
	cin>>n>>m>>q ;
	for(int i = 1 ; i <= n ; ++i)
		cin>>a[i] ;
	for(int i = 1 ; i <= m ; ++i)
		cin>>b[i] ;
	while(q--)
	{
		for(int i = 1 ; i <= max(n , m) ; ++i)
			sr[i].clear() , sc[i].clear() ;
		int i , j ;
		cin>>i>>j ;
		cout<<solve(i , j , 1)<<"\n" ;
		for(int i = 1 ; i <= max(n , m) ; ++i)
			assert(max(sr[i].size() , sc[i].size()) <= 3) ;
	}
	return 0 ;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 31956 KB Output is correct
2 Correct 12 ms 31956 KB Output is correct
3 Correct 12 ms 31956 KB Output is correct
4 Correct 12 ms 31848 KB Output is correct
5 Correct 12 ms 31952 KB Output is correct
6 Correct 12 ms 31900 KB Output is correct
7 Correct 13 ms 31828 KB Output is correct
8 Correct 12 ms 31956 KB Output is correct
9 Correct 13 ms 31956 KB Output is correct
10 Correct 12 ms 31956 KB Output is correct
11 Correct 12 ms 31852 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 31956 KB Output is correct
2 Correct 12 ms 31956 KB Output is correct
3 Correct 12 ms 31956 KB Output is correct
4 Correct 12 ms 31848 KB Output is correct
5 Correct 12 ms 31952 KB Output is correct
6 Correct 12 ms 31900 KB Output is correct
7 Correct 13 ms 31828 KB Output is correct
8 Correct 12 ms 31956 KB Output is correct
9 Correct 13 ms 31956 KB Output is correct
10 Correct 12 ms 31956 KB Output is correct
11 Correct 12 ms 31852 KB Output is correct
12 Correct 12 ms 31964 KB Output is correct
13 Correct 12 ms 31960 KB Output is correct
14 Correct 13 ms 31956 KB Output is correct
15 Correct 13 ms 31968 KB Output is correct
16 Correct 13 ms 31944 KB Output is correct
17 Correct 13 ms 31992 KB Output is correct
18 Correct 13 ms 32040 KB Output is correct
19 Correct 15 ms 32092 KB Output is correct
20 Correct 15 ms 32252 KB Output is correct
21 Correct 16 ms 32152 KB Output is correct
22 Correct 16 ms 32368 KB Output is correct

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 31956 KB Output is correct
2 Correct 12 ms 31956 KB Output is correct
3 Correct 12 ms 31956 KB Output is correct
4 Correct 12 ms 31848 KB Output is correct
5 Correct 12 ms 31952 KB Output is correct
6 Correct 12 ms 31900 KB Output is correct
7 Correct 13 ms 31828 KB Output is correct
8 Correct 12 ms 31956 KB Output is correct
9 Correct 13 ms 31956 KB Output is correct
10 Correct 12 ms 31956 KB Output is correct
11 Correct 12 ms 31852 KB Output is correct
12 Correct 12 ms 31964 KB Output is correct
13 Correct 12 ms 31960 KB Output is correct
14 Correct 13 ms 31956 KB Output is correct
15 Correct 13 ms 31968 KB Output is correct
16 Correct 13 ms 31944 KB Output is correct
17 Correct 13 ms 31992 KB Output is correct
18 Correct 13 ms 32040 KB Output is correct
19 Correct 15 ms 32092 KB Output is correct
20 Correct 15 ms 32252 KB Output is correct
21 Correct 16 ms 32152 KB Output is correct
22 Correct 16 ms 32368 KB Output is correct
23 Runtime error 43 ms 64632 KB Execution killed with signal 11
24 Halted 0 ms 0 KB -

Subtask #4
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 31920 KB Output is correct
2 Correct 14 ms 31956 KB Output is correct
3 Correct 14 ms 31984 KB Output is correct
4 Correct 14 ms 31924 KB Output is correct
5 Correct 14 ms 31956 KB Output is correct
6 Correct 15 ms 32184 KB Output is correct
7 Correct 15 ms 32092 KB Output is correct
8 Correct 18 ms 32092 KB Output is correct
9 Correct 17 ms 32224 KB Output is correct
10 Correct 16 ms 32156 KB Output is correct
11 Correct 18 ms 32084 KB Output is correct

Subtask #5
0 / 56.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 31956 KB Output is correct
2 Correct 12 ms 31956 KB Output is correct
3 Correct 12 ms 31956 KB Output is correct
4 Correct 12 ms 31848 KB Output is correct
5 Correct 12 ms 31952 KB Output is correct
6 Correct 12 ms 31900 KB Output is correct
7 Correct 13 ms 31828 KB Output is correct
8 Correct 12 ms 31956 KB Output is correct
9 Correct 13 ms 31956 KB Output is correct
10 Correct 12 ms 31956 KB Output is correct
11 Correct 12 ms 31852 KB Output is correct
12 Correct 12 ms 31964 KB Output is correct
13 Correct 12 ms 31960 KB Output is correct
14 Correct 13 ms 31956 KB Output is correct
15 Correct 13 ms 31968 KB Output is correct
16 Correct 13 ms 31944 KB Output is correct
17 Correct 13 ms 31992 KB Output is correct
18 Correct 13 ms 32040 KB Output is correct
19 Correct 15 ms 32092 KB Output is correct
20 Correct 15 ms 32252 KB Output is correct
21 Correct 16 ms 32152 KB Output is correct
22 Correct 16 ms 32368 KB Output is correct
23 Runtime error 43 ms 64632 KB Execution killed with signal 11
24 Halted 0 ms 0 KB -