oj.uz

Submission #705602

# Submission time Handle Problem Language Result Execution time Memory
705602 2023-03-04T18:37:29 Z epicci23 Collecting Stamps 3 (JOI20_ho_t3) C++17
100 / 100
 95 ms 129348 KB 
#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr int INF=(int)1e18;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}

array<int,2> arr[205];
int dp[202][202][202][2];




void solve()
{
  int n=in(),l=in();
  
  for(int i=0;i<=n+1;i++)
    for(int j=0;j<=n+1;j++)
      for(int k=0;k<=n+1;k++)
        dp[i][j][k][0]=dp[i][j][k][1]=INF;

  for(int i=1;i<=n;i++) arr[i][0]=in();
  for(int i=1;i<=n;i++) arr[i][1]=in();
  
  arr[0][0]=0;
  arr[n+1][0]=l;

  dp[0][n+1][0][0]=dp[0][n+1][0][1]=0;
  int ans=0;
  for(int i=0;i<=n;i++)
  {
    for(int j=n+1;j>i;j--)
    {
      for(int k=0;k<=n;k++)
      {
        if(dp[i][j][k][0]!=INF)
        {
          ans=max(ans,k);
          int ol=dp[i][j][k][0]+arr[i+1][0]-arr[i][0];
          dp[i+1][j][k+(ol<=arr[i+1][1])][0]=min(dp[i+1][j][k+(ol<=arr[i+1][1])][0],ol);
          int ol2=dp[i][j][k][0]+arr[i][0]+l-arr[j-1][0];
          dp[i][j-1][k+(ol2<=arr[j-1][1])][1]=min(dp[i][j-1][k+(ol2<=arr[j-1][1])][1],ol2);
        }
        if(dp[i][j][k][1]!=INF)
        {
          ans=max(ans,k);
          int ol=dp[i][j][k][1]+arr[j][0]-arr[j-1][0];
          dp[i][j-1][k+(ol<=arr[j-1][1])][1]=min(dp[i][j-1][k+(ol<=arr[j-1][1])][1],ol);
          int ol2=dp[i][j][k][1]+l-arr[j][0]+arr[i+1][0];
          dp[i+1][j][k+(ol2<=arr[i+1][1])][0]=min(dp[i+1][j][k+(ol2<=arr[i+1][1])][0],ol2);
        }
      }
    }
  }
  cout << ans << endl;
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message

ho_t3.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 968 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 964 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 1 ms 968 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 852 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 1236 KB Output is correct
24 Correct 1 ms 980 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1096 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 1 ms 1236 KB Output is correct
30 Correct 1 ms 1220 KB Output is correct
31 Correct 1 ms 1108 KB Output is correct
32 Correct 1 ms 980 KB Output is correct
33 Correct 1 ms 1236 KB Output is correct
34 Correct 1 ms 1236 KB Output is correct
35 Correct 1 ms 1236 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 968 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 964 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 1 ms 968 KB Output is correct
18 Correct 63 ms 104580 KB Output is correct
19 Correct 37 ms 63664 KB Output is correct
20 Correct 17 ms 34172 KB Output is correct
21 Correct 35 ms 60260 KB Output is correct
22 Correct 46 ms 77820 KB Output is correct
23 Correct 17 ms 29148 KB Output is correct
24 Correct 10 ms 22876 KB Output is correct
25 Correct 15 ms 28500 KB Output is correct
26 Correct 5 ms 11092 KB Output is correct
27 Correct 16 ms 29708 KB Output is correct
28 Correct 11 ms 21204 KB Output is correct
29 Correct 16 ms 30336 KB Output is correct
30 Correct 11 ms 23956 KB Output is correct
31 Correct 15 ms 28556 KB Output is correct
32 Correct 7 ms 15060 KB Output is correct
33 Correct 14 ms 28500 KB Output is correct
34 Correct 4 ms 10324 KB Output is correct
35 Correct 12 ms 27868 KB Output is correct
36 Correct 6 ms 13344 KB Output is correct
37 Correct 13 ms 29756 KB Output is correct
38 Correct 8 ms 16360 KB Output is correct
39 Correct 15 ms 30888 KB Output is correct
40 Correct 9 ms 18324 KB Output is correct
41 Correct 85 ms 128704 KB Output is correct
42 Correct 38 ms 86980 KB Output is correct
43 Correct 83 ms 128640 KB Output is correct
44 Correct 37 ms 85912 KB Output is correct
45 Correct 85 ms 128592 KB Output is correct
46 Correct 41 ms 87004 KB Output is correct

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 1 ms 596 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 968 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 964 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 0 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 852 KB Output is correct
17 Correct 1 ms 968 KB Output is correct
18 Correct 1 ms 1108 KB Output is correct
19 Correct 1 ms 724 KB Output is correct
20 Correct 1 ms 852 KB Output is correct
21 Correct 1 ms 1108 KB Output is correct
22 Correct 1 ms 724 KB Output is correct
23 Correct 1 ms 1236 KB Output is correct
24 Correct 1 ms 980 KB Output is correct
25 Correct 1 ms 1108 KB Output is correct
26 Correct 1 ms 1096 KB Output is correct
27 Correct 1 ms 596 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 1 ms 1236 KB Output is correct
30 Correct 1 ms 1220 KB Output is correct
31 Correct 1 ms 1108 KB Output is correct
32 Correct 1 ms 980 KB Output is correct
33 Correct 1 ms 1236 KB Output is correct
34 Correct 1 ms 1236 KB Output is correct
35 Correct 1 ms 1236 KB Output is correct
36 Correct 63 ms 104580 KB Output is correct
37 Correct 37 ms 63664 KB Output is correct
38 Correct 17 ms 34172 KB Output is correct
39 Correct 35 ms 60260 KB Output is correct
40 Correct 46 ms 77820 KB Output is correct
41 Correct 17 ms 29148 KB Output is correct
42 Correct 10 ms 22876 KB Output is correct
43 Correct 15 ms 28500 KB Output is correct
44 Correct 5 ms 11092 KB Output is correct
45 Correct 16 ms 29708 KB Output is correct
46 Correct 11 ms 21204 KB Output is correct
47 Correct 16 ms 30336 KB Output is correct
48 Correct 11 ms 23956 KB Output is correct
49 Correct 15 ms 28556 KB Output is correct
50 Correct 7 ms 15060 KB Output is correct
51 Correct 14 ms 28500 KB Output is correct
52 Correct 4 ms 10324 KB Output is correct
53 Correct 12 ms 27868 KB Output is correct
54 Correct 6 ms 13344 KB Output is correct
55 Correct 13 ms 29756 KB Output is correct
56 Correct 8 ms 16360 KB Output is correct
57 Correct 15 ms 30888 KB Output is correct
58 Correct 9 ms 18324 KB Output is correct
59 Correct 85 ms 128704 KB Output is correct
60 Correct 38 ms 86980 KB Output is correct
61 Correct 83 ms 128640 KB Output is correct
62 Correct 37 ms 85912 KB Output is correct
63 Correct 85 ms 128592 KB Output is correct
64 Correct 41 ms 87004 KB Output is correct
65 Correct 72 ms 116416 KB Output is correct
66 Correct 65 ms 106840 KB Output is correct
67 Correct 62 ms 102204 KB Output is correct
68 Correct 56 ms 94396 KB Output is correct
69 Correct 75 ms 115168 KB Output is correct
70 Correct 76 ms 110344 KB Output is correct
71 Correct 65 ms 111608 KB Output is correct
72 Correct 79 ms 112836 KB Output is correct
73 Correct 56 ms 104500 KB Output is correct
74 Correct 64 ms 97736 KB Output is correct
75 Correct 65 ms 107980 KB Output is correct
76 Correct 85 ms 123768 KB Output is correct
77 Correct 77 ms 123820 KB Output is correct
78 Correct 60 ms 95580 KB Output is correct
79 Correct 62 ms 98972 KB Output is correct
80 Correct 87 ms 121312 KB Output is correct
81 Correct 60 ms 100040 KB Output is correct
82 Correct 64 ms 105676 KB Output is correct
83 Correct 79 ms 128704 KB Output is correct
84 Correct 67 ms 110376 KB Output is correct
85 Correct 66 ms 120084 KB Output is correct
86 Correct 65 ms 117568 KB Output is correct
87 Correct 67 ms 108020 KB Output is correct
88 Correct 95 ms 129316 KB Output is correct
89 Correct 85 ms 129292 KB Output is correct
90 Correct 50 ms 109216 KB Output is correct
91 Correct 93 ms 129348 KB Output is correct
92 Correct 85 ms 129228 KB Output is correct
93 Correct 62 ms 127500 KB Output is correct