답안 #827454

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
827454	2023-08-16T13:34:50 Z	MohamedAhmed04	유괴 2 (JOI17_abduction2)	C++14	23 / 100	39 ms	64308 KB

abduction2

#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] ;

int cntr[MAX] , cntc[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 ;
	if(a[i] > b[j] && !flag)
		cntr[i]++ ;
	else if(!flag)
		cntc[j]++ ;
	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) ;
		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(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) ;
		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) ;	
	}
 	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--)
	{
		memset(cntr , 0 , sizeof(cntr)) ;
		memset(cntc , 0 , sizeof(cntc)) ;
		int i , j ;
		cin>>i>>j ;
		cout<<solve(i , j , 1)<<"\n" ;
		for(int k = 1 ; k <= n ; ++k)
			assert(cntr[k] <= 5) ;
		for(int k = 1 ; k <= m ; ++k)
			assert(cntc[k] <= 5) ;
	}
	return 0 ;
}

Subtask #1
13.0 / 13.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	31772 KB	Output is correct
2	Correct	12 ms	31776 KB	Output is correct
3	Correct	13 ms	31780 KB	Output is correct
4	Correct	15 ms	31676 KB	Output is correct
5	Correct	15 ms	31700 KB	Output is correct
6	Correct	13 ms	31764 KB	Output is correct
7	Correct	14 ms	31660 KB	Output is correct
8	Correct	13 ms	31692 KB	Output is correct
9	Correct	13 ms	31700 KB	Output is correct
10	Correct	13 ms	31700 KB	Output is correct
11	Correct	13 ms	31700 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	31772 KB	Output is correct
2	Correct	12 ms	31776 KB	Output is correct
3	Correct	13 ms	31780 KB	Output is correct
4	Correct	15 ms	31676 KB	Output is correct
5	Correct	15 ms	31700 KB	Output is correct
6	Correct	13 ms	31764 KB	Output is correct
7	Correct	14 ms	31660 KB	Output is correct
8	Correct	13 ms	31692 KB	Output is correct
9	Correct	13 ms	31700 KB	Output is correct
10	Correct	13 ms	31700 KB	Output is correct
11	Correct	13 ms	31700 KB	Output is correct
12	Correct	15 ms	31828 KB	Output is correct
13	Correct	13 ms	31764 KB	Output is correct
14	Correct	13 ms	31780 KB	Output is correct
15	Correct	13 ms	31712 KB	Output is correct
16	Correct	13 ms	31780 KB	Output is correct
17	Correct	13 ms	31780 KB	Output is correct
18	Correct	13 ms	31744 KB	Output is correct
19	Correct	18 ms	31872 KB	Output is correct
20	Correct	16 ms	31812 KB	Output is correct
21	Correct	14 ms	31784 KB	Output is correct
22	Correct	22 ms	31916 KB	Output is correct

Subtask #3
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	31772 KB	Output is correct
2	Correct	12 ms	31776 KB	Output is correct
3	Correct	13 ms	31780 KB	Output is correct
4	Correct	15 ms	31676 KB	Output is correct
5	Correct	15 ms	31700 KB	Output is correct
6	Correct	13 ms	31764 KB	Output is correct
7	Correct	14 ms	31660 KB	Output is correct
8	Correct	13 ms	31692 KB	Output is correct
9	Correct	13 ms	31700 KB	Output is correct
10	Correct	13 ms	31700 KB	Output is correct
11	Correct	13 ms	31700 KB	Output is correct
12	Correct	15 ms	31828 KB	Output is correct
13	Correct	13 ms	31764 KB	Output is correct
14	Correct	13 ms	31780 KB	Output is correct
15	Correct	13 ms	31712 KB	Output is correct
16	Correct	13 ms	31780 KB	Output is correct
17	Correct	13 ms	31780 KB	Output is correct
18	Correct	13 ms	31744 KB	Output is correct
19	Correct	18 ms	31872 KB	Output is correct
20	Correct	16 ms	31812 KB	Output is correct
21	Correct	14 ms	31784 KB	Output is correct
22	Correct	22 ms	31916 KB	Output is correct
23	Runtime error	39 ms	64264 KB	Execution killed with signal 11
24	Halted	0 ms	0 KB	-

Subtask #4
0 / 4.0

#	결과	실행 시간	메모리	Grader output
1	Runtime error	39 ms	64308 KB	Execution killed with signal 6
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 56.0

#	결과	실행 시간	메모리	Grader output
1	Correct	13 ms	31772 KB	Output is correct
2	Correct	12 ms	31776 KB	Output is correct
3	Correct	13 ms	31780 KB	Output is correct
4	Correct	15 ms	31676 KB	Output is correct
5	Correct	15 ms	31700 KB	Output is correct
6	Correct	13 ms	31764 KB	Output is correct
7	Correct	14 ms	31660 KB	Output is correct
8	Correct	13 ms	31692 KB	Output is correct
9	Correct	13 ms	31700 KB	Output is correct
10	Correct	13 ms	31700 KB	Output is correct
11	Correct	13 ms	31700 KB	Output is correct
12	Correct	15 ms	31828 KB	Output is correct
13	Correct	13 ms	31764 KB	Output is correct
14	Correct	13 ms	31780 KB	Output is correct
15	Correct	13 ms	31712 KB	Output is correct
16	Correct	13 ms	31780 KB	Output is correct
17	Correct	13 ms	31780 KB	Output is correct
18	Correct	13 ms	31744 KB	Output is correct
19	Correct	18 ms	31872 KB	Output is correct
20	Correct	16 ms	31812 KB	Output is correct
21	Correct	14 ms	31784 KB	Output is correct
22	Correct	22 ms	31916 KB	Output is correct
23	Runtime error	39 ms	64264 KB	Execution killed with signal 11
24	Halted	0 ms	0 KB	-

답안 #827454

Compilation message

Subtask #1 13.0 / 13.0

Subtask #2 10.0 / 10.0

Subtask #3 0 / 17.0

Subtask #4 0 / 4.0

Subtask #5 0 / 56.0

Subtask #1
13.0 / 13.0

Subtask #2
10.0 / 10.0

Subtask #3
0 / 17.0

Subtask #4
0 / 4.0

Subtask #5
0 / 56.0