Submission #783238

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
783238	2023-07-14T18:39:01 Z	Dan4Life	Sightseeing in Kyoto (JOI22_kyoto)	C++17	40 / 100	62 ms	34504 KB

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.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	31828 KB	Output is correct
2	Correct	12 ms	31940 KB	Output is correct
3	Correct	12 ms	31892 KB	Output is correct
4	Correct	12 ms	31956 KB	Output is correct
5	Correct	12 ms	31956 KB	Output is correct
6	Correct	14 ms	31956 KB	Output is correct
7	Correct	12 ms	31956 KB	Output is correct
8	Correct	12 ms	31836 KB	Output is correct
9	Correct	16 ms	31956 KB	Output is correct
10	Correct	16 ms	32008 KB	Output is correct
11	Correct	16 ms	32000 KB	Output is correct
12	Correct	16 ms	32004 KB	Output is correct
13	Correct	19 ms	31908 KB	Output is correct
14	Correct	17 ms	31956 KB	Output is correct
15	Correct	17 ms	32000 KB	Output is correct
16	Correct	17 ms	31884 KB	Output is correct
17	Correct	17 ms	31908 KB	Output is correct
18	Correct	12 ms	31828 KB	Output is correct
19	Correct	12 ms	31828 KB	Output is correct
20	Correct	12 ms	31828 KB	Output is correct
21	Correct	12 ms	31908 KB	Output is correct
22	Correct	12 ms	31832 KB	Output is correct
23	Correct	12 ms	31896 KB	Output is correct
24	Correct	12 ms	31828 KB	Output is correct
25	Correct	12 ms	31860 KB	Output is correct
26	Correct	12 ms	31888 KB	Output is correct
27	Correct	12 ms	31828 KB	Output is correct
28	Correct	12 ms	31900 KB	Output is correct

Subtask #2
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	31932 KB	Output is correct
2	Correct	12 ms	31840 KB	Output is correct
3	Correct	14 ms	32084 KB	Output is correct
4	Correct	39 ms	32752 KB	Output is correct
5	Correct	29 ms	32824 KB	Output is correct
6	Correct	17 ms	32456 KB	Output is correct
7	Correct	57 ms	34396 KB	Output is correct
8	Correct	57 ms	34380 KB	Output is correct
9	Correct	58 ms	34444 KB	Output is correct
10	Correct	57 ms	34332 KB	Output is correct
11	Correct	55 ms	34328 KB	Output is correct
12	Correct	59 ms	34416 KB	Output is correct
13	Correct	58 ms	34444 KB	Output is correct
14	Correct	62 ms	34448 KB	Output is correct
15	Correct	48 ms	34504 KB	Output is correct
16	Correct	13 ms	31920 KB	Output is correct
17	Correct	12 ms	31932 KB	Output is correct
18	Correct	13 ms	31828 KB	Output is correct
19	Correct	12 ms	31836 KB	Output is correct
20	Correct	12 ms	31920 KB	Output is correct
21	Correct	12 ms	31928 KB	Output is correct
22	Correct	12 ms	31896 KB	Output is correct
23	Correct	12 ms	31828 KB	Output is correct
24	Correct	12 ms	31828 KB	Output is correct
25	Correct	12 ms	31828 KB	Output is correct
26	Correct	12 ms	31828 KB	Output is correct

Subtask #3
0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	13 ms	31828 KB	Output is correct
2	Correct	12 ms	31940 KB	Output is correct
3	Correct	12 ms	31892 KB	Output is correct
4	Correct	12 ms	31956 KB	Output is correct
5	Correct	12 ms	31956 KB	Output is correct
6	Correct	14 ms	31956 KB	Output is correct
7	Correct	12 ms	31956 KB	Output is correct
8	Correct	12 ms	31836 KB	Output is correct
9	Correct	16 ms	31956 KB	Output is correct
10	Correct	16 ms	32008 KB	Output is correct
11	Correct	16 ms	32000 KB	Output is correct
12	Correct	16 ms	32004 KB	Output is correct
13	Correct	19 ms	31908 KB	Output is correct
14	Correct	17 ms	31956 KB	Output is correct
15	Correct	17 ms	32000 KB	Output is correct
16	Correct	17 ms	31884 KB	Output is correct
17	Correct	17 ms	31908 KB	Output is correct
18	Correct	12 ms	31828 KB	Output is correct
19	Correct	12 ms	31828 KB	Output is correct
20	Correct	12 ms	31828 KB	Output is correct
21	Correct	12 ms	31908 KB	Output is correct
22	Correct	12 ms	31832 KB	Output is correct
23	Correct	12 ms	31896 KB	Output is correct
24	Correct	12 ms	31828 KB	Output is correct
25	Correct	12 ms	31860 KB	Output is correct
26	Correct	12 ms	31888 KB	Output is correct
27	Correct	12 ms	31828 KB	Output is correct
28	Correct	12 ms	31900 KB	Output is correct
29	Correct	12 ms	31932 KB	Output is correct
30	Correct	12 ms	31840 KB	Output is correct
31	Correct	14 ms	32084 KB	Output is correct
32	Correct	39 ms	32752 KB	Output is correct
33	Correct	29 ms	32824 KB	Output is correct
34	Correct	17 ms	32456 KB	Output is correct
35	Correct	57 ms	34396 KB	Output is correct
36	Correct	57 ms	34380 KB	Output is correct
37	Correct	58 ms	34444 KB	Output is correct
38	Correct	57 ms	34332 KB	Output is correct
39	Correct	55 ms	34328 KB	Output is correct
40	Correct	59 ms	34416 KB	Output is correct
41	Correct	58 ms	34444 KB	Output is correct
42	Correct	62 ms	34448 KB	Output is correct
43	Correct	48 ms	34504 KB	Output is correct
44	Correct	13 ms	31920 KB	Output is correct
45	Correct	12 ms	31932 KB	Output is correct
46	Correct	13 ms	31828 KB	Output is correct
47	Correct	12 ms	31836 KB	Output is correct
48	Correct	12 ms	31920 KB	Output is correct
49	Correct	12 ms	31928 KB	Output is correct
50	Correct	12 ms	31896 KB	Output is correct
51	Correct	12 ms	31828 KB	Output is correct
52	Correct	12 ms	31828 KB	Output is correct
53	Correct	12 ms	31828 KB	Output is correct
54	Correct	12 ms	31828 KB	Output is correct
55	Runtime error	28 ms	2684 KB	Execution killed with signal 11
56	Halted	0 ms	0 KB	-

Submission #783238

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 30.0 / 30.0

Subtask #3 0 / 60.0

Subtask #1
10.0 / 10.0

Subtask #2
30.0 / 30.0

Subtask #3
0 / 60.0