oj.uz

Submission #947604

# Submission time Handle Problem Language Result Execution time Memory
947604 2024-03-16T14:51:13 Z marvinthang Mizuyokan 2 (JOI23_mizuyokan2) C++17
60 / 100
 4000 ms 10764 KB 
/*************************************
*    author: marvinthang             *
*    created: 16.03.2024 18:00:02    *
*************************************/

#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 << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { return a > b ? a = b, true : false; }
template <class A, class B> bool maximize(A &a, B b)  { return a < b ? a = b, true : false; }

// end of template

const int BLOCK_SIZE = 450;

void process(void) {
	int n; cin >> n;
	vector <int> d(n); cin >> d;
	int q; cin >> q;
	vector <int> prv(n), nxt(n);
	vector <pair <int, int>> go(n);
	vector <int> block_id(n);
	REP(i, n) block_id[i] = i / BLOCK_SIZE;
	auto prepare = [&] {
		REP(i, n) {
			prv[i] = -1;
			int sum = 0;
			FORD(j, i, max(0, i - 65)) {
				if (sum > max(d[i], d[j])) {
					prv[i] = j;
					break;
				}
				sum += d[j];
			}
		}
		REPD(i, n) {
			nxt[i] = n;
			FOR(j, i + 1, min(n, i + 65)) if (prv[j] >= i) {
				nxt[i] = j;
				break;
			}
			go[i] = nxt[i] < n && block_id[nxt[i]] == block_id[i] ? go[nxt[i]] : pair{nxt[i], 0};
			++go[i].se;
		}
	};
	auto get_dist = [&] (int l, int r) {
		int res = 1;
		while (true) {
			if (go[l].fi <= r) {
				res += go[l].se + go[l].se;
				l = go[l].fi;
			} else if (nxt[l] <= r) {
				res += 2;
				l = nxt[l];
			} else break;
		}
		return res;
	};
	prepare();
	while (q--) {
		int x, y, l, r; cin >> x >> y >> l >> r; --x; --r;
		if (d[x] != y) {
			d[x] = y;
			prepare();
		}
		int res = get_dist(l, r);
		int u = l, v = r;
		int sum = 0;
		while (u <= r && sum <= d[u]) sum += d[u++];
		sum = 0;
		while (v >= l && sum <= d[v]) sum += d[v--];
		if (u <= r) maximize(res, get_dist(u, r) + 1);
		if (l <= v) maximize(res, get_dist(l, v) + 1);
		if (u <= v) maximize(res, get_dist(u, v) + 2);
		cout << res << '\n';
	}
}

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

Compilation message

mizuyokan2.cpp: In function 'int main()':
mizuyokan2.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
mizuyokan2.cpp:114:2: note: in expansion of macro 'file'
  114 |  file("mizuyokan2");
      |  ^~~~
mizuyokan2.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
mizuyokan2.cpp:114:2: note: in expansion of macro 'file'
  114 |  file("mizuyokan2");
      |  ^~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 456 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 456 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 456 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 456 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 484 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 524 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 456 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 456 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 484 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 524 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 46 ms 6740 KB Output is correct
42 Correct 52 ms 7612 KB Output is correct
43 Correct 39 ms 7508 KB Output is correct
44 Correct 35 ms 5524 KB Output is correct
45 Correct 71 ms 7868 KB Output is correct
46 Correct 117 ms 7356 KB Output is correct
47 Correct 56 ms 5824 KB Output is correct
48 Correct 79 ms 7276 KB Output is correct
49 Correct 103 ms 7352 KB Output is correct
50 Correct 95 ms 7248 KB Output is correct
51 Correct 89 ms 7252 KB Output is correct
52 Correct 38 ms 5972 KB Output is correct
53 Correct 68 ms 7764 KB Output is correct
54 Correct 67 ms 7312 KB Output is correct
55 Correct 32 ms 7228 KB Output is correct
56 Correct 84 ms 7360 KB Output is correct
57 Correct 33 ms 7260 KB Output is correct
58 Correct 77 ms 7356 KB Output is correct
59 Correct 46 ms 7760 KB Output is correct
60 Correct 32 ms 7828 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 45 ms 6680 KB Output is correct
3 Correct 98 ms 8532 KB Output is correct
4 Correct 95 ms 8612 KB Output is correct
5 Correct 81 ms 8428 KB Output is correct
6 Correct 216 ms 8348 KB Output is correct
7 Correct 232 ms 8928 KB Output is correct
8 Correct 219 ms 8016 KB Output is correct
9 Correct 226 ms 8052 KB Output is correct
10 Correct 200 ms 6992 KB Output is correct
11 Correct 251 ms 10428 KB Output is correct
12 Correct 261 ms 9236 KB Output is correct
13 Correct 201 ms 9044 KB Output is correct
14 Correct 198 ms 9044 KB Output is correct
15 Correct 228 ms 9072 KB Output is correct
16 Correct 239 ms 9228 KB Output is correct
17 Correct 96 ms 10088 KB Output is correct
18 Correct 145 ms 10764 KB Output is correct

Subtask #5
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 452 KB Output is correct
3 Execution timed out 4027 ms 6956 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 456 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 456 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 484 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 524 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 46 ms 6740 KB Output is correct
42 Correct 52 ms 7612 KB Output is correct
43 Correct 39 ms 7508 KB Output is correct
44 Correct 35 ms 5524 KB Output is correct
45 Correct 71 ms 7868 KB Output is correct
46 Correct 117 ms 7356 KB Output is correct
47 Correct 56 ms 5824 KB Output is correct
48 Correct 79 ms 7276 KB Output is correct
49 Correct 103 ms 7352 KB Output is correct
50 Correct 95 ms 7248 KB Output is correct
51 Correct 89 ms 7252 KB Output is correct
52 Correct 38 ms 5972 KB Output is correct
53 Correct 68 ms 7764 KB Output is correct
54 Correct 67 ms 7312 KB Output is correct
55 Correct 32 ms 7228 KB Output is correct
56 Correct 84 ms 7360 KB Output is correct
57 Correct 33 ms 7260 KB Output is correct
58 Correct 77 ms 7356 KB Output is correct
59 Correct 46 ms 7760 KB Output is correct
60 Correct 32 ms 7828 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 45 ms 6680 KB Output is correct
63 Correct 98 ms 8532 KB Output is correct
64 Correct 95 ms 8612 KB Output is correct
65 Correct 81 ms 8428 KB Output is correct
66 Correct 216 ms 8348 KB Output is correct
67 Correct 232 ms 8928 KB Output is correct
68 Correct 219 ms 8016 KB Output is correct
69 Correct 226 ms 8052 KB Output is correct
70 Correct 200 ms 6992 KB Output is correct
71 Correct 251 ms 10428 KB Output is correct
72 Correct 261 ms 9236 KB Output is correct
73 Correct 201 ms 9044 KB Output is correct
74 Correct 198 ms 9044 KB Output is correct
75 Correct 228 ms 9072 KB Output is correct
76 Correct 239 ms 9228 KB Output is correct
77 Correct 96 ms 10088 KB Output is correct
78 Correct 145 ms 10764 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 0 ms 452 KB Output is correct
81 Execution timed out 4027 ms 6956 KB Time limit exceeded
82 Halted 0 ms 0 KB -