oj.uz

답안 #754400

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
754400 2023-06-07T16:42:05 Z Sam_a17 Collecting Stamps 3 (JOI20_ho_t3) C++17
100 / 100
 79 ms 132172 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <rail.h>
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
void print(long double t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
long long ka() {
	long long x = 0;
	bool z = false;
	while (1)
	{
		char y = getchar();
		if (y == '-')
			z = true;
		else if ('0' <= y && y <= '9')
			x = x * 10 + y - '0';
		else
		{
			if (z)
				x *= -1;
			return x;
		}
	}
}
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  } else if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
  }
}
 
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const long long inf = 1e18;
const int N = 205;
long long dp[N][N][N][2];
long long n, l, a[N], b[N], inv[N];


void solve_() {
  cin >> n >> l;

  for(int i = 1; i <= n; i++) {
    cin >> a[i];
    inv[i] = l - a[i];
  }

  for(int i = 1; i <= n; i++) {
    cin >> b[i];
  }

  for(int i = 0; i <= n + 1; i++) {
    for(int j = 0; j <= n + 1; j++) {
      for(int k = 0; k <= n + 1; k++) {
        for(int e = 0; e <= 1; e++) {
          dp[i][j][k][e] = inf;
        }
      }
    }
  }

  dp[0][n + 1][0][0] = 0;  
  dp[0][n + 1][0][1] = 0;  

  for(int l = 0; l < n + 1; l++) {
    for(int r = n + 1; r >= l + 2; r--) {
      int lst = (n + 1) - r;
      for(int k = 0; k <= (l + lst); k++) {
        for(int i = 0; i <= 1; i++) {
          if(dp[l][r][k][i] == inf) continue;

          if(i == 0) {
            long long cur = dp[l][r][k][i] + a[l + 1] - a[l];

            if(cur <= b[l + 1]) {
              dp[l + 1][r][k + 1][0] = min(dp[l + 1][r][k + 1][0], cur);
            } else {
              dp[l + 1][r][k][0] = min(dp[l + 1][r][k][0], cur);
            }

            cur = dp[l][r][k][i] + a[l] + inv[r - 1];

            if(cur <= b[r - 1]) {
              dp[l][r - 1][k + 1][1] = min(dp[l][r - 1][k + 1][1], cur);
            } else {
              dp[l][r - 1][k][1] = min(dp[l][r - 1][k][1], cur);
            } 
          } else {
            long long cur = dp[l][r][k][i] + inv[r - 1] - inv[r];

            if(cur <= b[r - 1]) {
              dp[l][r - 1][k + 1][1] = min(dp[l][r - 1][k + 1][1], cur);
            } else {
              dp[l][r - 1][k][1] = min(dp[l][r - 1][k][1], cur);
            } 

            cur = dp[l][r][k][i] + a[l + 1] + inv[r];
            if(cur <= b[l + 1]) {
              dp[l + 1][r][k + 1][0] = min(dp[l + 1][r][k + 1][0], cur);
            } else {
              dp[l + 1][r][k][0] = min(dp[l + 1][r][k][0], cur);
            }
          }
        }
      }
    }
  }

  int ans = 0;
  for(int i = 0; i < n + 1; i++) {
    for(int j = 0; j <= n; j++) {
      if(dp[i][i + 1][j][0] != inf) {
        ans = max(ans, j);
      }
      
      if(dp[i][i + 1][j][1] != inf) {
        ans = max(ans, j);
      }
    }
  }

  cout << ans << '\n';
}
 
