oj.uz

답안 #795394

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
795394 2023-07-27T09:00:17 Z Theo830 Collecting Stamps 3 (JOI20_ho_t3) C++17
100 / 100
 93 ms 135232 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll n;
    cin>>n;
    ll l;
    cin>>l;
    ll x[n+2];
    x[0] = 0;
    f(i,1,n+1){
        cin>>x[i];
    }
    x[n+1] = l;
    ll t[n+2];
    t[0] = t[n+1] = -1;
    f(i,1,n+1){
        cin>>t[i];
    }
    ll dp[205][205][205][2];
    f(i,0,n+5){
        f(j,0,n+5){
            f(k,0,n+5){
                f(u,0,2){
                    dp[i][j][k][u] = INF;
                }
            }
        }
    }
    ll ans = 0;
    f(i,0,n+1){
        f(j,0,n+1){
            if(i + j <= n){
                f(k,0,n+1){
                    if(k == 0){
                        dp[i][j][k][0] = dp[i][j][k][1] = l - x[n+1-i] + x[j];
                    }
                    dp[i][j+1][k][0] = min({dp[i][j+1][k][0],dp[i][j][k][0] + x[j+1] - x[j],dp[i][j][k][1] + l - x[n+1-i] + x[j+1]});
                    dp[i+1][j][k][1] = min({dp[i+1][j][k][1],dp[i][j][k][1] + x[n+1-i] - x[n-i],dp[i][j][k][0] + x[j] + l - x[n-i]});
                    if(min(dp[i][j][k][0] + x[j+1] - x[j],dp[i][j][k][1] + l - x[n+1-i] + x[j+1]) <= t[j+1]){
                        dp[i][j+1][k+1][0] = min({dp[i][j+1][k+1][0],dp[i][j][k][0] + x[j+1] - x[j],dp[i][j][k][1] + l - x[n+1-i] + x[j+1]});
                    }
                    if(min(dp[i][j][k][1] + x[n+1-i] - x[n-i],dp[i][j][k][0] + x[j] + l - x[n-i]) <= t[n-i]){
                        dp[i+1][j][k+1][1] = min({dp[i+1][j][k+1][1],dp[i][j][k][1] + x[n+1-i] - x[n-i],dp[i][j][k][0] + x[j] + l - x[n-i]});
                    }
                    f(u,0,2){
                        if(dp[i][j][k][u] < INF){
                            ans = max(ans,k);
                        }
                    }
                }
            }
        }
    }
    cout<<ans<<"\n";
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 135116 KB Output is correct
2 Correct 48 ms 135168 KB Output is correct
3 Correct 43 ms 135112 KB Output is correct
4 Correct 42 ms 135116 KB Output is correct
5 Correct 42 ms 135124 KB Output is correct
6 Correct 43 ms 135172 KB Output is correct
7 Correct 42 ms 135100 KB Output is correct
8 Correct 43 ms 135072 KB Output is correct
9 Correct 43 ms 135084 KB Output is correct
10 Correct 42 ms 135080 KB Output is correct
11 Correct 42 ms 135148 KB Output is correct
12 Correct 42 ms 135116 KB Output is correct
13 Correct 42 ms 135116 KB Output is correct
14 Correct 43 ms 135124 KB Output is correct
15 Correct 41 ms 135124 KB Output is correct
16 Correct 44 ms 135232 KB Output is correct
17 Correct 42 ms 135128 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 135116 KB Output is correct
2 Correct 48 ms 135168 KB Output is correct
3 Correct 43 ms 135112 KB Output is correct
4 Correct 42 ms 135116 KB Output is correct
5 Correct 42 ms 135124 KB Output is correct
6 Correct 43 ms 135172 KB Output is correct
7 Correct 42 ms 135100 KB Output is correct
8 Correct 43 ms 135072 KB Output is correct
9 Correct 43 ms 135084 KB Output is correct
10 Correct 42 ms 135080 KB Output is correct
11 Correct 42 ms 135148 KB Output is correct
12 Correct 42 ms 135116 KB Output is correct
13 Correct 42 ms 135116 KB Output is correct
14 Correct 43 ms 135124 KB Output is correct
15 Correct 41 ms 135124 KB Output is correct
16 Correct 44 ms 135232 KB Output is correct
17 Correct 42 ms 135128 KB Output is correct
18 Correct 44 ms 135128 KB Output is correct
19 Correct 42 ms 135112 KB Output is correct
20 Correct 43 ms 135068 KB Output is correct
21 Correct 43 ms 135156 KB Output is correct
22 Correct 52 ms 135060 KB Output is correct
23 Correct 43 ms 135144 KB Output is correct
24 Correct 44 ms 135152 KB Output is correct
25 Correct 42 ms 135136 KB Output is correct
26 Correct 41 ms 135068 KB Output is correct
27 Correct 42 ms 135060 KB Output is correct
28 Correct 42 ms 135108 KB Output is correct
29 Correct 43 ms 135168 KB Output is correct
30 Correct 42 ms 135200 KB Output is correct
31 Correct 42 ms 135104 KB Output is correct
32 Correct 42 ms 135080 KB Output is correct
33 Correct 42 ms 135164 KB Output is correct
34 Correct 42 ms 135064 KB Output is correct
35 Correct 44 ms 135140 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 135116 KB Output is correct
2 Correct 48 ms 135168 KB Output is correct
3 Correct 43 ms 135112 KB Output is correct
4 Correct 42 ms 135116 KB Output is correct
5 Correct 42 ms 135124 KB Output is correct
6 Correct 43 ms 135172 KB Output is correct
7 Correct 42 ms 135100 KB Output is correct
8 Correct 43 ms 135072 KB Output is correct
9 Correct 43 ms 135084 KB Output is correct
10 Correct 42 ms 135080 KB Output is correct
11 Correct 42 ms 135148 KB Output is correct
12 Correct 42 ms 135116 KB Output is correct
13 Correct 42 ms 135116 KB Output is correct
14 Correct 43 ms 135124 KB Output is correct
15 Correct 41 ms 135124 KB Output is correct
16 Correct 44 ms 135232 KB Output is correct
17 Correct 42 ms 135128 KB Output is correct
18 Correct 69 ms 135116 KB Output is correct
19 Correct 59 ms 135068 KB Output is correct
20 Correct 49 ms 135136 KB Output is correct
21 Correct 58 ms 135168 KB Output is correct
22 Correct 63 ms 135172 KB Output is correct
23 Correct 57 ms 135084 KB Output is correct
24 Correct 46 ms 135088 KB Output is correct
25 Correct 48 ms 135124 KB Output is correct
26 Correct 43 ms 135144 KB Output is correct
27 Correct 54 ms 135136 KB Output is correct
28 Correct 46 ms 135108 KB Output is correct
29 Correct 50 ms 135088 KB Output is correct
30 Correct 48 ms 135160 KB Output is correct
31 Correct 58 ms 135172 KB Output is correct
32 Correct 45 ms 135176 KB Output is correct
33 Correct 63 ms 135116 KB Output is correct
34 Correct 44 ms 135124 KB Output is correct
35 Correct 55 ms 135148 KB Output is correct
36 Correct 44 ms 135112 KB Output is correct
37 Correct 57 ms 135108 KB Output is correct
38 Correct 45 ms 135172 KB Output is correct
39 Correct 59 ms 135072 KB Output is correct
40 Correct 44 ms 135140 KB Output is correct
41 Correct 76 ms 135072 KB Output is correct
42 Correct 65 ms 135164 KB Output is correct
43 Correct 86 ms 135196 KB Output is correct
44 Correct 78 ms 135136 KB Output is correct
45 Correct 82 ms 135100 KB Output is correct
46 Correct 73 ms 135172 KB Output is correct

