제출 #783238

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
783238		Dan4Life	Sightseeing in Kyoto (JOI22_kyoto)	C++17	40 / 100	62 ms	34504 KiB

kyoto

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define int long long
#define all(a) begin(a),end(a)
const int mxN = (int)2e3+10;
bool vis[mxN], xd[100010];
int n, m, dp[mxN][mxN];
int a[100010], b[100010];
vector<array<int,2>> A, B;
 
int32_t main()
{
	cin >> n >> m;
	for(int i = 0; i < n; i++) cin >> a[i];
	for(int i = 0; i < m; i++) cin >> b[i];
	if(n<=1000 and m<=1000){
		for(int i = 0; i < n; i++) A.pb({a[i],i});
		for(int i = 0; i < m; i++) B.pb({b[i],i});
	}
	else{
		for(int i = n-1; i >= 0; i--)
			if(!vis[a[i]]) vis[a[i]]=1,xd[i]=1;
		memset(vis,0,sizeof(vis));
		for(int i = 0; i < n; i++)
			if(!xd[i] and !vis[a[i]]) vis[a[i]]=1,xd[i]=1;
		for(int i = 0; i < n; i++) if(xd[i]) A.pb({a[i],i});
		memset(vis,0,sizeof(vis)); memset(xd,0,sizeof(xd));
		for(int i = m-1; i >= 0; i--)
			if(!vis[b[i]]) vis[b[i]]=1,xd[i]=1;
		memset(vis,0,sizeof(vis));
		for(int i = 0; i < m; i++)
			if(!xd[i] and !vis[b[i]]) vis[b[i]]=1,xd[i]=1;
		for(int i = 0; i < m; i++) if(xd[i]) B.pb({b[i],i});
	}
	n = (int)A.size(), m = (int)B.size();
	memset(dp,63,sizeof(dp)); dp[1][1] = 0;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			if(i>1) dp[i][j] = min(dp[i][j], dp[i-1][j]+B[j-1][0]*(A[i-1][1]-A[i-2][1]));
			if(j>1) dp[i][j] = min(dp[i][j], dp[i][j-1]+A[i-1][0]*(B[j-1][1]-B[j-2][1]));
		}
	}
	cout << dp[n][m];
}

• Subtask 1: 10 / 10
• Subtask 2: 30 / 30
• Subtask 3: 0 / 60