oj.uz

답안 #892939

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892939 2023-12-26T08:09:40 Z marvinthang Ants and Sugar (JOI22_sugar) C++17
100 / 100
 746 ms 120408 KB 
/*************************************
*    author: marvinthang             *
*    created: 26.12.2023 10:02:55    *
*************************************/

#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

struct Node {
	long long ma[2][2], lazy, common;
	Node() {
		REP(i, 2) REP(j, 2) ma[i][j] = 0;
		lazy = common = 0;
	}
	void add(long long x) {
		REP(i, 2) REP(j, 2) ma[i][j] -= x;
		lazy += x;
		common += x;
	}
	void merge(const Node &a, const Node &b) {
		REP(i, 2) REP(j, 2) ma[i][j] = max(a.ma[i][0] + b.ma[0][j], a.ma[i][1] + b.ma[1][j] + common);
		REP(i, 2) {
			maximize(ma[i][0], a.ma[i][0]);
			maximize(ma[0][i], b.ma[0][i]);
		}
	}
};

void process(void) {
	int q, l; cin >> q >> l;
	vector <tuple <int, int, int>> queries;
	vector <int> pos;
	REP(i, q) {
		int t, x, a; cin >> t >> x >> a;
		if (t == 1) pos.push_back(x);
		queries.emplace_back(t, x, a);
	}
	sort(ALL(pos));
	pos.erase(unique(ALL(pos)), pos.end());
	vector <Node> st(pos.size() * 4 + 23);
	auto pushDown = [&] (int i) {
		if (!st[i].lazy) return;
		st[i << 1].add(st[i].lazy);
		st[i << 1 | 1].add(st[i].lazy);
		st[i].lazy = 0;
	};
	function<void(int, int, int, int, int)> updateAnt = [&] (int i, int l, int r, int p, int v) {
		if (r - l == 1) {
			REP(x, 2) REP(y, 2) st[i].ma[x][y] += v;
			return;
		}
		pushDown(i);
		int m = l + r >> 1;
		if (p < m) updateAnt(i << 1, l, m, p, v);
		else updateAnt(i << 1 | 1, m, r, p, v);
		st[i].merge(st[i << 1], st[i << 1 | 1]);
	};
	function<void(int, int, int, int, int, int)> updateSugar = [&] (int i, int l, int r, int u, int v, int w) {
		if (u <= l && r <= v) {
			st[i].add(w);
			return;
		}
		pushDown(i);
		int m = l + r >> 1;
		if (v <= m) updateSugar(i << 1, l, m, u, v, w);
		else if (u >= m) updateSugar(i << 1 | 1, m, r, u, v, w);
		else {
			st[i].common += w;
			updateSugar(i << 1, l, m, u, v, w);
			updateSugar(i << 1 | 1, m, r, u, v, w);
		}
		st[i].merge(st[i << 1], st[i << 1 | 1]);
	};
	
	long long sum = 0;
	for (auto [t, x, a]: queries) {
		if (t == 1) {
			x = lower_bound(ALL(pos), x) - pos.begin();
			updateAnt(1, 0, (int) pos.size(), x, a);
			sum += a;
		} else {
			int tl = lower_bound(ALL(pos), x - l) - pos.begin();
			int tr = upper_bound(ALL(pos), x + l) - pos.begin();
			if (tl < tr) updateSugar(1, 0, (int) pos.size(), tl, tr, a);
		}
		cout << sum - max(0LL, st[1].ma[0][0]) << '\n';
	}
}

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

Compilation message

sugar.cpp: In lambda function:
sugar.cpp:91:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   91 |   int m = l + r >> 1;
      |           ~~^~~
sugar.cpp: In lambda function:
sugar.cpp:102:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  102 |   int m = l + r >> 1;
      |           ~~^~~
sugar.cpp: In function 'int main()':
sugar.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); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sugar.cpp:130:2: note: in expansion of macro 'file'
  130 |  file("JOI22_sugar");
      |  ^~~~
sugar.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); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sugar.cpp:130:2: note: in expansion of macro 'file'
  130 |  file("JOI22_sugar");
      |  ^~~~

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 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 2 ms 856 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 2 ms 496 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 2 ms 1116 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 3 ms 956 KB Output is correct
19 Correct 2 ms 856 KB Output is correct
20 Correct 3 ms 1116 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 2 ms 1064 KB Output is correct
23 Correct 3 ms 724 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 2 ms 800 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 322 ms 41076 KB Output is correct
5 Correct 158 ms 34716 KB Output is correct
6 Correct 373 ms 46816 KB Output is correct
7 Correct 165 ms 34884 KB Output is correct
8 Correct 467 ms 54280 KB Output is correct
9 Correct 344 ms 72256 KB Output is correct
10 Correct 471 ms 54716 KB Output is correct
11 Correct 352 ms 72240 KB Output is correct
12 Correct 143 ms 30456 KB Output is correct
13 Correct 201 ms 42228 KB Output is correct
14 Correct 342 ms 68044 KB Output is correct
15 Correct 330 ms 67896 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 145 ms 26620 KB Output is correct
3 Correct 209 ms 37656 KB Output is correct
4 Correct 323 ms 58848 KB Output is correct
5 Correct 325 ms 58844 KB Output is correct
6 Correct 342 ms 41256 KB Output is correct
7 Correct 19 ms 4208 KB Output is correct
8 Correct 163 ms 22120 KB Output is correct
9 Correct 255 ms 32736 KB Output is correct
10 Correct 458 ms 58628 KB Output is correct
11 Correct 480 ms 59052 KB Output is correct
12 Correct 464 ms 59080 KB Output is correct
13 Correct 433 ms 58784 KB Output is correct
14 Correct 469 ms 59088 KB Output is correct
15 Correct 395 ms 58448 KB Output is correct
16 Correct 432 ms 58568 KB Output is correct
17 Correct 564 ms 58692 KB Output is correct
18 Correct 591 ms 58780 KB Output is correct
19 Correct 613 ms 58552 KB Output is correct
20 Correct 611 ms 58820 KB Output is correct
21 Correct 635 ms 58548 KB Output is correct
22 Correct 673 ms 58888 KB Output is correct
23 Correct 624 ms 58792 KB Output is correct
24 Correct 369 ms 58740 KB Output is correct
25 Correct 519 ms 58728 KB Output is correct

