oj.uz

답안 #718486

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
718486 2023-04-04T07:51:26 Z arush_agu Semiexpress (JOI17_semiexpress) C++17
100 / 100
 47 ms 11528 KB 
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

void solve() {
  ll n; int m, k; cin >> n >> m >> k;
  ll a, b, c; cin >> a >> b >> c;
  ll t; cin >> t;
  vl et(m); for (ll &x : et) cin >> x;

  int cnt_sets = 0;
  ll set = k - m;
  vvl dp_place(m - 1, vl(set + 1));
  for (int i=0; i<m; i++) {
    ll rem_cost = t - b * (et[i] - 1);
    if (rem_cost < 0) break;
    cnt_sets++;

    if (i == m - 1) break;
    dp_place[i][0] = min(rem_cost / a, et[i + 1] - et[i] - 1);

    ll prev_end = et[i] + dp_place[i][0];

    for (int p=1; p<=set; p++) {
      dp_place[i][p] = dp_place[i][p - 1];

      if (dp_place[i][p] == et[i + 1] - et[i] - 1) continue;

      ll curr_rem_cost = rem_cost - (prev_end + 1 - et[i]) * c;
      if (curr_rem_cost < 0) continue;

      dp_place[i][p] += curr_rem_cost / a + 1;
      dp_place[i][p] = min(dp_place[i][p], et[i + 1] - et[i] - 1);
      prev_end = et[i] + dp_place[i][p];
    }

    // cerr << dp_place[i] << "\n";
  }

  vl prev_dp(all(dp_place[0])), new_dp(set + 1);
  function<void(int, int, int, int, int)> f = [&](int l, int r, int optl, int optr, int i) {
    if (l > r) return;

    int mid = (l + r) / 2;
    llll best = {0, optl};
    for (int sp=optl; sp<=min(mid, optr); sp++) {
      if (mid - sp > set) continue;
      best = max(best, {prev_dp[mid - sp] + dp_place[i][sp], sp});
    }

    new_dp[mid] = best.first;
    f(l, mid - 1, optl, best.second, i);
    f(mid + 1, r, best.second, optr, i);
  };
  // cerr << "\n\n" << prev_dp << "\n";
  for (int i=1; i<m - 1; i++) {
    f(0, set, 0, set, i);
    prev_dp = new_dp;
    // cerr << prev_dp << "\n";
  }

  cout << *max_element(all(prev_dp)) + cnt_sets - 1 << "\n";
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  /* cin >> test_cases; */

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message

semiexpress.cpp: In function 'int main()':
semiexpress.cpp:155:11: warning: unused variable 'start' [-Wunused-variable]
  155 |   clock_t start = clock();
      |           ^~~~~

Subtask #1
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 316 KB Output is correct

Subtask #3
52.0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 320 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 320 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 22 ms 5388 KB Output is correct
20 Correct 39 ms 11528 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 8 ms 1620 KB Output is correct
23 Correct 47 ms 8712 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 1 ms 328 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 13 ms 2632 KB Output is correct
30 Correct 9 ms 1748 KB Output is correct