답안 #910084

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
910084	2024-01-17T21:17:30 Z	OAleksa	Collecting Stamps 3 (JOI20_ho_t3)	C++14	15 / 100	6 ms	1624 KB

ho_t3

#include <bits/stdc++.h>
//ako ovaj vaso daso misli da me pobedjuje.....
using namespace std;
#define int long long
#define f first
#define s second
const int N = 210;
const int inf = 1e18;
int n, l, x[N], t[N], dp[N][N][2][2];
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int tt = 1;
  //cin >> tt;
  while (tt--) {
  	cin >> n >> l;
  	for (int i = 1;i <= n;i++) {
  		cin >> x[i];
  	}
  	for (int i = 1;i <= n;i++) {
  		cin >> t[i];
  	}
  	x[n + 1] = l;
  	for (int i = 0;i <= n;i++) {
  		for (int j = 0;j <= n;j++)
  			dp[i][j][0][0] = dp[i][j][1][0] = inf;
  	}
  	//3-i/j
  	//4-time/skor
  	dp[0][0][0][0] = dp[0][0][1][0] = 0;
  	int ans = 0;
  	for (int i = 0;i <= n;i++) {
  		for (int j = 0;j <= n;j++) {
  			if (i + j > n)
  				break;
  			for (int k = i - 1;k >= 0;k--) {
  				int time = dp[k][j][0][0] + abs(x[i] - x[k]);
  				if (time <= t[i]) {
  					if (dp[i][j][0][1] < dp[k][j][0][1] + 1) {
  						dp[i][j][0][1] = dp[k][j][0][1] + 1;
  						dp[i][j][0][0] = time;
  					}
  					else if (dp[i][j][0][1] == dp[k][j][0][1] + 1)
  						dp[i][j][0][0] = min(dp[i][j][0][0], time);
  				}
  				time = dp[k][j][1][0] + x[i] + (l - x[n - j + 1]);
  				if (time <= t[i]) {
  					if (dp[i][j][0][1] < dp[k][j][1][1] + 1) {
  						dp[i][j][0][1] = dp[k][j][1][1] + 1;
  						dp[i][j][0][0] = time;
  					}
  					else if (dp[i][j][0][1] == dp[k][j][1][1] + 1)
  						dp[i][j][0][0] = min(dp[i][j][0][0], time);
  				}
  			}
  			for (int k = j - 1;k >= 0;k--) {
  				int time = dp[i][k][1][0] + abs(x[n - j + 1] - x[n - k + 1]);
  				if (time <= t[n - j + 1]) {
  					if (dp[i][j][1][1] < dp[i][k][1][1] + 1) {
  						dp[i][j][1][1] = dp[i][k][1][1] + 1;
  						dp[i][j][1][0] = time;
  					}
  					else if (dp[i][j][1][1] == dp[i][k][1][1] + 1)
  						dp[i][j][1][0] = min(dp[i][j][1][0], time);
  				}
  				time = dp[i][k][0][0] + x[i] + (l - x[n - j + 1]);
  				if (time <= t[n - j + 1]) {
  					if (dp[i][j][1][1] < dp[i][k][0][1] + 1) {
  						dp[i][j][1][1] = dp[i][k][0][1] + 1;
  						dp[i][j][1][0] = time;
  					}
  					else if (dp[i][j][1][1] == dp[i][k][0][1] + 1)
  						dp[i][j][1][0] = min(dp[i][j][1][0], time);
  				}
  			}
  			ans = max(ans, max(dp[i][j][0][1], dp[i][j][1][1]));
  		}
  	}
  	cout << ans;
	}
  return 0;
}

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	400 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	400 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	412 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	600 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	360 KB	Output is correct

Subtask #3

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	400 KB	Output is correct
18	Correct	6 ms	1624 KB	Output is correct
19	Correct	2 ms	1372 KB	Output is correct
20	Correct	1 ms	1116 KB	Output is correct
21	Correct	2 ms	1116 KB	Output is correct
22	Correct	3 ms	1484 KB	Output is correct
23	Correct	1 ms	860 KB	Output is correct
24	Correct	1 ms	860 KB	Output is correct
25	Correct	1 ms	860 KB	Output is correct
26	Correct	1 ms	604 KB	Output is correct
27	Correct	2 ms	948 KB	Output is correct
28	Correct	1 ms	860 KB	Output is correct
29	Incorrect	2 ms	860 KB	Output isn't correct
30	Halted	0 ms	0 KB	-

Subtask #4

0 / 75.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	1 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	400 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	412 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	348 KB	Output is correct
23	Correct	1 ms	344 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	600 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	1 ms	344 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	360 KB	Output is correct
36	Correct	6 ms	1624 KB	Output is correct
37	Correct	2 ms	1372 KB	Output is correct
38	Correct	1 ms	1116 KB	Output is correct
39	Correct	2 ms	1116 KB	Output is correct
40	Correct	3 ms	1484 KB	Output is correct
41	Correct	1 ms	860 KB	Output is correct
42	Correct	1 ms	860 KB	Output is correct
43	Correct	1 ms	860 KB	Output is correct
44	Correct	1 ms	604 KB	Output is correct
45	Correct	2 ms	948 KB	Output is correct
46	Correct	1 ms	860 KB	Output is correct
47	Incorrect	2 ms	860 KB	Output isn't correct
48	Halted	0 ms	0 KB	-