Subtask #4
52.0 / 52.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 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 2 ms 860 KB Output is correct
11 Correct 2 ms 860 KB Output is correct
12 Correct 2 ms 856 KB Output is correct
13 Correct 2 ms 860 KB Output is correct
14 Correct 2 ms 496 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 2 ms 1116 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 3 ms 956 KB Output is correct
19 Correct 2 ms 856 KB Output is correct
20 Correct 3 ms 1116 KB Output is correct
21 Correct 3 ms 860 KB Output is correct
22 Correct 2 ms 1064 KB Output is correct
23 Correct 3 ms 724 KB Output is correct
24 Correct 2 ms 1116 KB Output is correct
25 Correct 2 ms 800 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 322 ms 41076 KB Output is correct
30 Correct 158 ms 34716 KB Output is correct
31 Correct 373 ms 46816 KB Output is correct
32 Correct 165 ms 34884 KB Output is correct
33 Correct 467 ms 54280 KB Output is correct
34 Correct 344 ms 72256 KB Output is correct
35 Correct 471 ms 54716 KB Output is correct
36 Correct 352 ms 72240 KB Output is correct
37 Correct 143 ms 30456 KB Output is correct
38 Correct 201 ms 42228 KB Output is correct
39 Correct 342 ms 68044 KB Output is correct
40 Correct 330 ms 67896 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 145 ms 26620 KB Output is correct
43 Correct 209 ms 37656 KB Output is correct
44 Correct 323 ms 58848 KB Output is correct
45 Correct 325 ms 58844 KB Output is correct
46 Correct 342 ms 41256 KB Output is correct
47 Correct 19 ms 4208 KB Output is correct
48 Correct 163 ms 22120 KB Output is correct
49 Correct 255 ms 32736 KB Output is correct
50 Correct 458 ms 58628 KB Output is correct
51 Correct 480 ms 59052 KB Output is correct
52 Correct 464 ms 59080 KB Output is correct
53 Correct 433 ms 58784 KB Output is correct
54 Correct 469 ms 59088 KB Output is correct
55 Correct 395 ms 58448 KB Output is correct
56 Correct 432 ms 58568 KB Output is correct
57 Correct 564 ms 58692 KB Output is correct
58 Correct 591 ms 58780 KB Output is correct
59 Correct 613 ms 58552 KB Output is correct
60 Correct 611 ms 58820 KB Output is correct
61 Correct 635 ms 58548 KB Output is correct
62 Correct 673 ms 58888 KB Output is correct
63 Correct 624 ms 58792 KB Output is correct
64 Correct 369 ms 58740 KB Output is correct
65 Correct 519 ms 58728 KB Output is correct
66 Correct 250 ms 38864 KB Output is correct
67 Correct 300 ms 44932 KB Output is correct
68 Correct 391 ms 52104 KB Output is correct
69 Correct 347 ms 48856 KB Output is correct
70 Correct 403 ms 73000 KB Output is correct
71 Correct 455 ms 72996 KB Output is correct
72 Correct 501 ms 73220 KB Output is correct
73 Correct 489 ms 73308 KB Output is correct
74 Correct 120 ms 18104 KB Output is correct
75 Correct 195 ms 24308 KB Output is correct
76 Correct 520 ms 120408 KB Output is correct
77 Correct 503 ms 114168 KB Output is correct
78 Correct 512 ms 113856 KB Output is correct
79 Correct 507 ms 73428 KB Output is correct
80 Correct 495 ms 113860 KB Output is correct
81 Correct 496 ms 73172 KB Output is correct
82 Correct 512 ms 113960 KB Output is correct
83 Correct 683 ms 73544 KB Output is correct
84 Correct 506 ms 113992 KB Output is correct
85 Correct 746 ms 73752 KB Output is correct
86 Correct 514 ms 114488 KB Output is correct
87 Correct 710 ms 73460 KB Output is correct
88 Correct 505 ms 113864 KB Output is correct
89 Correct 593 ms 97860 KB Output is correct