oj.uz

Submission #794137

# Submission time Handle Problem Language Result Execution time Memory
794137 2023-07-26T09:45:14 Z ymm Food Court (JOI21_foodcourt) C++17
45 / 100
 701 ms 135580 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, int 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 848 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 2 ms 976 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 2 ms 980 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 1 ms 596 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 980 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 3 ms 980 KB Output is correct
19 Correct 2 ms 852 KB Output is correct
20 Correct 2 ms 980 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 848 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 2 ms 976 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 2 ms 980 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 1 ms 596 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 980 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 3 ms 980 KB Output is correct
19 Correct 2 ms 852 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Incorrect 2 ms 892 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 16772 KB Output is correct
2 Correct 78 ms 20344 KB Output is correct
3 Correct 74 ms 17432 KB Output is correct
4 Correct 72 ms 17296 KB Output is correct
5 Correct 90 ms 21248 KB Output is correct
6 Correct 77 ms 21236 KB Output is correct
7 Correct 16 ms 1732 KB Output is correct
8 Correct 16 ms 1788 KB Output is correct
9 Correct 72 ms 17608 KB Output is correct
10 Correct 74 ms 17620 KB Output is correct
11 Correct 72 ms 17672 KB Output is correct
12 Correct 87 ms 17716 KB Output is correct
13 Correct 63 ms 17176 KB Output is correct
14 Correct 85 ms 21332 KB Output is correct
15 Correct 78 ms 24556 KB Output is correct
16 Correct 83 ms 27632 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 513 ms 91540 KB Output is correct
2 Correct 434 ms 74416 KB Output is correct
3 Correct 550 ms 100964 KB Output is correct
4 Correct 429 ms 106404 KB Output is correct
5 Correct 408 ms 99272 KB Output is correct
6 Correct 638 ms 135580 KB Output is correct
7 Correct 62 ms 6688 KB Output is correct
8 Correct 67 ms 7292 KB Output is correct
9 Correct 701 ms 133280 KB Output is correct
10 Correct 600 ms 133588 KB Output is correct
11 Correct 501 ms 111228 KB Output is correct
12 Correct 561 ms 111264 KB Output is correct
13 Correct 537 ms 111192 KB Output is correct
14 Correct 539 ms 111236 KB Output is correct
15 Correct 527 ms 110924 KB Output is correct
16 Correct 579 ms 111176 KB Output is correct
17 Correct 535 ms 111120 KB Output is correct
18 Correct 559 ms 111152 KB Output is correct
19 Correct 598 ms 111180 KB Output is correct
20 Correct 526 ms 111196 KB Output is correct
21 Correct 555 ms 111044 KB Output is correct
22 Correct 547 ms 111160 KB Output is correct
23 Correct 579 ms 111572 KB Output is correct
24 Correct 550 ms 111088 KB Output is correct
25 Correct 301 ms 100916 KB Output is correct
26 Correct 305 ms 111140 KB Output is correct
27 Correct 493 ms 109492 KB Output is correct

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 848 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 2 ms 976 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 2 ms 980 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 1 ms 596 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 980 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 3 ms 980 KB Output is correct
19 Correct 2 ms 852 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Correct 70 ms 16772 KB Output is correct
22 Correct 78 ms 20344 KB Output is correct
23 Correct 74 ms 17432 KB Output is correct
24 Correct 72 ms 17296 KB Output is correct
25 Correct 90 ms 21248 KB Output is correct
26 Correct 77 ms 21236 KB Output is correct
27 Correct 16 ms 1732 KB Output is correct
28 Correct 16 ms 1788 KB Output is correct
29 Correct 72 ms 17608 KB Output is correct
30 Correct 74 ms 17620 KB Output is correct
31 Correct 72 ms 17672 KB Output is correct
32 Correct 87 ms 17716 KB Output is correct
33 Correct 63 ms 17176 KB Output is correct
34 Correct 85 ms 21332 KB Output is correct
35 Correct 78 ms 24556 KB Output is correct
36 Correct 83 ms 27632 KB Output is correct
37 Correct 89 ms 21588 KB Output is correct
38 Correct 80 ms 26420 KB Output is correct
39 Correct 12 ms 1496 KB Output is correct
40 Correct 14 ms 1788 KB Output is correct
41 Correct 99 ms 26548 KB Output is correct
42 Correct 96 ms 26636 KB Output is correct
43 Correct 96 ms 26444 KB Output is correct
44 Correct 95 ms 26448 KB Output is correct
45 Correct 95 ms 26564 KB Output is correct
46 Correct 112 ms 26488 KB Output is correct
47 Correct 25 ms 10072 KB Output is correct
48 Correct 75 ms 26632 KB Output is correct
49 Correct 69 ms 18784 KB Output is correct
50 Correct 90 ms 24196 KB Output is correct
51 Correct 101 ms 27096 KB Output is correct
52 Correct 105 ms 27140 KB Output is correct
53 Correct 67 ms 22556 KB Output is correct
54 Correct 80 ms 27652 KB Output is correct

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 92 ms 29052 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 848 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 2 ms 976 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 2 ms 980 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 1 ms 596 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 980 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 3 ms 980 KB Output is correct
19 Correct 2 ms 852 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Incorrect 2 ms 892 KB Output isn't correct
22 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 2 ms 848 KB Output is correct
3 Correct 2 ms 852 KB Output is correct
4 Correct 2 ms 976 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 2 ms 980 KB Output is correct
11 Correct 2 ms 980 KB Output is correct
12 Correct 2 ms 980 KB Output is correct
13 Correct 1 ms 596 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 980 KB Output is correct
17 Correct 2 ms 724 KB Output is correct
18 Correct 3 ms 980 KB Output is correct
19 Correct 2 ms 852 KB Output is correct
20 Correct 2 ms 980 KB Output is correct
21 Incorrect 2 ms 892 KB Output isn't correct
22 Halted 0 ms 0 KB -