Subtask #4
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 47 ms 135116 KB Output is correct
2 Correct 48 ms 135168 KB Output is correct
3 Correct 43 ms 135112 KB Output is correct
4 Correct 42 ms 135116 KB Output is correct
5 Correct 42 ms 135124 KB Output is correct
6 Correct 43 ms 135172 KB Output is correct
7 Correct 42 ms 135100 KB Output is correct
8 Correct 43 ms 135072 KB Output is correct
9 Correct 43 ms 135084 KB Output is correct
10 Correct 42 ms 135080 KB Output is correct
11 Correct 42 ms 135148 KB Output is correct
12 Correct 42 ms 135116 KB Output is correct
13 Correct 42 ms 135116 KB Output is correct
14 Correct 43 ms 135124 KB Output is correct
15 Correct 41 ms 135124 KB Output is correct
16 Correct 44 ms 135232 KB Output is correct
17 Correct 42 ms 135128 KB Output is correct
18 Correct 44 ms 135128 KB Output is correct
19 Correct 42 ms 135112 KB Output is correct
20 Correct 43 ms 135068 KB Output is correct
21 Correct 43 ms 135156 KB Output is correct
22 Correct 52 ms 135060 KB Output is correct
23 Correct 43 ms 135144 KB Output is correct
24 Correct 44 ms 135152 KB Output is correct
25 Correct 42 ms 135136 KB Output is correct
26 Correct 41 ms 135068 KB Output is correct
27 Correct 42 ms 135060 KB Output is correct
28 Correct 42 ms 135108 KB Output is correct
29 Correct 43 ms 135168 KB Output is correct
30 Correct 42 ms 135200 KB Output is correct
31 Correct 42 ms 135104 KB Output is correct
32 Correct 42 ms 135080 KB Output is correct
33 Correct 42 ms 135164 KB Output is correct
34 Correct 42 ms 135064 KB Output is correct
35 Correct 44 ms 135140 KB Output is correct
36 Correct 69 ms 135116 KB Output is correct
37 Correct 59 ms 135068 KB Output is correct
38 Correct 49 ms 135136 KB Output is correct
39 Correct 58 ms 135168 KB Output is correct
40 Correct 63 ms 135172 KB Output is correct
41 Correct 57 ms 135084 KB Output is correct
42 Correct 46 ms 135088 KB Output is correct
43 Correct 48 ms 135124 KB Output is correct
44 Correct 43 ms 135144 KB Output is correct
45 Correct 54 ms 135136 KB Output is correct
46 Correct 46 ms 135108 KB Output is correct
47 Correct 50 ms 135088 KB Output is correct
48 Correct 48 ms 135160 KB Output is correct
49 Correct 58 ms 135172 KB Output is correct
50 Correct 45 ms 135176 KB Output is correct
51 Correct 63 ms 135116 KB Output is correct
52 Correct 44 ms 135124 KB Output is correct
53 Correct 55 ms 135148 KB Output is correct
54 Correct 44 ms 135112 KB Output is correct
55 Correct 57 ms 135108 KB Output is correct
56 Correct 45 ms 135172 KB Output is correct
57 Correct 59 ms 135072 KB Output is correct
58 Correct 44 ms 135140 KB Output is correct
59 Correct 76 ms 135072 KB Output is correct
60 Correct 65 ms 135164 KB Output is correct
61 Correct 86 ms 135196 KB Output is correct
62 Correct 78 ms 135136 KB Output is correct
63 Correct 82 ms 135100 KB Output is correct
64 Correct 73 ms 135172 KB Output is correct
65 Correct 74 ms 135172 KB Output is correct
66 Correct 73 ms 135056 KB Output is correct
67 Correct 80 ms 135112 KB Output is correct
68 Correct 82 ms 135180 KB Output is correct
69 Correct 83 ms 135180 KB Output is correct
70 Correct 76 ms 135176 KB Output is correct
71 Correct 77 ms 135180 KB Output is correct
72 Correct 82 ms 135176 KB Output is correct
73 Correct 76 ms 135176 KB Output is correct
74 Correct 78 ms 135176 KB Output is correct
75 Correct 78 ms 135176 KB Output is correct
76 Correct 93 ms 135180 KB Output is correct
77 Correct 81 ms 135184 KB Output is correct
78 Correct 74 ms 135148 KB Output is correct
79 Correct 78 ms 135140 KB Output is correct
80 Correct 80 ms 135180 KB Output is correct
81 Correct 76 ms 135180 KB Output is correct
82 Correct 82 ms 135172 KB Output is correct
83 Correct 81 ms 135176 KB Output is correct
84 Correct 76 ms 135176 KB Output is correct
85 Correct 81 ms 135080 KB Output is correct
86 Correct 80 ms 135176 KB Output is correct
87 Correct 77 ms 135104 KB Output is correct
88 Correct 90 ms 135180 KB Output is correct
89 Correct 89 ms 135176 KB Output is correct
90 Correct 74 ms 135184 KB Output is correct
91 Correct 89 ms 135176 KB Output is correct
92 Correct 89 ms 135184 KB Output is correct
93 Correct 83 ms 135180 KB Output is correct