Submission #905065

#	Time	Username	Problem	Language	Result	Execution time	Memory
905065		marvinthang	Fish 2 (JOI22_fish2)	C++17	13 / 100	4067 ms	12636 KiB

fish2

/*************************************
*    author: marvinthang             *
*    created: 12.01.2024 20:25:24    *
*************************************/

#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 << '}'; }

// end of template

void process(void) {
	int n; cin >> n;
	vector <int> a(n); cin >> a;
	int q; cin >> q;
	vector <long long> pref(n + 1);
	int l = __lg(n);
	if (MASK(l) < n) ++l;
	vector mx(n, vector<int>(l));
	auto prepare = [&] {
		REP(i, n) {
			pref[i + 1] = pref[i] + a[i];
			mx[i][0] = a[i];
		}
		FOR(k, 1, l) REP(i, n - MASK(k) + 1) mx[i][k] = max(mx[i][k - 1], mx[i + MASK(k - 1)][k - 1]);
	};
	prepare();
	while (q--) {
		int t, l, r; cin >> t >> l >> r; --l;
		if (t == 1) {
			a[l] = r;
			prepare();
		} else {
			auto get_max = [&] (int l, int r) {
				int h = __lg(r - l + 1);
				return max(mx[l][h], mx[r - MASK(h) + 1][h]);
			};
			int res = 0;
			FOR(i, l, r) {
				int cur_l = i, cur_r = i + 1;
				long long cur_sum = a[i];
				while (true) {
					int lx = l, rx = cur_l - 1;
					bool ok = false;
					while (lx <= rx) {
						int m = lx + rx >> 1;
						if (get_max(m, cur_l - 1) <= cur_sum) rx = m - 1;
						else lx = m + 1;
					}
					if (lx < cur_l) {
						cur_sum += pref[cur_l] - pref[lx];
						cur_l = lx;
						ok = true;
					}
					lx = cur_r + 1, rx = r;
					while (lx <= rx) {
						int m = lx + rx >> 1;
						if (get_max(cur_r, m - 1) <= cur_sum) lx = m + 1;
						else rx = m - 1;
					}
					if (cur_r < rx) {
						cur_sum += pref[rx] - pref[cur_r];
						cur_r = rx;
						ok = true;
					}
					if (!ok) break;
				}
				res += cur_l == l && cur_r == r;
			}
			cout << res << '\n';
		}
	}
}

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

Compilation message (stderr)

fish2.cpp: In function 'void process()':
fish2.cpp:79:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   79 |       int m = lx + rx >> 1;
      |               ~~~^~~~
fish2.cpp:90:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   90 |       int m = lx + rx >> 1;
      |               ~~~^~~~
fish2.cpp: In function 'int main()':
fish2.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
fish2.cpp:110:2: note: in expansion of macro 'file'
  110 |  file("fish2");
      |  ^~~~
fish2.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
fish2.cpp:110:2: note: in expansion of macro 'file'
  110 |  file("fish2");
      |  ^~~~

• Subtask 1: 5 / 5
• Subtask 2: 8 / 8
• Subtask 3: 0 / 12
• Subtask 4: 0 / 23
• Subtask 5: 0 / 35
• Subtask 6: 0 / 17