int main() {
  setIO();
  
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1; 
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

ho_t3.cpp: In function 'void setIO(std::string)':
ho_t3.cpp:88:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   88 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ho_t3.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   89 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
ho_t3.cpp:91:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   91 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
ho_t3.cpp:92:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 980 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 980 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 1 ms 980 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 980 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 980 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 1 ms 980 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 980 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 1108 KB Output is correct
27 Correct 1 ms 584 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 1 ms 1232 KB Output is correct
30 Correct 1 ms 1236 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 980 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 980 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 1 ms 980 KB Output is correct
18 Correct 53 ms 106108 KB Output is correct
19 Correct 30 ms 64564 KB Output is correct
20 Correct 17 ms 34576 KB Output is correct
21 Correct 32 ms 60964 KB Output is correct
22 Correct 40 ms 78948 KB Output is correct
23 Correct 18 ms 29544 KB Output is correct
24 Correct 11 ms 23120 KB Output is correct
25 Correct 14 ms 28848 KB Output is correct
26 Correct 5 ms 11220 KB Output is correct
27 Correct 15 ms 30196 KB Output is correct
28 Correct 10 ms 21588 KB Output is correct
29 Correct 15 ms 30812 KB Output is correct
30 Correct 12 ms 24276 KB Output is correct
31 Correct 14 ms 28948 KB Output is correct
32 Correct 8 ms 15316 KB Output is correct
33 Correct 14 ms 28884 KB Output is correct
34 Correct 5 ms 10452 KB Output is correct
35 Correct 15 ms 28244 KB Output is correct
36 Correct 7 ms 13524 KB Output is correct
37 Correct 18 ms 30164 KB Output is correct
38 Correct 10 ms 16724 KB Output is correct
39 Correct 18 ms 31352 KB Output is correct
40 Correct 9 ms 18516 KB Output is correct
41 Correct 70 ms 130744 KB Output is correct
42 Correct 43 ms 88272 KB Output is correct
43 Correct 67 ms 130764 KB Output is correct
44 Correct 42 ms 87208 KB Output is correct
45 Correct 70 ms 130704 KB Output is correct
46 Correct 48 ms 88196 KB Output is correct

Subtask #4
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 1 ms 468 KB Output is correct
5 Correct 1 ms 592 KB Output is correct
6 Correct 1 ms 980 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 980 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 980 KB Output is correct
13 Correct 1 ms 980 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 972 KB Output is correct
17 Correct 1 ms 980 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 980 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 1108 KB Output is correct
27 Correct 1 ms 584 KB Output is correct
28 Correct 1 ms 724 KB Output is correct
29 Correct 1 ms 1232 KB Output is correct
30 Correct 1 ms 1236 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 53 ms 106108 KB Output is correct
37 Correct 30 ms 64564 KB Output is correct
38 Correct 17 ms 34576 KB Output is correct
39 Correct 32 ms 60964 KB Output is correct
40 Correct 40 ms 78948 KB Output is correct
41 Correct 18 ms 29544 KB Output is correct
42 Correct 11 ms 23120 KB Output is correct
43 Correct 14 ms 28848 KB Output is correct
44 Correct 5 ms 11220 KB Output is correct
45 Correct 15 ms 30196 KB Output is correct
46 Correct 10 ms 21588 KB Output is correct
47 Correct 15 ms 30812 KB Output is correct
48 Correct 12 ms 24276 KB Output is correct
49 Correct 14 ms 28948 KB Output is correct
50 Correct 8 ms 15316 KB Output is correct
51 Correct 14 ms 28884 KB Output is correct
52 Correct 5 ms 10452 KB Output is correct
53 Correct 15 ms 28244 KB Output is correct
54 Correct 7 ms 13524 KB Output is correct
55 Correct 18 ms 30164 KB Output is correct
56 Correct 10 ms 16724 KB Output is correct
57 Correct 18 ms 31352 KB Output is correct
58 Correct 9 ms 18516 KB Output is correct
59 Correct 70 ms 130744 KB Output is correct
60 Correct 43 ms 88272 KB Output is correct
61 Correct 67 ms 130764 KB Output is correct
62 Correct 42 ms 87208 KB Output is correct
63 Correct 70 ms 130704 KB Output is correct
64 Correct 48 ms 88196 KB Output is correct
65 Correct 63 ms 118044 KB Output is correct
66 Correct 59 ms 108440 KB Output is correct
67 Correct 56 ms 103720 KB Output is correct
68 Correct 50 ms 95876 KB Output is correct
69 Correct 63 ms 116916 KB Output is correct
70 Correct 60 ms 112056 KB Output is correct
71 Correct 56 ms 113260 KB Output is correct
72 Correct 63 ms 114428 KB Output is correct
73 Correct 56 ms 106060 KB Output is correct
74 Correct 60 ms 99236 KB Output is correct
75 Correct 70 ms 109588 KB Output is correct
76 Correct 79 ms 125624 KB Output is correct
77 Correct 64 ms 125644 KB Output is correct
78 Correct 49 ms 97000 KB Output is correct
79 Correct 53 ms 100296 KB Output is correct
80 Correct 68 ms 122992 KB Output is correct
81 Correct 54 ms 101524 KB Output is correct
82 Correct 56 ms 107256 KB Output is correct
83 Correct 67 ms 130756 KB Output is correct
84 Correct 64 ms 112084 KB Output is correct
85 Correct 63 ms 121820 KB Output is correct
86 Correct 61 ms 119244 KB Output is correct
87 Correct 56 ms 109568 KB Output is correct
88 Correct 69 ms 132024 KB Output is correct
89 Correct 68 ms 132048 KB Output is correct
90 Correct 56 ms 110748 KB Output is correct
91 Correct 69 ms 132008 KB Output is correct
92 Correct 74 ms 132172 KB Output is correct
93 Correct 66 ms 129440 KB Output is correct