oj.uz

답안 #828161

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
828161 2023-08-17T06:09:48 Z arush_agu Collecting Stamps 3 (JOI20_ho_t3) C++17
100 / 100
 341 ms 145308 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 <random>
#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 = 1e18;
const ld EPS = 1e-9;

// Saw solution

void solve() {
  ll n, l;
  cin >> n >> l;
  vll left(n);
  for (auto &i : left)
    cin >> i.first;
  for (auto &i : left)
    cin >> i.second;
  vll right = left;
  left.push_back({0, 0});
  sort(all(left));
  right.push_back({l, 0});
  sort(rev(right));

  ll dp[n + 10][n + 10][n + 10][2];
  auto dist = [&](int a, int b) {
    return min(((a - b) % l + l) % l, ((b - a) % l + l) % l);
  };

  int ans = 0;
  for (int lb = 0; lb <= n; lb++)
    for (int rb = 0; lb + rb <= n; rb++)
      for (int cnt = 0; cnt <= n; cnt++)
        dp[lb][rb][cnt][0] = dp[lb][rb][cnt][1] = INF;
  for (int lb = 1; lb <= n; lb++) {
    if (dist(0, left[lb].first) <= left[lb].second) {
      dp[lb][0][1][0] = dist(0, left[lb].first);
      dp[lb][0][1][1] = dp[lb][0][1][0] * 2;
      ans = 1;
    }
  }
  for (int rb = 1; rb <= n; rb++) {
    if (dist(0, right[rb].first) <= right[rb].second) {
      dp[0][rb][1][1] = dist(0, right[rb].first);
      dp[0][rb][1][0] = dp[0][rb][1][1] * 2;
      ans = 1;
    }
  }

  for (int cnt = 1; cnt <= n; cnt++) {
    for (int lb = 0; lb <= n; lb++) {
      for (int rb = 0; lb + rb <= n; rb++) {
        if (lb > 0)
          dp[lb][rb][cnt][0] = min(dp[lb][rb][cnt][0],
                                   dp[lb - 1][rb][cnt][1] +
                                       dist(right[rb].first, left[lb].first));
        if (lb > 0)
          dp[lb][rb][cnt][0] = min(
              dp[lb][rb][cnt][0], dp[lb - 1][rb][cnt][0] +
                                      dist(left[lb - 1].first, left[lb].first));
        if (lb > 0 && dp[lb - 1][rb][cnt - 1][0] +
                              dist(left[lb - 1].first, left[lb].first) <=
                          left[lb].second)
          dp[lb][rb][cnt][0] = min(
              dp[lb][rb][cnt][0], dp[lb - 1][rb][cnt - 1][0] +
                                      dist(left[lb - 1].first, left[lb].first));
        if (lb > 0 && dp[lb - 1][rb][cnt - 1][1] +
                              dist(right[rb].first, left[lb].first) <=
                          left[lb].second)
          dp[lb][rb][cnt][0] = min(dp[lb][rb][cnt][0],
                                   dp[lb - 1][rb][cnt - 1][1] +
                                       dist(right[rb].first, left[lb].first));

        if (rb > 0)
          dp[lb][rb][cnt][1] = min(dp[lb][rb][cnt][1],
                                   dp[lb][rb - 1][cnt][0] +
                                       dist(left[lb].first, right[rb].first));
        if (rb > 0)
          dp[lb][rb][cnt][1] =
              min(dp[lb][rb][cnt][1],
                  dp[lb][rb - 1][cnt][1] +
                      dist(right[rb - 1].first, right[rb].first));
        if (rb > 0 && dp[lb][rb - 1][cnt - 1][1] +
                              dist(right[rb - 1].first, right[rb].first) <=
                          right[rb].second)
          dp[lb][rb][cnt][1] =
              min(dp[lb][rb][cnt][1],
                  dp[lb][rb - 1][cnt - 1][1] +
                      dist(right[rb - 1].first, right[rb].first));
        if (rb > 0 && dp[lb][rb - 1][cnt - 1][0] +
                              dist(left[lb].first, right[rb].first) <=
                          right[rb].second)
          dp[lb][rb][cnt][1] = min(dp[lb][rb][cnt][1],
                                   dp[lb][rb - 1][cnt - 1][0] +
                                       dist(left[lb].first, right[rb].first));

        if (dp[lb][rb][cnt][0] < INF || dp[lb][rb][cnt][1] < INF)
          ans = max(ans, cnt);
      }
    }
  }

  cout << ans << "\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

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

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 448 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 452 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 452 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 448 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 241 ms 105932 KB Output is correct
19 Correct 120 ms 52008 KB Output is correct
20 Correct 49 ms 21716 KB Output is correct
21 Correct 107 ms 48020 KB Output is correct
22 Correct 155 ms 69372 KB Output is correct
23 Correct 36 ms 17364 KB Output is correct
24 Correct 25 ms 12500 KB Output is correct
25 Correct 36 ms 16916 KB Output is correct
26 Correct 9 ms 4820 KB Output is correct
27 Correct 37 ms 17932 KB Output is correct
28 Correct 22 ms 11348 KB Output is correct
29 Correct 39 ms 18388 KB Output is correct
30 Correct 28 ms 13216 KB Output is correct
31 Correct 35 ms 16840 KB Output is correct
32 Correct 13 ms 7188 KB Output is correct
33 Correct 35 ms 16920 KB Output is correct
34 Correct 7 ms 4308 KB Output is correct
35 Correct 33 ms 16340 KB Output is correct
36 Correct 11 ms 6100 KB Output is correct
37 Correct 37 ms 17876 KB Output is correct
38 Correct 15 ms 8020 KB Output is correct
39 Correct 39 ms 18948 KB Output is correct
40 Correct 17 ms 9276 KB Output is correct
41 Correct 328 ms 143244 KB Output is correct
42 Correct 182 ms 81376 KB Output is correct
43 Correct 334 ms 143348 KB Output is correct
44 Correct 179 ms 79932 KB Output is correct
45 Correct 331 ms 143244 KB Output is correct
46 Correct 181 ms 81284 KB Output is correct

Subtask #4
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 468 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 468 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 468 KB Output is correct
17 Correct 1 ms 468 KB Output is correct
18 Correct 1 ms 448 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 468 KB Output is correct
21 Correct 1 ms 452 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 0 ms 452 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 448 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 241 ms 105932 KB Output is correct
37 Correct 120 ms 52008 KB Output is correct
38 Correct 49 ms 21716 KB Output is correct
39 Correct 107 ms 48020 KB Output is correct
40 Correct 155 ms 69372 KB Output is correct
41 Correct 36 ms 17364 KB Output is correct
42 Correct 25 ms 12500 KB Output is correct
43 Correct 36 ms 16916 KB Output is correct
44 Correct 9 ms 4820 KB Output is correct
45 Correct 37 ms 17932 KB Output is correct
46 Correct 22 ms 11348 KB Output is correct
47 Correct 39 ms 18388 KB Output is correct
48 Correct 28 ms 13216 KB Output is correct
49 Correct 35 ms 16840 KB Output is correct
50 Correct 13 ms 7188 KB Output is correct
51 Correct 35 ms 16920 KB Output is correct
52 Correct 7 ms 4308 KB Output is correct
53 Correct 33 ms 16340 KB Output is correct
54 Correct 11 ms 6100 KB Output is correct
55 Correct 37 ms 17876 KB Output is correct
56 Correct 15 ms 8020 KB Output is correct
57 Correct 39 ms 18948 KB Output is correct
58 Correct 17 ms 9276 KB Output is correct
59 Correct 328 ms 143244 KB Output is correct
60 Correct 182 ms 81376 KB Output is correct
61 Correct 334 ms 143348 KB Output is correct
62 Correct 179 ms 79932 KB Output is correct
63 Correct 331 ms 143244 KB Output is correct
64 Correct 181 ms 81284 KB Output is correct
65 Correct 283 ms 123596 KB Output is correct
66 Correct 258 ms 109464 KB Output is correct
67 Correct 232 ms 102688 KB Output is correct
68 Correct 207 ms 91580 KB Output is correct
69 Correct 278 ms 121844 KB Output is correct
70 Correct 259 ms 114508 KB Output is correct
71 Correct 266 ms 116300 KB Output is correct
72 Correct 268 ms 118132 KB Output is correct
73 Correct 240 ms 106012 KB Output is correct
74 Correct 218 ms 96260 KB Output is correct
75 Correct 258 ms 111120 KB Output is correct
76 Correct 311 ms 135196 KB Output is correct
77 Correct 307 ms 135196 KB Output is correct
78 Correct 211 ms 93144 KB Output is correct
79 Correct 226 ms 97840 KB Output is correct
80 Correct 300 ms 131280 KB Output is correct
81 Correct 227 ms 99440 KB Output is correct
82 Correct 244 ms 107700 KB Output is correct
83 Correct 329 ms 143244 KB Output is correct
84 Correct 261 ms 114616 KB Output is correct
85 Correct 298 ms 129360 KB Output is correct
86 Correct 288 ms 125560 KB Output is correct
87 Correct 259 ms 111128 KB Output is correct
88 Correct 335 ms 145228 KB Output is correct
89 Correct 336 ms 145308 KB Output is correct
90 Correct 257 ms 112924 KB Output is correct
91 Correct 341 ms 145256 KB Output is correct
92 Correct 333 ms 145228 KB Output is correct
93 Correct 322 ms 141204 KB Output is correct