oj.uz

Submission #794145

# Submission time Handle Problem Language Result Execution time Memory
794145 2023-07-26T09:50:41 Z ymm Food Court (JOI21_foodcourt) C++17
68 / 100
 1000 ms 129300 KB 
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
//typedef std::pair<int,int> pii;
typedef std::pair<ll,ll> pll;
using namespace std;

const int N = 250'010;
const ll inf = 1e18;

namespace beats {
	struct node {
		ll lzyadd, lzyaddmn;
		ll mn, mn2;
	} t[4*N];
	int sz;

	void up(int i, ll add, ll addmn) {
		t[i].lzyadd += add;
		t[i].mn += add;
		t[i].mn2 += add;
		t[i].lzyaddmn += addmn;
		t[i].mn += addmn;
	}
	void ppg(int i) {
		up(2*i+1, t[i].lzyadd, t[2*i+1].mn + t[i].lzyadd + t[i].lzyaddmn == t[i].mn? t[i].lzyaddmn: 0);
		up(2*i+2, t[i].lzyadd, t[2*i+2].mn + t[i].lzyadd + t[i].lzyaddmn == t[i].mn? t[i].lzyaddmn: 0);
		t[i].lzyadd = 0;
		t[i].lzyaddmn = 0;
	}
	void merge(int i) {
		node &v = t[i], &l = t[2*i+1], &r = t[2*i+2];
		v.mn = min(l.mn, r.mn);
		if (l.mn < r.mn)
			v.mn2 = min(l.mn2, r.mn);
		if (l.mn > r.mn)
			v.mn2 = min(l.mn, r.mn2);
		if (l.mn == r.mn)
			v.mn2 = min(l.mn2, r.mn2);
	}
	void init(int n) {
		sz = n;
		Loop (i,0,4*sz) {
			t[i].lzyadd = 0;
			t[i].lzyaddmn = 0;
			t[i].mn = 0;
			t[i].mn2 = inf;
		}
	}
	void add(int l, int r, ll x, int i, int b, int e) {
		if (l <= b && e <= r) {
			up(i, x, 0);
			return;
		}
		if (r <= b || e <= l)
			return;
		ppg(i);
		add(l, r, x, 2*i+1, b, (b+e)/2);
		add(l, r, x, 2*i+2, (b+e)/2, e);
		merge(i);
	}

	void mvup(int i, int b, int e) {
		if (t[i].mn >= 0)
			return;
		if (t[i].mn2 > 0) {
			up(i, 0, -t[i].mn);
			return;
		}
		ppg(i);
		mvup(2*i+1, b, (b+e)/2);
		mvup(2*i+2, (b+e)/2, e);
		merge(i);
	}

	void add(int l, int r, ll x) {
		add(l, r, x, 0, 0, sz);
		mvup(0, 0, sz);
	}

	ll get(int p, int i, int b, int e) {
		if (e-b == 1)
			return t[i].mn;
		ppg(i);
		if (p < (b+e)/2)
			return get(p, 2*i+1, b, (b+e)/2);
		else
			return get(p, 2*i+2, (b+e)/2, e);
	}
	ll get(int p) { return get(p, 0, 0, sz); }
}

namespace seg {
	struct node {
		ll cnt;
		int l, r;
	} nd[(1<<28)/sizeof(node)];
	int nxt = 1;
	vector<pair<int,int>> rts;
	int sz;

	void init(int n) {
		sz = n;
		rts = {{0,-1}};
	}
	int add(int t, int l, int r, ll x, int b, int e) {
		int ans = nxt++;
		if (l <= b && e <= r) {
			nd[ans].cnt = nd[t].cnt + x;
			nd[ans].l = nd[t].l;
			nd[ans].r = nd[t].r;
			return ans;
		}
		nd[ans] = nd[t];
		if (l < (b+e)/2)
			nd[ans].l = add(nd[t].l, l, r, x, b, (b+e)/2);
		if ((b+e)/2 < r)
			nd[ans].r = add(nd[t].r, l, r, x, (b+e)/2, e);
		return ans;
	}
	ll get(int t, int p, int b, int e) {
		if (!t)
			return 0;
		if (e-b == 1)
			return nd[t].cnt;
		if (p < (b+e)/2)
			return nd[t].cnt + get(nd[t].l, p, b, (b+e)/2);
		else
			return nd[t].cnt + get(nd[t].r, p, (b+e)/2, e);
	}
	void add(int l, int r, ll x, int c) {
		int rt = rts.back().first;
		int rt2 = add(rt, l, r, x, 0, sz);
		rts.push_back({rt2, c});
	}
	ll get(int p) { return get(rts.back().first, p, 0, sz); }
	int bin(int p, ll i) {
		int l = 1, r = rts.size()-1;
		while (l < r) {
			int m = (l+r)/2;
			if (get(rts[m].first, p, 0, sz) > i)
				r = m;
			else
				l = m+1;
		}
		return rts[l].second;
	}
}

