답안 #947605

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
947605	2024-03-16T14:56:19 Z	marvinthang	Mizuyokan 2 (JOI23_mizuyokan2)	C++17	100 / 100	475 ms	10636 KB

mizuyokan2

/*************************************
*    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 get_prev = [&] (int i) {
		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];
		}
	};
	auto get_next = [&] (int i) {
		nxt[i] = n;
		FOR(j, i + 1, min(n, i + 65)) if (prv[j] >= i) {
			nxt[i] = j;
			break;
		}
	};
	auto get_go = [&] (int i) {
		go[i] = nxt[i] < n && block_id[nxt[i]] == block_id[i] ? go[nxt[i]] : pair{nxt[i], 0};
		++go[i].se;
	};
	REPD(i, n) {
		get_prev(i);
		get_next(i);
		get_go(i);
	}
	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;
	};
	while (q--) {
		int x, y, l, r; cin >> x >> y >> l >> r; --x; --r;
		if (d[x] != y) {
			d[x] = y;
			int l = max(0, x - 65);
			int r = min(n, x + 65);
			FORD(i, r, l) {
				get_prev(i);
				get_next(i);
				get_go(i);
			}
			FORD(i, l, block_id[l] * BLOCK_SIZE) get_go(i);
		}
		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:125:2: note: in expansion of macro 'file'
  125 |  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:125:2: note: in expansion of macro 'file'
  125 |  file("mizuyokan2");
      |  ^~~~

Subtask #1
6.0 / 6.0

#	결과	실행 시간	메모리	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	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 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	344 KB	Output is correct
10	Correct	1 ms	504 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct

Subtask #2
9.0 / 9.0

#	결과	실행 시간	메모리	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	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 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	344 KB	Output is correct
10	Correct	1 ms	504 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	416 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	0 ms	348 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	348 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct

Subtask #3
13.0 / 13.0

#	결과	실행 시간	메모리	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	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 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	344 KB	Output is correct
10	Correct	1 ms	504 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	416 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	0 ms	348 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	348 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	21 ms	5464 KB	Output is correct
42	Correct	22 ms	6236 KB	Output is correct
43	Correct	21 ms	6236 KB	Output is correct
44	Correct	17 ms	4528 KB	Output is correct
45	Correct	24 ms	6232 KB	Output is correct
46	Correct	26 ms	6236 KB	Output is correct
47	Correct	19 ms	4700 KB	Output is correct
48	Correct	27 ms	6236 KB	Output is correct
49	Correct	27 ms	6312 KB	Output is correct
50	Correct	25 ms	6232 KB	Output is correct
51	Correct	25 ms	6236 KB	Output is correct
52	Correct	18 ms	4700 KB	Output is correct
53	Correct	23 ms	6312 KB	Output is correct
54	Correct	22 ms	6236 KB	Output is correct
55	Correct	17 ms	6316 KB	Output is correct
56	Correct	24 ms	6232 KB	Output is correct
57	Correct	17 ms	6236 KB	Output is correct
58	Correct	23 ms	6236 KB	Output is correct
59	Correct	22 ms	6224 KB	Output is correct
60	Correct	27 ms	6228 KB	Output is correct

Subtask #4
32.0 / 32.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	44 ms	4700 KB	Output is correct
3	Correct	79 ms	6372 KB	Output is correct
4	Correct	93 ms	6360 KB	Output is correct
5	Correct	79 ms	6484 KB	Output is correct
6	Correct	221 ms	6348 KB	Output is correct
7	Correct	227 ms	6572 KB	Output is correct
8	Correct	221 ms	6480 KB	Output is correct
9	Correct	226 ms	6588 KB	Output is correct
10	Correct	213 ms	5360 KB	Output is correct
11	Correct	244 ms	6484 KB	Output is correct
12	Correct	242 ms	6484 KB	Output is correct
13	Correct	192 ms	6608 KB	Output is correct
14	Correct	236 ms	6484 KB	Output is correct
15	Correct	220 ms	6484 KB	Output is correct
16	Correct	245 ms	6760 KB	Output is correct
17	Correct	84 ms	6400 KB	Output is correct
18	Correct	132 ms	6564 KB	Output is correct

Subtask #5
29.0 / 29.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	111 ms	7052 KB	Output is correct
4	Correct	148 ms	8784 KB	Output is correct
5	Correct	151 ms	8784 KB	Output is correct
6	Correct	360 ms	8944 KB	Output is correct
7	Correct	345 ms	8792 KB	Output is correct
8	Correct	367 ms	8532 KB	Output is correct
9	Correct	351 ms	8532 KB	Output is correct
10	Correct	370 ms	9280 KB	Output is correct
11	Correct	351 ms	8508 KB	Output is correct
12	Correct	273 ms	8792 KB	Output is correct
13	Correct	414 ms	8532 KB	Output is correct
14	Correct	347 ms	8788 KB	Output is correct
15	Correct	380 ms	8528 KB	Output is correct
16	Correct	108 ms	9024 KB	Output is correct
17	Correct	161 ms	9280 KB	Output is correct

Subtask #6
11.0 / 11.0

#	결과	실행 시간	메모리	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	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 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	344 KB	Output is correct
10	Correct	1 ms	504 KB	Output is correct
11	Correct	0 ms	344 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	1 ms	344 KB	Output is correct
23	Correct	1 ms	416 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	0 ms	348 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	348 KB	Output is correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	1 ms	348 KB	Output is correct
41	Correct	21 ms	5464 KB	Output is correct
42	Correct	22 ms	6236 KB	Output is correct
43	Correct	21 ms	6236 KB	Output is correct
44	Correct	17 ms	4528 KB	Output is correct
45	Correct	24 ms	6232 KB	Output is correct
46	Correct	26 ms	6236 KB	Output is correct
47	Correct	19 ms	4700 KB	Output is correct
48	Correct	27 ms	6236 KB	Output is correct
49	Correct	27 ms	6312 KB	Output is correct
50	Correct	25 ms	6232 KB	Output is correct
51	Correct	25 ms	6236 KB	Output is correct
52	Correct	18 ms	4700 KB	Output is correct
53	Correct	23 ms	6312 KB	Output is correct
54	Correct	22 ms	6236 KB	Output is correct
55	Correct	17 ms	6316 KB	Output is correct
56	Correct	24 ms	6232 KB	Output is correct
57	Correct	17 ms	6236 KB	Output is correct
58	Correct	23 ms	6236 KB	Output is correct
59	Correct	22 ms	6224 KB	Output is correct
60	Correct	27 ms	6228 KB	Output is correct
61	Correct	0 ms	344 KB	Output is correct
62	Correct	44 ms	4700 KB	Output is correct
63	Correct	79 ms	6372 KB	Output is correct
64	Correct	93 ms	6360 KB	Output is correct
65	Correct	79 ms	6484 KB	Output is correct
66	Correct	221 ms	6348 KB	Output is correct
67	Correct	227 ms	6572 KB	Output is correct
68	Correct	221 ms	6480 KB	Output is correct
69	Correct	226 ms	6588 KB	Output is correct
70	Correct	213 ms	5360 KB	Output is correct
71	Correct	244 ms	6484 KB	Output is correct
72	Correct	242 ms	6484 KB	Output is correct
73	Correct	192 ms	6608 KB	Output is correct
74	Correct	236 ms	6484 KB	Output is correct
75	Correct	220 ms	6484 KB	Output is correct
76	Correct	245 ms	6760 KB	Output is correct
77	Correct	84 ms	6400 KB	Output is correct
78	Correct	132 ms	6564 KB	Output is correct
79	Correct	0 ms	344 KB	Output is correct
80	Correct	0 ms	348 KB	Output is correct
81	Correct	111 ms	7052 KB	Output is correct
82	Correct	148 ms	8784 KB	Output is correct
83	Correct	151 ms	8784 KB	Output is correct
84	Correct	360 ms	8944 KB	Output is correct
85	Correct	345 ms	8792 KB	Output is correct
86	Correct	367 ms	8532 KB	Output is correct
87	Correct	351 ms	8532 KB	Output is correct
88	Correct	370 ms	9280 KB	Output is correct
89	Correct	351 ms	8508 KB	Output is correct
90	Correct	273 ms	8792 KB	Output is correct
91	Correct	414 ms	8532 KB	Output is correct
92	Correct	347 ms	8788 KB	Output is correct
93	Correct	380 ms	8528 KB	Output is correct
94	Correct	108 ms	9024 KB	Output is correct
95	Correct	161 ms	9280 KB	Output is correct
96	Correct	94 ms	7604 KB	Output is correct
97	Correct	174 ms	9972 KB	Output is correct
98	Correct	154 ms	10112 KB	Output is correct
99	Correct	455 ms	9452 KB	Output is correct
100	Correct	475 ms	9556 KB	Output is correct
101	Correct	392 ms	9300 KB	Output is correct
102	Correct	451 ms	9228 KB	Output is correct
103	Correct	335 ms	10636 KB	Output is correct
104	Correct	345 ms	9040 KB	Output is correct
105	Correct	329 ms	9476 KB	Output is correct
106	Correct	370 ms	9204 KB	Output is correct
107	Correct	350 ms	9208 KB	Output is correct
108	Correct	387 ms	9304 KB	Output is correct
109	Correct	120 ms	10316 KB	Output is correct
110	Correct	170 ms	10392 KB	Output is correct

답안 #947605

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 9.0 / 9.0

Subtask #3 13.0 / 13.0

Subtask #4 32.0 / 32.0

Subtask #5 29.0 / 29.0

Subtask #6 11.0 / 11.0

Subtask #1
6.0 / 6.0

Subtask #2
9.0 / 9.0

Subtask #3
13.0 / 13.0

Subtask #4
32.0 / 32.0

Subtask #5
29.0 / 29.0

Subtask #6
11.0 / 11.0