oj.uz

Submission #444223

# Submission time Handle Problem Language Result Execution time Memory
444223 2021-07-13T11:41:37 Z zaneyu Collecting Stamps 3 (JOI20_ho_t3) C++14
100 / 100
 76 ms 66592 KB 
/*input
6 25
3 4 7 17 21 23
11 7 17 10 8 10
*/
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=double;
using pii=pair<ll,int>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll INF64=1e18+1;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
inline ll mult(ll a,ll b){
    if(a>=MOD) a%=MOD;
    if(b>=MOD) b%=MOD;
    return (a*b)%MOD;
}
inline ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}
const int maxn=200+5;
const int maxlg=__lg(maxn)+2;
int dp[maxn][maxn][maxn][2];
int arr[maxn],t[maxn];
int l;
int get(int a,int b){
    return min(abs(arr[a]-arr[b]),l-abs(arr[a]-arr[b]));
}
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int n;
    cin>>n>>l;
    REP1(i,n) cin>>arr[i];
    REP1(i,n) cin>>t[i];
    REP(i,n+2) REP(j,n+2) REP(k,n+2) REP(z,2) dp[i][j][k][z]=INF;
    dp[0][n+1][0][0]=dp[0][n+1][0][1]=0;
    int ans=0;
    REP(i,n+1){
        for(int j=n+1;j>i;j--){
            REP(k,n+1){
                if(dp[i][j][k][0]!=INF or dp[i][j][k][1]!=INF){
                    MXTO(ans,k);
                }
                int t1=min(dp[i][j][k][0]+get(i,i+1),dp[i][j][k][1]+get(i+1,j)),t2=min(dp[i][j][k][1]+get(j,j-1),dp[i][j][k][0]+get(i,j-1));
                MNTO(dp[i+1][j][k+(t1<=t[i+1])][0],t1);
                MNTO(dp[i][j-1][k+(t2<=t[j-1])][1],t2);
            }
        }
    }
    cout<<ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 640 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 576 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 588 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 640 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 576 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 716 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 572 KB Output is correct
