Submission #724641

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
724641	2023-04-15T17:06:51 Z	vjudge1	Collecting Stamps 3 (JOI20_ho_t3)	C++17	15 / 100	2000 ms	113392 KB

ho_t3

#include <bits/stdc++.h>
using namespace std;
 
#define fi first
#define se second
#define pb push_back
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5+10;
const ll INF = 0x3f3f3f3f3f3f3f3f;

int n, ans;
vector<ll> arr, tempo;
map<pair<int, pair<int, ll>>, int> dp;

int calc(int i, int at, ll curr, int nxd, int nxu){
	if(i==n) return 0;
	if(dp.find({i, {at, curr}})!=dp.end()) return dp[{i, {at, curr}}];

	int ret=0;
	if(tempo[nxd]>=curr+abs(arr[at]-arr[nxd])) ret=1+calc(i+1, nxd, curr+abs(arr[at]-arr[nxd]), nxd-1, nxu);
	else ret=calc(i+1, nxd, curr+abs(arr[at]-arr[nxd]), nxd-1, nxu);

	if(tempo[nxu]>=curr+abs(arr[at]-arr[nxu])) ret=max(ret, 1+calc(i+1, nxu, curr+abs(arr[at]-arr[nxu]), nxd, nxu+1));
	else ret=max(ret, calc(i+1, nxu, curr+abs(arr[at]-arr[nxu]), nxd, nxu+1));

	return dp[{i, {at, curr}}]=ret;
}

int main(){
  	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);

    // freopen("shuffle.in","r",stdin);
    // freopen("shuffle.out","w",stdout);

	ll l; cin >> n >> l;

	for(int i=0;i<n;i++){
		ll x; cin >> x;
		arr.pb(x);
	}
	arr.pb(l);
	for(int i=0;i<n;i++) arr.pb(arr[i]+l);

	tempo.resize(2*n+1);
	for(int i=0;i<n;i++) cin >> tempo[i];
	for(int i=0;i<n;i++) tempo[i+n+1]=tempo[i];
	tempo[n]=-1;

	cout << calc(0, n, 0ll, n-1, n+1) << "\n";
	return 0;
}

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	2 ms	596 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	2 ms	468 KB	Output is correct
13	Correct	2 ms	596 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	2 ms	596 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	2 ms	468 KB	Output is correct
13	Correct	2 ms	596 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	7 ms	1492 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	596 KB	Output is correct
21	Correct	6 ms	1492 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	13 ms	2772 KB	Output is correct
24	Correct	3 ms	852 KB	Output is correct
25	Correct	7 ms	1492 KB	Output is correct
26	Correct	7 ms	1492 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	14 ms	2880 KB	Output is correct
30	Correct	13 ms	2816 KB	Output is correct
31	Correct	7 ms	1488 KB	Output is correct
32	Correct	3 ms	852 KB	Output is correct
33	Correct	2 ms	596 KB	Output is correct
34	Correct	2 ms	468 KB	Output is correct
35	Correct	2 ms	468 KB	Output is correct

Subtask #3

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	2 ms	596 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	2 ms	468 KB	Output is correct
13	Correct	2 ms	596 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Execution timed out	2057 ms	113392 KB	Time limit exceeded
19	Halted	0 ms	0 KB	-

Subtask #4

0 / 75.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	2 ms	596 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	2 ms	468 KB	Output is correct
13	Correct	2 ms	596 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	340 KB	Output is correct
17	Correct	1 ms	340 KB	Output is correct
18	Correct	7 ms	1492 KB	Output is correct
19	Correct	1 ms	340 KB	Output is correct
20	Correct	1 ms	596 KB	Output is correct
21	Correct	6 ms	1492 KB	Output is correct
22	Correct	1 ms	340 KB	Output is correct
23	Correct	13 ms	2772 KB	Output is correct
24	Correct	3 ms	852 KB	Output is correct
25	Correct	7 ms	1492 KB	Output is correct
26	Correct	7 ms	1492 KB	Output is correct
27	Correct	0 ms	212 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	14 ms	2880 KB	Output is correct
30	Correct	13 ms	2816 KB	Output is correct
31	Correct	7 ms	1488 KB	Output is correct
32	Correct	3 ms	852 KB	Output is correct
33	Correct	2 ms	596 KB	Output is correct
34	Correct	2 ms	468 KB	Output is correct
35	Correct	2 ms	468 KB	Output is correct
36	Execution timed out	2057 ms	113392 KB	Time limit exceeded
37	Halted	0 ms	0 KB	-