oj.uz

Submission #884348

# Submission time Handle Problem Language Result Execution time Memory
884348 2023-12-07T08:15:06 Z marvinthang Collecting Stamps 3 (JOI20_ho_t3) C++17
100 / 100
 420 ms 453368 KB 
/*************************************
*    author: marvinthang             *
*    created: 07.12.2023 15:03:09    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
// copied from https://codeforces.com/blog/entry/76149
template<typename T, int D> struct Vec: public vector <Vec <T, D - 1>> {
    static_assert(D >= 1, "Vector dimension must be greater than zero!");
    template <typename... Args>
    Vec(int n = 0, Args... args): vector <Vec <T, D - 1>>(n, Vec <T, D - 1>(args...)) {}
};
template<typename T> struct Vec <T, 1>: public vector <T> {
    Vec(int n = 0, const T& val = T()): vector <T>(n, val) {}
};
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

const int INF = 1e9 + 7;

void process(void) {
	int n, l; cin >> n >> l;
	vector <int> x(n + 1), t(n + 1);
	REP(i, n) cin >> x[i + 1];
	REP(i, n) cin >> t[i + 1];
	Vec<int, 4> dp(n + 2, n + 2, n + 1, 2, INF);
	auto dist = [&] (int a, int b) {
		return min(abs(x[a] - x[b]), l - abs(x[a] - x[b]));
	};
	dp[0][n + 1][0][0] = 0;
	int res = 0;
	REP(l, n + 1) FORD(r, n + 2, l + 1) REP(cnt, n + 1) REP(p, 2) if (dp[l][r][cnt][p] < INF) {
		res = max(res, cnt);
		int cur = p ? r : l;
		if (l + 1 < r) {
			int v = dp[l][r][cnt][p] + dist(cur, l + 1);
			minimize(dp[l + 1][r][cnt + (v <= t[l + 1])][0], v);
			v = dp[l][r][cnt][p] + dist(cur, r - 1);
			minimize(dp[l][r - 1][cnt + (v <= t[r - 1])][1], v);
		}
	}
	cout << res << '\n';
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("JOI20_ho_t3");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message

ho_t3.cpp: In function 'int main()':
ho_t3.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
ho_t3.cpp:84:2: note: in expansion of macro 'file'
   84 |  file("JOI20_ho_t3");
      |  ^~~~
ho_t3.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
ho_t3.cpp:84:2: note: in expansion of macro 'file'
   84 |  file("JOI20_ho_t3");
      |  ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 500 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 460 KB Output is correct
13 Correct 0 ms 856 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 500 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 460 KB Output is correct
13 Correct 0 ms 856 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 0 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 0 ms 452 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 500 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 460 KB Output is correct
13 Correct 0 ms 856 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 321 ms 326448 KB Output is correct
19 Correct 153 ms 154880 KB Output is correct
20 Correct 60 ms 60628 KB Output is correct
21 Correct 138 ms 141888 KB Output is correct
22 Correct 200 ms 209224 KB Output is correct
23 Correct 48 ms 47696 KB Output is correct
24 Correct 32 ms 33112 KB Output is correct
25 Correct 46 ms 46172 KB Output is correct
26 Correct 10 ms 11100 KB Output is correct
27 Correct 54 ms 49288 KB Output is correct
28 Correct 29 ms 29788 KB Output is correct
29 Correct 51 ms 50608 KB Output is correct
30 Correct 35 ms 35420 KB Output is correct
31 Correct 46 ms 46160 KB Output is correct
32 Correct 18 ms 17752 KB Output is correct
33 Correct 46 ms 46048 KB Output is correct
34 Correct 9 ms 10076 KB Output is correct
35 Correct 44 ms 44636 KB Output is correct
36 Correct 21 ms 14940 KB Output is correct
37 Correct 48 ms 49112 KB Output is correct
38 Correct 20 ms 20060 KB Output is correct
39 Correct 50 ms 52304 KB Output is correct
40 Correct 24 ms 23644 KB Output is correct
41 Correct 420 ms 447060 KB Output is correct
42 Correct 219 ms 247632 KB Output is correct
43 Correct 409 ms 447048 KB Output is correct
44 Correct 214 ms 242864 KB Output is correct
45 Correct 404 ms 446804 KB Output is correct
46 Correct 220 ms 247636 KB Output is correct

Subtask #4
75.0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 500 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 460 KB Output is correct
13 Correct 0 ms 856 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 0 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 0 ms 452 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 1 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 321 ms 326448 KB Output is correct
37 Correct 153 ms 154880 KB Output is correct
38 Correct 60 ms 60628 KB Output is correct
39 Correct 138 ms 141888 KB Output is correct
40 Correct 200 ms 209224 KB Output is correct
41 Correct 48 ms 47696 KB Output is correct
42 Correct 32 ms 33112 KB Output is correct
43 Correct 46 ms 46172 KB Output is correct
44 Correct 10 ms 11100 KB Output is correct
45 Correct 54 ms 49288 KB Output is correct
46 Correct 29 ms 29788 KB Output is correct
47 Correct 51 ms 50608 KB Output is correct
48 Correct 35 ms 35420 KB Output is correct
49 Correct 46 ms 46160 KB Output is correct
50 Correct 18 ms 17752 KB Output is correct
51 Correct 46 ms 46048 KB Output is correct
52 Correct 9 ms 10076 KB Output is correct
53 Correct 44 ms 44636 KB Output is correct
54 Correct 21 ms 14940 KB Output is correct
55 Correct 48 ms 49112 KB Output is correct
56 Correct 20 ms 20060 KB Output is correct
57 Correct 50 ms 52304 KB Output is correct
58 Correct 24 ms 23644 KB Output is correct
59 Correct 420 ms 447060 KB Output is correct
60 Correct 219 ms 247632 KB Output is correct
61 Correct 409 ms 447048 KB Output is correct
62 Correct 214 ms 242864 KB Output is correct
63 Correct 404 ms 446804 KB Output is correct
64 Correct 220 ms 247636 KB Output is correct
65 Correct 338 ms 383672 KB Output is correct
66 Correct 304 ms 337488 KB Output is correct
67 Correct 279 ms 315940 KB Output is correct
68 Correct 261 ms 280124 KB Output is correct
69 Correct 336 ms 377408 KB Output is correct
70 Correct 312 ms 353876 KB Output is correct
71 Correct 319 ms 360100 KB Output is correct
72 Correct 321 ms 365492 KB Output is correct
73 Correct 302 ms 326440 KB Output is correct
74 Correct 268 ms 295272 KB Output is correct
75 Correct 301 ms 342864 KB Output is correct
76 Correct 387 ms 420692 KB Output is correct
77 Correct 376 ms 420884 KB Output is correct
78 Correct 275 ms 285188 KB Output is correct
79 Correct 274 ms 300136 KB Output is correct
80 Correct 372 ms 408144 KB Output is correct
81 Correct 277 ms 305520 KB Output is correct
82 Correct 298 ms 331604 KB Output is correct
83 Correct 390 ms 446804 KB Output is correct
84 Correct 322 ms 353876 KB Output is correct
85 Correct 351 ms 401492 KB Output is correct
86 Correct 364 ms 389564 KB Output is correct
87 Correct 300 ms 342720 KB Output is correct
88 Correct 414 ms 453368 KB Output is correct
89 Correct 388 ms 453184 KB Output is correct
90 Correct 310 ms 348720 KB Output is correct
91 Correct 397 ms 453244 KB Output is correct
92 Correct 393 ms 453352 KB Output is correct
93 Correct 379 ms 440148 KB Output is correct