Submission #1138356

#	Time	Username	Problem	Language	Result	Execution time	Memory
1138356		ten_xd	Exam (eJOI20_exam)	C++17	0 / 100	0 ms	396 KiB

exam

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(a,b) for(int a = 0; a < (b); ++a)
#define all(t) t.begin(), t.end()
#define pb push_back

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

const int N = 505, INF = 2e9+54321;
const ll INF_L = (ll)2e18+54321;

int n;
int A[N], B[N];
int dp[N][N];

void solve()
{
	cin >> n;
	rep(i,n) cin >> A[i];
	rep(i,n) cin >> B[i];

	for(int i = 1; i <= n; ++i)
	{
		for(int j = 0; j+i-1 < n; ++j)
		{
			int l = j, p = j+i-1;
			int mx = 0;

			dp[l][p] = 0;
			for(int k = l; k <= p; ++k) mx = max(mx,A[k]);
			for(int k = l; k <= p; ++k) if(B[k] == mx) ++dp[l][p];

			for(int k = p; k > l; --k) dp[l][p] = max(dp[l][p],dp[l][k-1]+dp[k][p]);
		}
	}

	cout << dp[0][n-1] << '\n';	
}

int main()
{	
	ios_base::sync_with_stdio(0);
	cin.tie(0);

	int T = 1;
	//cin >> T;
	while(T--) solve();

	return 0;
}

• Subtask 1: 0 / 14
• Subtask 2: 0 / 12
• Subtask 3: 0 / 13
• Subtask 4: 0 / 23
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22