oj.uz

답안 #783228

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
783228 2023-07-14T18:27:59 Z Dan4Life Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
 9 ms 8360 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)1e3+10;
bool vis[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(!i or !vis[a[i]]) vis[a[i]]=1, A.pb({a[i],i});
		memset(vis,0,sizeof(vis));
		for(int i = m-1; i >= 0; i--)
			if(!i or !vis[b[i]]) vis[b[i]]=1, B.pb({b[i],i});
		reverse(all(A)), reverse(all(B));
	}
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8276 KB Output is correct
2 Correct 4 ms 8276 KB Output is correct
3 Correct 4 ms 8276 KB Output is correct
4 Correct 4 ms 8276 KB Output is correct
5 Correct 3 ms 8256 KB Output is correct
6 Correct 4 ms 8276 KB Output is correct
7 Correct 4 ms 8276 KB Output is correct
8 Correct 3 ms 8276 KB Output is correct
9 Correct 7 ms 8276 KB Output is correct
10 Correct 7 ms 8276 KB Output is correct
11 Correct 7 ms 8276 KB Output is correct
12 Correct 7 ms 8276 KB Output is correct
13 Correct 9 ms 8360 KB Output is correct
14 Correct 7 ms 8356 KB Output is correct
15 Correct 7 ms 8276 KB Output is correct
16 Correct 7 ms 8276 KB Output is correct
17 Correct 8 ms 8276 KB Output is correct
18 Correct 3 ms 8276 KB Output is correct
19 Correct 3 ms 8276 KB Output is correct
20 Correct 3 ms 8276 KB Output is correct
21 Correct 3 ms 8276 KB Output is correct
22 Correct 3 ms 8276 KB Output is correct
23 Correct 3 ms 8276 KB Output is correct
24 Correct 3 ms 8276 KB Output is correct
25 Correct 3 ms 8276 KB Output is correct
26 Correct 3 ms 8276 KB Output is correct
27 Correct 4 ms 8276 KB Output is correct
28 Correct 3 ms 8276 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 8276 KB Output is correct
2 Correct 3 ms 8276 KB Output is correct
3 Incorrect 4 ms 8276 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8276 KB Output is correct
2 Correct 4 ms 8276 KB Output is correct
3 Correct 4 ms 8276 KB Output is correct
4 Correct 4 ms 8276 KB Output is correct
5 Correct 3 ms 8256 KB Output is correct
6 Correct 4 ms 8276 KB Output is correct
7 Correct 4 ms 8276 KB Output is correct
8 Correct 3 ms 8276 KB Output is correct
9 Correct 7 ms 8276 KB Output is correct
10 Correct 7 ms 8276 KB Output is correct
11 Correct 7 ms 8276 KB Output is correct
12 Correct 7 ms 8276 KB Output is correct
13 Correct 9 ms 8360 KB Output is correct
14 Correct 7 ms 8356 KB Output is correct
15 Correct 7 ms 8276 KB Output is correct
16 Correct 7 ms 8276 KB Output is correct
17 Correct 8 ms 8276 KB Output is correct
18 Correct 3 ms 8276 KB Output is correct
19 Correct 3 ms 8276 KB Output is correct
20 Correct 3 ms 8276 KB Output is correct
21 Correct 3 ms 8276 KB Output is correct
22 Correct 3 ms 8276 KB Output is correct
23 Correct 3 ms 8276 KB Output is correct
24 Correct 3 ms 8276 KB Output is correct
25 Correct 3 ms 8276 KB Output is correct
26 Correct 3 ms 8276 KB Output is correct
27 Correct 4 ms 8276 KB Output is correct
28 Correct 3 ms 8276 KB Output is correct
29 Correct 3 ms 8276 KB Output is correct
30 Correct 3 ms 8276 KB Output is correct
31 Incorrect 4 ms 8276 KB Output isn't correct
32 Halted 0 ms 0 KB -