Submission #922844

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
922844	2024-02-06T07:53:01 Z	dimashhh	Collecting Stamps 3 (JOI20_ho_t3)	C++17	15 / 100	1 ms	1624 KB

ho_t3

#include <bits/stdc++.h>

using namespace std;
const int N = 212, MOD = 1e9 + 7;

typedef long long ll;
#define int ll
int n,L,t[N],x[N];
pair<int,ll> dp[N][N][2];
void test() {
    cin >> n >> L;
    for(int i = 1;i <= n;i++){
        cin >> x[i];
    }
    for(int i = 1;i <= n;i++){
        cin >> t[i];
    }
    for(int i = 0;i <= n;i++){
        for(int j = 0;j <= n;j++){
            for(int k =0 ;k < 2;k++){
                dp[i][j][k] = {-1e18,-1e18};
            }
        }
    }
    dp[0][0][0] = dp[0][0][1] = {0,0};
    x[n + 1] = L;
    for(int i =0;i <=n;i++)
    {
        for(int j = 0;j <= n;j++){
            if(i + j >= n) break;
            {
                dp[i + 1][j][0] = max(dp[i + 1][j][0], make_pair(
                        dp[i][j][0].first + (-dp[i][j][0].second + x[i + 1] - x[i] <= t[i + 1]),
                        dp[i][j][0].second - x[i + 1] + x[i]));
                dp[i + 1][j][0] = max(dp[i + 1][j][0], make_pair(
                        dp[i][j][1].first + (-dp[i][j][1].second + L - x[n - j + 1] + x[i + 1] <= t[i + 1]),
                        dp[i][j][1].second - (L - x[n - j + 1] + x[i + 1])));
                dp[i + 1][j][1] = max(dp[i + 1][j][1], make_pair(dp[i + 1][j][0].first, dp[i + 1][j][0].second -
                                                                                        (x[i + 1] + L - x[n - j + 1])));

            }
            {
                dp[i][j + 1][1] = max({dp[i][j + 1][1], make_pair(
                        dp[i][j][1].first + (-dp[i][j][1].second + x[n - j + 1] - x[n - j] <= t[n - j]),
                        (dp[i][j][1].second - (x[n - j + 1] - x[n - j])))});
                dp[i][j + 1][1] = max({dp[i][j + 1][1], make_pair(
                        dp[i][j][0].first + (-dp[i][j][0].second + x[i] + L - x[n - j] <= t[n - j]),
                        dp[i][j][0].second - (x[i] + L - x[n - j]))});
                dp[i][j + 1][0] = max(dp[i][j + 1][0], make_pair(dp[i][j + 1][1].first,
                                                                 dp[i][j + 1][1].second - (x[i] + L - x[n - j])));

            }
        }
    }
    int res = 0;
    for(int i = 0;i <= n;i++){
        for(int j = 0;j <= n;j++){
            if(i + j <= n) res = max({res,dp[i][j][0].first,dp[i][j][1].first});
        }
    }
    cout << res << '\n';
}
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    int T = 1;
//    cin >> T;
    while (T--)
        test();
}

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	348 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	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	348 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	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct

Subtask #3

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	348 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	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	1 ms	1624 KB	Output is correct
19	Correct	1 ms	1372 KB	Output is correct
20	Correct	1 ms	1112 KB	Output is correct
21	Correct	1 ms	1112 KB	Output is correct
22	Correct	1 ms	1372 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	0 ms	604 KB	Output is correct
27	Correct	1 ms	860 KB	Output is correct
28	Correct	1 ms	860 KB	Output is correct
29	Incorrect	1 ms	860 KB	Output isn't correct
30	Halted	0 ms	0 KB	-

Subtask #4

0 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 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	348 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	1 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	1 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Correct	0 ms	344 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	344 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	0 ms	348 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	1 ms	1624 KB	Output is correct
37	Correct	1 ms	1372 KB	Output is correct
38	Correct	1 ms	1112 KB	Output is correct
39	Correct	1 ms	1112 KB	Output is correct
40	Correct	1 ms	1372 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	0 ms	604 KB	Output is correct
45	Correct	1 ms	860 KB	Output is correct
46	Correct	1 ms	860 KB	Output is correct
47	Incorrect	1 ms	860 KB	Output isn't correct
48	Halted	0 ms	0 KB	-