21 Correct 1 ms 716 KB Output is correct
22 Correct 1 ms 444 KB Output is correct
23 Correct 1 ms 716 KB Output is correct
24 Correct 1 ms 716 KB Output is correct
25 Correct 1 ms 716 KB Output is correct
26 Correct 1 ms 716 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 828 KB Output is correct
30 Correct 1 ms 716 KB Output is correct
31 Correct 1 ms 716 KB Output is correct
32 Correct 1 ms 716 KB Output is correct
33 Correct 1 ms 716 KB Output is correct
34 Correct 1 ms 716 KB Output is correct
35 Correct 1 ms 716 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 640 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 576 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 53 ms 53572 KB Output is correct
19 Correct 28 ms 32716 KB Output is correct
20 Correct 14 ms 17612 KB Output is correct
21 Correct 28 ms 30880 KB Output is correct
22 Correct 37 ms 39912 KB Output is correct
23 Correct 12 ms 15120 KB Output is correct
24 Correct 9 ms 11852 KB Output is correct
25 Correct 11 ms 14796 KB Output is correct
26 Correct 4 ms 5824 KB Output is correct
27 Correct 12 ms 15396 KB Output is correct
28 Correct 8 ms 11124 KB Output is correct
29 Correct 12 ms 15752 KB Output is correct
30 Correct 10 ms 12364 KB Output is correct
31 Correct 11 ms 14816 KB Output is correct
32 Correct 6 ms 7872 KB Output is correct
33 Correct 11 ms 14796 KB Output is correct
34 Correct 4 ms 5452 KB Output is correct
35 Correct 11 ms 14512 KB Output is correct
36 Correct 5 ms 6988 KB Output is correct
37 Correct 13 ms 15444 KB Output is correct
38 Correct 6 ms 8524 KB Output is correct
39 Correct 12 ms 16056 KB Output is correct
40 Correct 7 ms 9532 KB Output is correct
41 Correct 69 ms 65912 KB Output is correct
42 Correct 42 ms 44620 KB Output is correct
43 Correct 71 ms 66040 KB Output is correct
44 Correct 43 ms 44108 KB Output is correct
45 Correct 69 ms 65856 KB Output is correct
46 Correct 42 ms 44612 KB Output is correct

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 460 KB Output is correct
6 Correct 1 ms 588 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 640 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 300 KB Output is correct
12 Correct 1 ms 576 KB Output is correct
13 Correct 1 ms 588 KB Output is correct
14 Correct 1 ms 460 KB Output is correct
15 Correct 1 ms 460 KB Output is correct
16 Correct 1 ms 588 KB Output is correct
17 Correct 1 ms 588 KB Output is correct
18 Correct 1 ms 716 KB Output is correct
19 Correct 1 ms 460 KB Output is correct
20 Correct 1 ms 572 KB Output is correct
21 Correct 1 ms 716 KB Output is correct
22 Correct 1 ms 444 KB Output is correct
23 Correct 1 ms 716 KB Output is correct
24 Correct 1 ms 716 KB Output is correct
25 Correct 1 ms 716 KB Output is correct
26 Correct 1 ms 716 KB Output is correct
27 Correct 1 ms 460 KB Output is correct
28 Correct 1 ms 460 KB Output is correct
29 Correct 1 ms 828 KB Output is correct
30 Correct 1 ms 716 KB Output is correct
31 Correct 1 ms 716 KB Output is correct
32 Correct 1 ms 716 KB Output is correct
33 Correct 1 ms 716 KB Output is correct
34 Correct 1 ms 716 KB Output is correct
35 Correct 1 ms 716 KB Output is correct
36 Correct 53 ms 53572 KB Output is correct
37 Correct 28 ms 32716 KB Output is correct
38 Correct 14 ms 17612 KB Output is correct
39 Correct 28 ms 30880 KB Output is correct
40 Correct 37 ms 39912 KB Output is correct
41 Correct 12 ms 15120 KB Output is correct
42 Correct 9 ms 11852 KB Output is correct
43 Correct 11 ms 14796 KB Output is correct
44 Correct 4 ms 5824 KB Output is correct
45 Correct 12 ms 15396 KB Output is correct
46 Correct 8 ms 11124 KB Output is correct
47 Correct 12 ms 15752 KB Output is correct
48 Correct 10 ms 12364 KB Output is correct
49 Correct 11 ms 14816 KB Output is correct
50 Correct 6 ms 7872 KB Output is correct
51 Correct 11 ms 14796 KB Output is correct
52 Correct 4 ms 5452 KB Output is correct
53 Correct 11 ms 14512 KB Output is correct
54 Correct 5 ms 6988 KB Output is correct
55 Correct 13 ms 15444 KB Output is correct
56 Correct 6 ms 8524 KB Output is correct
57 Correct 12 ms 16056 KB Output is correct
58 Correct 7 ms 9532 KB Output is correct
59 Correct 69 ms 65912 KB Output is correct
60 Correct 42 ms 44620 KB Output is correct
61 Correct 71 ms 66040 KB Output is correct
62 Correct 43 ms 44108 KB Output is correct
63 Correct 69 ms 65856 KB Output is correct
64 Correct 42 ms 44612 KB Output is correct
65 Correct 61 ms 59596 KB Output is correct
66 Correct 55 ms 54732 KB Output is correct
67 Correct 52 ms 52292 KB Output is correct
68 Correct 48 ms 48436 KB Output is correct
69 Correct 61 ms 58944 KB Output is correct
70 Correct 57 ms 56516 KB Output is correct
71 Correct 58 ms 57164 KB Output is correct
72 Correct 58 ms 57772 KB Output is correct
73 Correct 56 ms 53516 KB Output is correct
74 Correct 54 ms 50116 KB Output is correct
75 Correct 54 ms 55244 KB Output is correct
76 Correct 66 ms 63256 KB Output is correct
77 Correct 66 ms 63360 KB Output is correct
78 Correct 49 ms 48988 KB Output is correct
79 Correct 51 ms 50636 KB Output is correct
80 Correct 65 ms 62088 KB Output is correct
81 Correct 50 ms 51224 KB Output is correct
82 Correct 55 ms 54168 KB Output is correct
83 Correct 69 ms 65860 KB Output is correct
84 Correct 57 ms 56456 KB Output is correct
85 Correct 62 ms 61412 KB Output is correct
86 Correct 64 ms 60204 KB Output is correct
87 Correct 55 ms 55236 KB Output is correct
88 Correct 70 ms 66564 KB Output is correct
89 Correct 76 ms 66548 KB Output is correct
90 Correct 57 ms 55884 KB Output is correct
91 Correct 70 ms 66592 KB Output is correct
92 Correct 72 ms 66588 KB Output is correct
93 Correct 68 ms 65200 KB Output is correct