oj.uz

Submission #783234

# Submission time Handle Problem Language Result Execution time Memory
783234 2023-07-14T18:36:00 Z Dan4Life Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
 20 ms 32000 KB 
#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[mxN];
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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31828 KB Output is correct
2 Correct 13 ms 31828 KB Output is correct
3 Correct 13 ms 31828 KB Output is correct
4 Correct 12 ms 31956 KB Output is correct
5 Correct 14 ms 31900 KB Output is correct
6 Correct 13 ms 31876 KB Output is correct
7 Correct 13 ms 31852 KB Output is correct
8 Correct 12 ms 31924 KB Output is correct
9 Correct 20 ms 31956 KB Output is correct
10 Correct 17 ms 31956 KB Output is correct
11 Correct 17 ms 32000 KB Output is correct
12 Correct 19 ms 31960 KB Output is correct
13 Correct 17 ms 31996 KB Output is correct
14 Correct 17 ms 31956 KB Output is correct
15 Correct 17 ms 31956 KB Output is correct
16 Correct 17 ms 31916 KB Output is correct
17 Correct 17 ms 31956 KB Output is correct
18 Correct 13 ms 31912 KB Output is correct
19 Correct 12 ms 31888 KB Output is correct
20 Correct 13 ms 31828 KB Output is correct
21 Correct 13 ms 31920 KB Output is correct
22 Correct 13 ms 31828 KB Output is correct
23 Correct 12 ms 31828 KB Output is correct
24 Correct 12 ms 31820 KB Output is correct
25 Correct 12 ms 31932 KB Output is correct
26 Correct 13 ms 31928 KB Output is correct
27 Correct 12 ms 31888 KB Output is correct
28 Correct 12 ms 31828 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31828 KB Output is correct
2 Correct 13 ms 31832 KB Output is correct
3 Correct 16 ms 31956 KB Output is correct
4 Runtime error 14 ms 1988 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31828 KB Output is correct
2 Correct 13 ms 31828 KB Output is correct
3 Correct 13 ms 31828 KB Output is correct
4 Correct 12 ms 31956 KB Output is correct
5 Correct 14 ms 31900 KB Output is correct
6 Correct 13 ms 31876 KB Output is correct
7 Correct 13 ms 31852 KB Output is correct
8 Correct 12 ms 31924 KB Output is correct
9 Correct 20 ms 31956 KB Output is correct
10 Correct 17 ms 31956 KB Output is correct
11 Correct 17 ms 32000 KB Output is correct
12 Correct 19 ms 31960 KB Output is correct
13 Correct 17 ms 31996 KB Output is correct
14 Correct 17 ms 31956 KB Output is correct
15 Correct 17 ms 31956 KB Output is correct
16 Correct 17 ms 31916 KB Output is correct
17 Correct 17 ms 31956 KB Output is correct
18 Correct 13 ms 31912 KB Output is correct
19 Correct 12 ms 31888 KB Output is correct
20 Correct 13 ms 31828 KB Output is correct
21 Correct 13 ms 31920 KB Output is correct
22 Correct 13 ms 31828 KB Output is correct
23 Correct 12 ms 31828 KB Output is correct
24 Correct 12 ms 31820 KB Output is correct
25 Correct 12 ms 31932 KB Output is correct
26 Correct 13 ms 31928 KB Output is correct
27 Correct 12 ms 31888 KB Output is correct
28 Correct 12 ms 31828 KB Output is correct
29 Correct 13 ms 31828 KB Output is correct
30 Correct 13 ms 31832 KB Output is correct
31 Correct 16 ms 31956 KB Output is correct
32 Runtime error 14 ms 1988 KB Execution killed with signal 11
33 Halted 0 ms 0 KB -