#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]] or !i) vis[a[i]]=1,xd[i]=1;
memset(vis,0,sizeof(vis));
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]] or !i) vis[b[i]]=1,xd[i]=1;
memset(vis,0,sizeof(vis));
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];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
31944 KB |
Output is correct |
2 |
Correct |
13 ms |
31828 KB |
Output is correct |
3 |
Correct |
12 ms |
31832 KB |
Output is correct |
4 |
Correct |
13 ms |
31956 KB |
Output is correct |
5 |
Correct |
13 ms |
31896 KB |
Output is correct |
6 |
Correct |
13 ms |
31956 KB |
Output is correct |
7 |
Correct |
13 ms |
31836 KB |
Output is correct |
8 |
Correct |
13 ms |
31888 KB |
Output is correct |
9 |
Correct |
17 ms |
32104 KB |
Output is correct |
10 |
Correct |
18 ms |
31956 KB |
Output is correct |
11 |
Correct |
15 ms |
31956 KB |
Output is correct |
12 |
Correct |
15 ms |
31956 KB |
Output is correct |
13 |
Correct |
16 ms |
31908 KB |
Output is correct |
14 |
Correct |
16 ms |
32004 KB |
Output is correct |
15 |
Correct |
16 ms |
31940 KB |
Output is correct |
16 |
Correct |
17 ms |
32004 KB |
Output is correct |
17 |
Correct |
17 ms |
31956 KB |
Output is correct |
18 |
Correct |
12 ms |
31876 KB |
Output is correct |
19 |
Correct |
12 ms |
31828 KB |
Output is correct |
20 |
Correct |
11 ms |
31828 KB |
Output is correct |
21 |
Correct |
12 ms |
31900 KB |
Output is correct |
22 |
Correct |
11 ms |
31816 KB |
Output is correct |
23 |
Correct |
11 ms |
31836 KB |
Output is correct |
24 |
Correct |
11 ms |
31828 KB |
Output is correct |
25 |
Correct |
11 ms |
31916 KB |
Output is correct |
26 |
Correct |
12 ms |
31828 KB |
Output is correct |
27 |
Correct |
11 ms |
31840 KB |
Output is correct |
28 |
Correct |
11 ms |
31828 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
10 ms |
31828 KB |
Output is correct |
2 |
Correct |
10 ms |
31828 KB |
Output is correct |
3 |
Incorrect |
12 ms |
32004 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
14 ms |
31944 KB |
Output is correct |
2 |
Correct |
13 ms |
31828 KB |
Output is correct |
3 |
Correct |
12 ms |
31832 KB |
Output is correct |
4 |
Correct |
13 ms |
31956 KB |
Output is correct |
5 |
Correct |
13 ms |
31896 KB |
Output is correct |
6 |
Correct |
13 ms |
31956 KB |
Output is correct |
7 |
Correct |
13 ms |
31836 KB |
Output is correct |
8 |
Correct |
13 ms |
31888 KB |
Output is correct |
9 |
Correct |
17 ms |
32104 KB |
Output is correct |
10 |
Correct |
18 ms |
31956 KB |
Output is correct |
11 |
Correct |
15 ms |
31956 KB |
Output is correct |
12 |
Correct |
15 ms |
31956 KB |
Output is correct |
13 |
Correct |
16 ms |
31908 KB |
Output is correct |
14 |
Correct |
16 ms |
32004 KB |
Output is correct |
15 |
Correct |
16 ms |
31940 KB |
Output is correct |
16 |
Correct |
17 ms |
32004 KB |
Output is correct |
17 |
Correct |
17 ms |
31956 KB |
Output is correct |
18 |
Correct |
12 ms |
31876 KB |
Output is correct |
19 |
Correct |
12 ms |
31828 KB |
Output is correct |
20 |
Correct |
11 ms |
31828 KB |
Output is correct |
21 |
Correct |
12 ms |
31900 KB |
Output is correct |
22 |
Correct |
11 ms |
31816 KB |
Output is correct |
23 |
Correct |
11 ms |
31836 KB |
Output is correct |
24 |
Correct |
11 ms |
31828 KB |
Output is correct |
25 |
Correct |
11 ms |
31916 KB |
Output is correct |
26 |
Correct |
12 ms |
31828 KB |
Output is correct |
27 |
Correct |
11 ms |
31840 KB |
Output is correct |
28 |
Correct |
11 ms |
31828 KB |
Output is correct |
29 |
Correct |
10 ms |
31828 KB |
Output is correct |
30 |
Correct |
10 ms |
31828 KB |
Output is correct |
31 |
Incorrect |
12 ms |
32004 KB |
Output isn't correct |
32 |
Halted |
0 ms |
0 KB |
- |