oj.uz

Submission #536141

# Submission time Handle Problem Language Result Execution time Memory
536141 2022-03-12T13:01:26 Z browntoad Collecting Stamps 3 (JOI20_ho_t3) C++14
100 / 100
 145 ms 135304 KB 
#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast", "unroll-loops")
using namespace std;
#define ll long long
#define int ll
#define FOR(i,a,b) for (int i = (a); i<(b); i++)
#define REP(i,n) FOR(i,0,n)
#define REP1(i,n) FOR(i,1,n+1)
#define RREP(i,n) for (int i=(n)-1; i>=0; i--)
#define RREP1(i,n) for (int i=(n); i>=1; i--)
#define f first
#define s second
#define pb push_back
#define ALL(x) x.begin(),x.end()
#define SZ(x) (int)(x.size())
#define SQ(x) (x)*(x)
#define pii pair<int, int>
#define pdd pair<double ,double>
#define pcc pair<char, char> 
#define endl '\n'
//#define TOAD
#ifdef TOAD
#define bug(x) cerr<<__LINE__<<": "<<#x<<" is "<<x<<endl
#define IOS()
#else
#define bug(...)
#define IOS() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#endif
 
const ll inf = 1ll<<60;
const int iinf=2147483647;
const ll mod = 1e9+7;
const ll maxn=205;
const double PI=acos(-1);
 
ll pw(ll x, ll p, ll m=mod){
    ll ret=1;
    while (p>0){
        if (p&1){
            ret*=x;
            ret%=m;
        }
        x*=x;
        x%=m;
        p>>=1;
    }
    return ret;
}
 
ll inv(ll a, ll m=mod){
    return pw(a,m-2);
}
 
//=======================================================================================

