oj.uz

Submission #579718

# Submission time Handle Problem Language Result Execution time Memory
579718 2022-06-19T16:38:28 Z Omar_Elgedawy Collecting Stamps 3 (JOI20_ho_t3) C++14
15 / 100
 2000 ms 152400 KB 
#include <bits/stdc++.h>
using namespace std;
#define cin(vec)        for(auto& i : vec) cin >> i
#define cout(vec)       for(auto& i : vec) cout << i << " "; cout << "\n";
#define fast            ios::sync_with_stdio(0);cin.tie(0);
#define loop(i,a,b)     for (int i = a; i < b; i++)
#define F               first
#define S               second
#define pb(n)           push_back(n)
#define pf(n)           push_front(n)
#define dci(d)          fixed<<setprecision(d)
#define sp              ' '
#define el              '\n'
#define all(v)          v.begin(),v.end()
#define int             long long
int dx[8]= {0,0,1,-1,-1,1,1,-1};
int dy[8]= {-1,1,0,0,-1,1,-1,1};
int const N=1e4+5,M=1e3+1,Mod=1e9+7;
int a[202],t[202],n,len;
map<pair<pair<pair<int,int>,int>,int>,int>m;
map<pair<pair<pair<int,int>,int>,int>,bool>vis;
int rec(int l,int r,int loc,int time){
  if(l==r){
    return 0;
  }
  if(vis[make_pair(make_pair(make_pair(l,r),loc),time)]){
    return m[make_pair(make_pair(make_pair(l,r),loc),time)];
  }
  vis[make_pair(make_pair(make_pair(l,r),loc),time)]=1;
  int mx=0;
  if(!loc){
    mx=max(rec(l-1,r,0,time+(a[l]-a[l-1]))+((time+(a[l]-a[l-1]))<=t[l-1])
          ,rec(l-1,r,1,time+(len-a[l])+a[r])+((time+(len-a[l])+a[r])<=t[r]));
  }
  else{
    mx=max(rec(l,r+1,0,time+(len-a[l])+a[r])+((time+(len-a[l])+a[r])<=t[l])
          ,rec(l,r+1,1,time+(a[r+1]-a[r]))+((time+(a[r+1]-a[r]))<=t[r+1]));
  }
  // if(l==5&&r==1)
  //   cout<<l<<' '<<r<<' '<<loc<<' '<<time<<' '<<mx<<el;
  return m[make_pair(make_pair(make_pair(l,r),loc),time)]=mx;
}
void testcase(int h){
  cin>>n>>len;
  for(int i=1;i<=n;i++)cin>>a[i];
  for(int i=1;i<=n;i++)cin>>t[i];
  cout<<max(rec(n,1,0,len-a[n])+(len-a[n]<=t[n]),rec(n,1,1,a[1])+(a[1]<=t[1]));
}
int32_t main()
{
  // fast
  testcase(1);
  // int tc;cin>>tc;for(int i=1;i<=tc;i++)testcase(i);
  return 0;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 3 ms 816 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 3 ms 852 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 12 ms 2772 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 3 ms 852 KB Output is correct
21 Correct 11 ms 2768 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 30 ms 5312 KB Output is correct
24 Correct 6 ms 1584 KB Output is correct
25 Correct 12 ms 2772 KB Output is correct
26 Correct 10 ms 2772 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 23 ms 5416 KB Output is correct
30 Correct 23 ms 5332 KB Output is correct
31 Correct 12 ms 2832 KB Output is correct
32 Correct 5 ms 1492 KB Output is correct
33 Correct 3 ms 852 KB Output is correct
34 Correct 3 ms 724 KB Output is correct
35 Correct 3 ms 724 KB Output is correct

Subtask #3
0 / 10.0

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

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 3 ms 816 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 3 ms 852 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 724 KB Output is correct
13 Correct 3 ms 852 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 12 ms 2772 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 3 ms 852 KB Output is correct
21 Correct 11 ms 2768 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 30 ms 5312 KB Output is correct
24 Correct 6 ms 1584 KB Output is correct
25 Correct 12 ms 2772 KB Output is correct
26 Correct 10 ms 2772 KB Output is correct
27 Correct 1 ms 300 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 23 ms 5416 KB Output is correct
30 Correct 23 ms 5332 KB Output is correct
31 Correct 12 ms 2832 KB Output is correct
32 Correct 5 ms 1492 KB Output is correct
33 Correct 3 ms 852 KB Output is correct
34 Correct 3 ms 724 KB Output is correct
35 Correct 3 ms 724 KB Output is correct
36 Execution timed out 2076 ms 152400 KB Time limit exceeded
37 Halted 0 ms 0 KB -