int main()
{
	cin.tie(0) -> sync_with_stdio(false);
	int n, m, q;
	cin >> n >> m >> q;
	seg::init(n);
	beats::init(n);
	Loop (i,0,q) {
		int t;
		cin >> t;
		if (t == 1) {
			int l, r, c, k;
			cin >> l >> r >> c >> k;
			--l;
			seg::add(l, r, k, c);
			beats::add(l, r, k);
		}
		if (t == 2) {
			int l, r, k;
			cin >> l >> r >> k;
			--l;
			beats::add(l, r, -k);
		}
		if (t == 3) {
			ll a, b;
			cin >> a >> b;
			--a; --b;
			ll cur = beats::get(a);
			ll tot = seg::get(a);
			b += tot - cur;
			if (b >= tot)
				cout << "0\n";
			else
				cout << seg::bin(a, b) << '\n';
		}
	}
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 2 ms 896 KB Output is correct
12 Correct 2 ms 852 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 2 ms 852 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 852 KB Output is correct
19 Correct 2 ms 852 KB Output is correct
20 Correct 2 ms 980 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 2 ms 896 KB Output is correct
12 Correct 2 ms 852 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 2 ms 852 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 852 KB Output is correct
19 Correct 2 ms 852 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 2 ms 852 KB Output is correct
23 Correct 2 ms 852 KB Output is correct
24 Correct 2 ms 980 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 852 KB Output is correct
28 Correct 3 ms 956 KB Output is correct
29 Correct 3 ms 824 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 2 ms 852 KB Output is correct
32 Correct 2 ms 852 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 596 KB Output is correct
35 Correct 2 ms 852 KB Output is correct
36 Correct 2 ms 852 KB Output is correct
37 Correct 1 ms 724 KB Output is correct
38 Correct 2 ms 980 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 15592 KB Output is correct
2 Correct 79 ms 19152 KB Output is correct
3 Correct 71 ms 16168 KB Output is correct
4 Correct 73 ms 16152 KB Output is correct
5 Correct 75 ms 20044 KB Output is correct
6 Correct 79 ms 19980 KB Output is correct
7 Correct 14 ms 1032 KB Output is correct
8 Correct 15 ms 984 KB Output is correct
9 Correct 74 ms 16384 KB Output is correct
10 Correct 78 ms 16360 KB Output is correct
11 Correct 75 ms 16396 KB Output is correct
12 Correct 78 ms 16396 KB Output is correct
13 Correct 62 ms 16108 KB Output is correct
14 Correct 76 ms 20280 KB Output is correct
15 Correct 76 ms 23296 KB Output is correct
16 Correct 80 ms 26244 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 505 ms 86052 KB Output is correct
2 Correct 382 ms 70144 KB Output is correct
3 Correct 568 ms 95052 KB Output is correct
4 Correct 483 ms 101868 KB Output is correct
5 Correct 503 ms 94768 KB Output is correct
6 Correct 777 ms 129300 KB Output is correct
7 Correct 65 ms 2636 KB Output is correct
8 Correct 74 ms 3196 KB Output is correct
9 Execution timed out 1012 ms 127332 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 2 ms 896 KB Output is correct
12 Correct 2 ms 852 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 2 ms 852 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 852 KB Output is correct
19 Correct 2 ms 852 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 69 ms 15592 KB Output is correct
22 Correct 79 ms 19152 KB Output is correct
23 Correct 71 ms 16168 KB Output is correct
24 Correct 73 ms 16152 KB Output is correct
25 Correct 75 ms 20044 KB Output is correct
26 Correct 79 ms 19980 KB Output is correct
27 Correct 14 ms 1032 KB Output is correct
28 Correct 15 ms 984 KB Output is correct
29 Correct 74 ms 16384 KB Output is correct
30 Correct 78 ms 16360 KB Output is correct
31 Correct 75 ms 16396 KB Output is correct
32 Correct 78 ms 16396 KB Output is correct
33 Correct 62 ms 16108 KB Output is correct
34 Correct 76 ms 20280 KB Output is correct
35 Correct 76 ms 23296 KB Output is correct
36 Correct 80 ms 26244 KB Output is correct
37 Correct 79 ms 20636 KB Output is correct
38 Correct 89 ms 25588 KB Output is correct
39 Correct 12 ms 1052 KB Output is correct
40 Correct 18 ms 1240 KB Output is correct
41 Correct 99 ms 25444 KB Output is correct
42 Correct 93 ms 25424 KB Output is correct
43 Correct 94 ms 25392 KB Output is correct
44 Correct 122 ms 25428 KB Output is correct
45 Correct 117 ms 25408 KB Output is correct
46 Correct 124 ms 25432 KB Output is correct
47 Correct 24 ms 9176 KB Output is correct
48 Correct 73 ms 25708 KB Output is correct
49 Correct 68 ms 18104 KB Output is correct
50 Correct 89 ms 23232 KB Output is correct
51 Correct 104 ms 26088 KB Output is correct
52 Correct 144 ms 26076 KB Output is correct
53 Correct 59 ms 21328 KB Output is correct
54 Correct 76 ms 26280 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 110 ms 27632 KB Output is correct
2 Correct 140 ms 28432 KB Output is correct
3 Correct 129 ms 30416 KB Output is correct
4 Correct 81 ms 23892 KB Output is correct
5 Correct 120 ms 27736 KB Output is correct
6 Correct 138 ms 31036 KB Output is correct
7 Correct 18 ms 1256 KB Output is correct
8 Correct 18 ms 1440 KB Output is correct
9 Correct 34 ms 9496 KB Output is correct
10 Correct 55 ms 25296 KB Output is correct
11 Correct 94 ms 34420 KB Output is correct
12 Correct 84 ms 34376 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 2 ms 896 KB Output is correct
12 Correct 2 ms 852 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 2 ms 852 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 852 KB Output is correct
19 Correct 2 ms 852 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 2 ms 852 KB Output is correct
23 Correct 2 ms 852 KB Output is correct
24 Correct 2 ms 980 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 852 KB Output is correct
28 Correct 3 ms 956 KB Output is correct
29 Correct 3 ms 824 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 2 ms 852 KB Output is correct
32 Correct 2 ms 852 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 596 KB Output is correct
35 Correct 2 ms 852 KB Output is correct
36 Correct 2 ms 852 KB Output is correct
37 Correct 1 ms 724 KB Output is correct
38 Correct 2 ms 980 KB Output is correct
39 Correct 69 ms 15592 KB Output is correct
40 Correct 79 ms 19152 KB Output is correct
41 Correct 71 ms 16168 KB Output is correct
42 Correct 73 ms 16152 KB Output is correct
43 Correct 75 ms 20044 KB Output is correct
44 Correct 79 ms 19980 KB Output is correct
45 Correct 14 ms 1032 KB Output is correct
46 Correct 15 ms 984 KB Output is correct
47 Correct 74 ms 16384 KB Output is correct
48 Correct 78 ms 16360 KB Output is correct
49 Correct 75 ms 16396 KB Output is correct
50 Correct 78 ms 16396 KB Output is correct
51 Correct 62 ms 16108 KB Output is correct
52 Correct 76 ms 20280 KB Output is correct
53 Correct 76 ms 23296 KB Output is correct
54 Correct 80 ms 26244 KB Output is correct
55 Correct 79 ms 20636 KB Output is correct
56 Correct 89 ms 25588 KB Output is correct
57 Correct 12 ms 1052 KB Output is correct
58 Correct 18 ms 1240 KB Output is correct
59 Correct 99 ms 25444 KB Output is correct
60 Correct 93 ms 25424 KB Output is correct
61 Correct 94 ms 25392 KB Output is correct
62 Correct 122 ms 25428 KB Output is correct
63 Correct 117 ms 25408 KB Output is correct
64 Correct 124 ms 25432 KB Output is correct
65 Correct 24 ms 9176 KB Output is correct
66 Correct 73 ms 25708 KB Output is correct
67 Correct 68 ms 18104 KB Output is correct
68 Correct 89 ms 23232 KB Output is correct
69 Correct 104 ms 26088 KB Output is correct
70 Correct 144 ms 26076 KB Output is correct
71 Correct 59 ms 21328 KB Output is correct
72 Correct 76 ms 26280 KB Output is correct
73 Correct 110 ms 27632 KB Output is correct
74 Correct 140 ms 28432 KB Output is correct
75 Correct 129 ms 30416 KB Output is correct
76 Correct 81 ms 23892 KB Output is correct
77 Correct 120 ms 27736 KB Output is correct
78 Correct 138 ms 31036 KB Output is correct
79 Correct 18 ms 1256 KB Output is correct
80 Correct 18 ms 1440 KB Output is correct
81 Correct 34 ms 9496 KB Output is correct
82 Correct 55 ms 25296 KB Output is correct
83 Correct 94 ms 34420 KB Output is correct
84 Correct 84 ms 34376 KB Output is correct
85 Correct 82 ms 19664 KB Output is correct
86 Correct 92 ms 23188 KB Output is correct
87 Correct 96 ms 27660 KB Output is correct
88 Correct 120 ms 30936 KB Output is correct
89 Correct 80 ms 18052 KB Output is correct
90 Correct 95 ms 25428 KB Output is correct
91 Correct 72 ms 19304 KB Output is correct
92 Correct 70 ms 18640 KB Output is correct
93 Correct 91 ms 25440 KB Output is correct
94 Correct 97 ms 25424 KB Output is correct
95 Correct 86 ms 24244 KB Output is correct
96 Correct 95 ms 25532 KB Output is correct
97 Correct 98 ms 25500 KB Output is correct
98 Correct 77 ms 20316 KB Output is correct
99 Correct 27 ms 9236 KB Output is correct
100 Correct 56 ms 21840 KB Output is correct
101 Correct 69 ms 25576 KB Output is correct
102 Correct 89 ms 25372 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 852 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 2 ms 980 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 2 ms 852 KB Output is correct
9 Correct 2 ms 852 KB Output is correct
10 Correct 3 ms 852 KB Output is correct
11 Correct 2 ms 896 KB Output is correct
12 Correct 2 ms 852 KB Output is correct
13 Correct 1 ms 468 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 852 KB Output is correct
16 Correct 2 ms 852 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 2 ms 852 KB Output is correct
19 Correct 2 ms 852 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 2 ms 852 KB Output is correct
22 Correct 2 ms 852 KB Output is correct
23 Correct 2 ms 852 KB Output is correct
24 Correct 2 ms 980 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 2 ms 852 KB Output is correct
28 Correct 3 ms 956 KB Output is correct
29 Correct 3 ms 824 KB Output is correct
30 Correct 2 ms 852 KB Output is correct
31 Correct 2 ms 852 KB Output is correct
32 Correct 2 ms 852 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 596 KB Output is correct
35 Correct 2 ms 852 KB Output is correct
36 Correct 2 ms 852 KB Output is correct
37 Correct 1 ms 724 KB Output is correct
38 Correct 2 ms 980 KB Output is correct
39 Correct 69 ms 15592 KB Output is correct
40 Correct 79 ms 19152 KB Output is correct
41 Correct 71 ms 16168 KB Output is correct
42 Correct 73 ms 16152 KB Output is correct
43 Correct 75 ms 20044 KB Output is correct
44 Correct 79 ms 19980 KB Output is correct
45 Correct 14 ms 1032 KB Output is correct
46 Correct 15 ms 984 KB Output is correct
47 Correct 74 ms 16384 KB Output is correct
48 Correct 78 ms 16360 KB Output is correct
49 Correct 75 ms 16396 KB Output is correct
50 Correct 78 ms 16396 KB Output is correct
51 Correct 62 ms 16108 KB Output is correct
52 Correct 76 ms 20280 KB Output is correct
53 Correct 76 ms 23296 KB Output is correct
54 Correct 80 ms 26244 KB Output is correct
55 Correct 505 ms 86052 KB Output is correct
56 Correct 382 ms 70144 KB Output is correct
57 Correct 568 ms 95052 KB Output is correct
58 Correct 483 ms 101868 KB Output is correct
59 Correct 503 ms 94768 KB Output is correct
60 Correct 777 ms 129300 KB Output is correct
61 Correct 65 ms 2636 KB Output is correct
62 Correct 74 ms 3196 KB Output is correct
63 Execution timed out 1012 ms 127332 KB Time limit exceeded
64 Halted 0 ms 0 KB -