제출 #754400

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
754400		Sam_a17	Collecting Stamps 3 (JOI20_ho_t3)	C++17	100 / 100	79 ms	132172 KiB

ho_t3

#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;
}

컴파일 시 표준 에러 (stderr) 메시지

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 / 5
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 75 / 75