int dp[maxn][maxn][maxn][2];
signed main (){
    IOS();
    int n, L; cin>>n>>L;
    vector<int> t(n+2), vc(n+2);
    REP1(i,n){
        cin>>t[i];
    }
    t[n+1]=L;
    REP1(i,n){
        cin>>vc[i];
    }
    REP(i,maxn){
        REP(j, maxn){
            REP(k, maxn){
                REP(l, 2){
                    dp[i][j][k][l]=inf;
                }
            }
        }
    }
    dp[0][n+1][0][0]=dp[0][n+1][0][1]=0;

    REP(i,n+1){
        for (int j=n+1; j>i; j--){
            if (i==0&&j==n+1) continue;
            if (i>0) {
                REP(k,maxn){
                    dp[i][j][k][0]=min({dp[i][j][k][0], dp[i-1][j][k][0]+t[i]-t[i-1], dp[i-1][j][k][1]+(t[i]+L-t[j])});
                    if (k>0){
                        int a=dp[i-1][j][k-1][0]+t[i]-t[i-1];
                        int b=dp[i-1][j][k-1][1]+(t[i]+L-t[j]);
                        if (a<=vc[i]) dp[i][j][k][0]=min(dp[i][j][k][0], a);
                        if (b<=vc[i]) dp[i][j][k][0]=min(dp[i][j][k][0], b);
                    }
                }
            }
            if (j<=n) {
                REP(k,maxn){
                    dp[i][j][k][1]=min({dp[i][j][k][1], dp[i][j+1][k][1]+t[j+1]-t[j], dp[i][j+1][k][0]+(t[i]+L-t[j])});
                    if (k>0){
                        int a=dp[i][j+1][k-1][1]+t[j+1]-t[j];
                        int b=dp[i][j+1][k-1][0]+(t[i]+L-t[j]);
                        if (a<=vc[j]) dp[i][j][k][1]=min(dp[i][j][k][1], a);
                        if (b<=vc[j]) dp[i][j][k][1]=min(dp[i][j][k][1], b);
                    }
                }
            }
        }
    }
    //cout<<dp[0][3][1][1]<<endl;
    //cout<<dp[0][4][1][1]<<endl;
    //cout<<dp[0][4][0][1]<<endl;
    int ans=0;
    REP(k,maxn){
        REP(i,n+1){
            FOR(j,i+1,n+2){
                REP(l,2){
                    if (dp[i][j][k][l]!=inf) ans=k;
                }
            }
        }
    }
    cout<<ans<<endl;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 135112 KB Output is correct
2 Correct 57 ms 135164 KB Output is correct
3 Correct 54 ms 135112 KB Output is correct
4 Correct 54 ms 135116 KB Output is correct
5 Correct 54 ms 135160 KB Output is correct
6 Correct 55 ms 135172 KB Output is correct
7 Correct 57 ms 135076 KB Output is correct
8 Correct 59 ms 135068 KB Output is correct
9 Correct 64 ms 135168 KB Output is correct
10 Correct 53 ms 135108 KB Output is correct
11 Correct 57 ms 135156 KB Output is correct
12 Correct 56 ms 135108 KB Output is correct
13 Correct 58 ms 135112 KB Output is correct
14 Correct 57 ms 135128 KB Output is correct
15 Correct 62 ms 135128 KB Output is correct
16 Correct 70 ms 135052 KB Output is correct
17 Correct 72 ms 135132 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 135112 KB Output is correct
2 Correct 57 ms 135164 KB Output is correct
3 Correct 54 ms 135112 KB Output is correct
4 Correct 54 ms 135116 KB Output is correct
5 Correct 54 ms 135160 KB Output is correct
6 Correct 55 ms 135172 KB Output is correct
7 Correct 57 ms 135076 KB Output is correct
8 Correct 59 ms 135068 KB Output is correct
9 Correct 64 ms 135168 KB Output is correct
10 Correct 53 ms 135108 KB Output is correct
11 Correct 57 ms 135156 KB Output is correct
12 Correct 56 ms 135108 KB Output is correct
13 Correct 58 ms 135112 KB Output is correct
14 Correct 57 ms 135128 KB Output is correct
15 Correct 62 ms 135128 KB Output is correct
16 Correct 70 ms 135052 KB Output is correct
17 Correct 72 ms 135132 KB Output is correct
18 Correct 59 ms 135092 KB Output is correct
19 Correct 67 ms 135100 KB Output is correct
20 Correct 63 ms 135148 KB Output is correct
21 Correct 74 ms 135104 KB Output is correct
22 Correct 60 ms 135144 KB Output is correct
23 Correct 70 ms 135052 KB Output is correct
24 Correct 66 ms 135108 KB Output is correct
25 Correct 71 ms 135176 KB Output is correct
26 Correct 67 ms 135068 KB Output is correct
27 Correct 63 ms 135080 KB Output is correct
28 Correct 79 ms 135108 KB Output is correct
29 Correct 63 ms 135068 KB Output is correct
30 Correct 67 ms 135160 KB Output is correct
31 Correct 69 ms 135132 KB Output is correct
32 Correct 67 ms 135148 KB Output is correct
33 Correct 74 ms 135120 KB Output is correct
34 Correct 66 ms 135132 KB Output is correct
35 Correct 71 ms 135052 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 135112 KB Output is correct
2 Correct 57 ms 135164 KB Output is correct
3 Correct 54 ms 135112 KB Output is correct
4 Correct 54 ms 135116 KB Output is correct
5 Correct 54 ms 135160 KB Output is correct
6 Correct 55 ms 135172 KB Output is correct
7 Correct 57 ms 135076 KB Output is correct
8 Correct 59 ms 135068 KB Output is correct
9 Correct 64 ms 135168 KB Output is correct
10 Correct 53 ms 135108 KB Output is correct
11 Correct 57 ms 135156 KB Output is correct
12 Correct 56 ms 135108 KB Output is correct
13 Correct 58 ms 135112 KB Output is correct
14 Correct 57 ms 135128 KB Output is correct
15 Correct 62 ms 135128 KB Output is correct
16 Correct 70 ms 135052 KB Output is correct
17 Correct 72 ms 135132 KB Output is correct
18 Correct 121 ms 135176 KB Output is correct
19 Correct 102 ms 135180 KB Output is correct
20 Correct 90 ms 135092 KB Output is correct
21 Correct 106 ms 135180 KB Output is correct
22 Correct 108 ms 135180 KB Output is correct
23 Correct 74 ms 135132 KB Output is correct
24 Correct 70 ms 135076 KB Output is correct
25 Correct 86 ms 135080 KB Output is correct
26 Correct 64 ms 135136 KB Output is correct
27 Correct 74 ms 135116 KB Output is correct
28 Correct 70 ms 135100 KB Output is correct
29 Correct 79 ms 135116 KB Output is correct
30 Correct 69 ms 135092 KB Output is correct
31 Correct 75 ms 135172 KB Output is correct
32 Correct 68 ms 135104 KB Output is correct
33 Correct 86 ms 135160 KB Output is correct
34 Correct 65 ms 135148 KB Output is correct
35 Correct 69 ms 135152 KB Output is correct
36 Correct 69 ms 135144 KB Output is correct
37 Correct 69 ms 135176 KB Output is correct
38 Correct 70 ms 135092 KB Output is correct
39 Correct 78 ms 135172 KB Output is correct
40 Correct 71 ms 135116 KB Output is correct
41 Correct 143 ms 135100 KB Output is correct
42 Correct 105 ms 135172 KB Output is correct
43 Correct 139 ms 135180 KB Output is correct
44 Correct 112 ms 135136 KB Output is correct
45 Correct 137 ms 135064 KB Output is correct
46 Correct 104 ms 135076 KB Output is correct

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 64 ms 135112 KB Output is correct
2 Correct 57 ms 135164 KB Output is correct
3 Correct 54 ms 135112 KB Output is correct
4 Correct 54 ms 135116 KB Output is correct
5 Correct 54 ms 135160 KB Output is correct
6 Correct 55 ms 135172 KB Output is correct
7 Correct 57 ms 135076 KB Output is correct
8 Correct 59 ms 135068 KB Output is correct
9 Correct 64 ms 135168 KB Output is correct
10 Correct 53 ms 135108 KB Output is correct
11 Correct 57 ms 135156 KB Output is correct
12 Correct 56 ms 135108 KB Output is correct
13 Correct 58 ms 135112 KB Output is correct
14 Correct 57 ms 135128 KB Output is correct
15 Correct 62 ms 135128 KB Output is correct
16 Correct 70 ms 135052 KB Output is correct
17 Correct 72 ms 135132 KB Output is correct
18 Correct 59 ms 135092 KB Output is correct
19 Correct 67 ms 135100 KB Output is correct
20 Correct 63 ms 135148 KB Output is correct
21 Correct 74 ms 135104 KB Output is correct
22 Correct 60 ms 135144 KB Output is correct
23 Correct 70 ms 135052 KB Output is correct
24 Correct 66 ms 135108 KB Output is correct
25 Correct 71 ms 135176 KB Output is correct
26 Correct 67 ms 135068 KB Output is correct
27 Correct 63 ms 135080 KB Output is correct
28 Correct 79 ms 135108 KB Output is correct
29 Correct 63 ms 135068 KB Output is correct
30 Correct 67 ms 135160 KB Output is correct
31 Correct 69 ms 135132 KB Output is correct
32 Correct 67 ms 135148 KB Output is correct
33 Correct 74 ms 135120 KB Output is correct
34 Correct 66 ms 135132 KB Output is correct
35 Correct 71 ms 135052 KB Output is correct
36 Correct 121 ms 135176 KB Output is correct
37 Correct 102 ms 135180 KB Output is correct
38 Correct 90 ms 135092 KB Output is correct
39 Correct 106 ms 135180 KB Output is correct
40 Correct 108 ms 135180 KB Output is correct
41 Correct 74 ms 135132 KB Output is correct
42 Correct 70 ms 135076 KB Output is correct
43 Correct 86 ms 135080 KB Output is correct
44 Correct 64 ms 135136 KB Output is correct
45 Correct 74 ms 135116 KB Output is correct
46 Correct 70 ms 135100 KB Output is correct
47 Correct 79 ms 135116 KB Output is correct
48 Correct 69 ms 135092 KB Output is correct
49 Correct 75 ms 135172 KB Output is correct
50 Correct 68 ms 135104 KB Output is correct
51 Correct 86 ms 135160 KB Output is correct
52 Correct 65 ms 135148 KB Output is correct
53 Correct 69 ms 135152 KB Output is correct
54 Correct 69 ms 135144 KB Output is correct
55 Correct 69 ms 135176 KB Output is correct
56 Correct 70 ms 135092 KB Output is correct
57 Correct 78 ms 135172 KB Output is correct
58 Correct 71 ms 135116 KB Output is correct
59 Correct 143 ms 135100 KB Output is correct
60 Correct 105 ms 135172 KB Output is correct
61 Correct 139 ms 135180 KB Output is correct
62 Correct 112 ms 135136 KB Output is correct
63 Correct 137 ms 135064 KB Output is correct
64 Correct 104 ms 135076 KB Output is correct
65 Correct 122 ms 135188 KB Output is correct
66 Correct 122 ms 135076 KB Output is correct
67 Correct 122 ms 135104 KB Output is correct
68 Correct 104 ms 135180 KB Output is correct
69 Correct 124 ms 135124 KB Output is correct
70 Correct 120 ms 135104 KB Output is correct
71 Correct 113 ms 135304 KB Output is correct
72 Correct 116 ms 135064 KB Output is correct
73 Correct 112 ms 135184 KB Output is correct
74 Correct 116 ms 135096 KB Output is correct
75 Correct 133 ms 135180 KB Output is correct
76 Correct 130 ms 135244 KB Output is correct
77 Correct 124 ms 135192 KB Output is correct
78 Correct 115 ms 135116 KB Output is correct
79 Correct 127 ms 135184 KB Output is correct
80 Correct 130 ms 135184 KB Output is correct
81 Correct 113 ms 135244 KB Output is correct
82 Correct 120 ms 135188 KB Output is correct
83 Correct 131 ms 135172 KB Output is correct
84 Correct 118 ms 135108 KB Output is correct
85 Correct 122 ms 135104 KB Output is correct
86 Correct 125 ms 135184 KB Output is correct
87 Correct 120 ms 135184 KB Output is correct
88 Correct 123 ms 135184 KB Output is correct
89 Correct 128 ms 135068 KB Output is correct
90 Correct 120 ms 135092 KB Output is correct
91 Correct 145 ms 135184 KB Output is correct
92 Correct 132 ms 135184 KB Output is correct
93 Correct 122 ms 135188 KB Output is correct