답안 #905074

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
905074	2024-01-12T14:06:07 Z	marvinthang	Fish 2 (JOI22_fish2)	C++17	25 / 100	4000 ms	3024 KB

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);
	auto prepare = [&] {
		REP(i, n) pref[i + 1] = pref[i] + a[i];
	};
	prepare();
	while (q--) {
		int t, ql, qr; cin >> t >> ql >> qr; --ql;
		if (t == 1) {
			a[ql] = qr;
			prepare();
		} else {
			stack <int> st;
			vector <int> cnt(n + 1);
			auto check_interval = [&] (int l, int r) {
				long long sum = pref[r] - pref[l + 1];
				if (l >= ql && sum >= a[l]) return;
				if (r < qr && sum >= a[r]) return;
				++cnt[l + 1]; --cnt[r];
			};
			FOR(i, ql, qr) {
				while (!st.empty() && a[st.top()] <= a[i]) st.pop();
				check_interval(st.empty() ? ql - 1 : st.top(), i);
				st.push(i);
			}
			while (!st.empty()) st.pop();
			FORD(i, qr, ql) {
				while (!st.empty() && a[st.top()] < a[i]) st.pop();
				check_interval(i, st.empty() ? qr : st.top());
				st.push(i);
			}
			partial_sum(ALL(cnt), cnt.begin());
			cout << count(cnt.begin() + ql, cnt.begin() + qr, 0) << '\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

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:87:2: note: in expansion of macro 'file'
   87 |  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:87:2: note: in expansion of macro 'file'
   87 |  file("fish2");
      |  ^~~~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	2 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	2 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	3 ms	348 KB	Output is correct

Subtask #2
8.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	10 ms	1880 KB	Output is correct
3	Correct	7 ms	1880 KB	Output is correct
4	Correct	9 ms	1884 KB	Output is correct
5	Correct	7 ms	1884 KB	Output is correct
6	Correct	11 ms	1888 KB	Output is correct
7	Correct	8 ms	1884 KB	Output is correct
8	Correct	12 ms	1880 KB	Output is correct
9	Correct	8 ms	1880 KB	Output is correct
10	Correct	9 ms	1884 KB	Output is correct
11	Correct	7 ms	1884 KB	Output is correct
12	Correct	9 ms	1996 KB	Output is correct
13	Correct	11 ms	1884 KB	Output is correct
14	Correct	9 ms	1884 KB	Output is correct
15	Correct	10 ms	1884 KB	Output is correct

Subtask #3
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	2 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	2 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	3 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	10 ms	1880 KB	Output is correct
23	Correct	7 ms	1880 KB	Output is correct
24	Correct	9 ms	1884 KB	Output is correct
25	Correct	7 ms	1884 KB	Output is correct
26	Correct	11 ms	1888 KB	Output is correct
27	Correct	8 ms	1884 KB	Output is correct
28	Correct	12 ms	1880 KB	Output is correct
29	Correct	8 ms	1880 KB	Output is correct
30	Correct	9 ms	1884 KB	Output is correct
31	Correct	7 ms	1884 KB	Output is correct
32	Correct	9 ms	1996 KB	Output is correct
33	Correct	11 ms	1884 KB	Output is correct
34	Correct	9 ms	1884 KB	Output is correct
35	Correct	10 ms	1884 KB	Output is correct
36	Correct	262 ms	2024 KB	Output is correct
37	Correct	391 ms	2508 KB	Output is correct
38	Correct	437 ms	2260 KB	Output is correct
39	Correct	147 ms	2516 KB	Output is correct
40	Correct	489 ms	2380 KB	Output is correct
41	Correct	676 ms	3024 KB	Output is correct
42	Correct	844 ms	3004 KB	Output is correct
43	Correct	694 ms	2252 KB	Output is correct
44	Correct	809 ms	2240 KB	Output is correct
45	Correct	277 ms	2516 KB	Output is correct
46	Correct	376 ms	2612 KB	Output is correct
47	Correct	513 ms	2312 KB	Output is correct
48	Correct	316 ms	2512 KB	Output is correct
49	Correct	889 ms	2288 KB	Output is correct
50	Correct	398 ms	2768 KB	Output is correct
51	Correct	1774 ms	2652 KB	Output is correct
52	Correct	1745 ms	2652 KB	Output is correct

Subtask #4
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	10 ms	1880 KB	Output is correct
3	Correct	7 ms	1880 KB	Output is correct
4	Correct	9 ms	1884 KB	Output is correct
5	Correct	7 ms	1884 KB	Output is correct
6	Correct	11 ms	1888 KB	Output is correct
7	Correct	8 ms	1884 KB	Output is correct
8	Correct	12 ms	1880 KB	Output is correct
9	Correct	8 ms	1880 KB	Output is correct
10	Correct	9 ms	1884 KB	Output is correct
11	Correct	7 ms	1884 KB	Output is correct
12	Correct	9 ms	1996 KB	Output is correct
13	Correct	11 ms	1884 KB	Output is correct
14	Correct	9 ms	1884 KB	Output is correct
15	Correct	10 ms	1884 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Execution timed out	4017 ms	2164 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-

Subtask #5
0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	10 ms	1880 KB	Output is correct
3	Correct	7 ms	1880 KB	Output is correct
4	Correct	9 ms	1884 KB	Output is correct
5	Correct	7 ms	1884 KB	Output is correct
6	Correct	11 ms	1888 KB	Output is correct
7	Correct	8 ms	1884 KB	Output is correct
8	Correct	12 ms	1880 KB	Output is correct
9	Correct	8 ms	1880 KB	Output is correct
10	Correct	9 ms	1884 KB	Output is correct
11	Correct	7 ms	1884 KB	Output is correct
12	Correct	9 ms	1996 KB	Output is correct
13	Correct	11 ms	1884 KB	Output is correct
14	Correct	9 ms	1884 KB	Output is correct
15	Correct	10 ms	1884 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Execution timed out	4057 ms	2168 KB	Time limit exceeded
18	Halted	0 ms	0 KB	-

Subtask #6
0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	2 ms	348 KB	Output is correct
9	Correct	2 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	2 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	2 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	2 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	3 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	10 ms	1880 KB	Output is correct
23	Correct	7 ms	1880 KB	Output is correct
24	Correct	9 ms	1884 KB	Output is correct
25	Correct	7 ms	1884 KB	Output is correct
26	Correct	11 ms	1888 KB	Output is correct
27	Correct	8 ms	1884 KB	Output is correct
28	Correct	12 ms	1880 KB	Output is correct
29	Correct	8 ms	1880 KB	Output is correct
30	Correct	9 ms	1884 KB	Output is correct
31	Correct	7 ms	1884 KB	Output is correct
32	Correct	9 ms	1996 KB	Output is correct
33	Correct	11 ms	1884 KB	Output is correct
34	Correct	9 ms	1884 KB	Output is correct
35	Correct	10 ms	1884 KB	Output is correct
36	Correct	262 ms	2024 KB	Output is correct
37	Correct	391 ms	2508 KB	Output is correct
38	Correct	437 ms	2260 KB	Output is correct
39	Correct	147 ms	2516 KB	Output is correct
40	Correct	489 ms	2380 KB	Output is correct
41	Correct	676 ms	3024 KB	Output is correct
42	Correct	844 ms	3004 KB	Output is correct
43	Correct	694 ms	2252 KB	Output is correct
44	Correct	809 ms	2240 KB	Output is correct
45	Correct	277 ms	2516 KB	Output is correct
46	Correct	376 ms	2612 KB	Output is correct
47	Correct	513 ms	2312 KB	Output is correct
48	Correct	316 ms	2512 KB	Output is correct
49	Correct	889 ms	2288 KB	Output is correct
50	Correct	398 ms	2768 KB	Output is correct
51	Correct	1774 ms	2652 KB	Output is correct
52	Correct	1745 ms	2652 KB	Output is correct
53	Correct	1 ms	344 KB	Output is correct
54	Execution timed out	4017 ms	2164 KB	Time limit exceeded
55	Halted	0 ms	0 KB	-

답안 #905074

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 8.0 / 8.0

Subtask #3 12.0 / 12.0

Subtask #4 0 / 23.0

Subtask #5 0 / 35.0

Subtask #6 0 / 17.0

Subtask #1
5.0 / 5.0

Subtask #2
8.0 / 8.0

Subtask #3
12.0 / 12.0

Subtask #4
0 / 23.0

Subtask #5
0 / 35.0

Subtask #6
0 / 17.0