답안 #947597

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947597 2024-03-16T14:29:44 Z marvinthang Mizuyokan 2 (JOI23_mizuyokan2) C++17
0 / 100
4000 ms 348 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 INF = 1e9 + 7;

void process(void) {
	int n; cin >> n;
	vector <int> d(n); cin >> d;
	int q; cin >> q;
	vector <int> prv(n), nxt(n);
	auto prepare = [&] {
		REP(i, n) {
			prv[i] = -1;
			int sum = 0;
			FORD(j, i, max(0, i - 35)) {
				if (sum > max(d[i], d[j])) {
					prv[i] = j;
					break;
				}
				sum += d[j];
			}
		}
		REP(i, n) {
			nxt[i] = n;
			FOR(j, i + 1, min(n, i + 36)) if (prv[j] >= i) {
				nxt[i] = j;
				break;
			}
		}
	};
	auto get_dist = [&] (int l, int r) {
		int res = 1;
		while (nxt[l] <= r) {
			res += 2;
			l = nxt[l];
		}
		return res;
	};
	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:103:2: note: in expansion of macro 'file'
  103 |  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:103:2: note: in expansion of macro 'file'
  103 |  file("mizuyokan2");
      |  ^~~~
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4037 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4037 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4037 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4013 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4048 ms 348 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4037 ms 344 KB Time limit exceeded
2 Halted 0 ms 0 KB -