oj.uz

Submission #794143

# Submission time Handle Problem Language Result Execution time Memory
794143 2023-07-26T09:48:00 Z ymm Food Court (JOI21_foodcourt) C++17
68 / 100
 1000 ms 178612 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;

#define int ll

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;
	}
}

signed 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 852 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 1236 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 1108 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 2 ms 1108 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 980 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 2 ms 852 KB Output is correct
18 Correct 3 ms 1108 KB Output is correct
19 Correct 2 ms 1108 KB Output is correct
20 Correct 2 ms 1236 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 852 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 1236 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 1108 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 2 ms 1108 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 980 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 2 ms 852 KB Output is correct
18 Correct 3 ms 1108 KB Output is correct
19 Correct 2 ms 1108 KB Output is correct
20 Correct 2 ms 1236 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 3 ms 1108 KB Output is correct
24 Correct 2 ms 1240 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 4 ms 1108 KB Output is correct
28 Correct 3 ms 1108 KB Output is correct
29 Correct 2 ms 1108 KB Output is correct
30 Correct 2 ms 1108 KB Output is correct
31 Correct 3 ms 1108 KB Output is correct
32 Correct 3 ms 1108 KB Output is correct
33 Correct 1 ms 592 KB Output is correct
34 Correct 1 ms 628 KB Output is correct
35 Correct 2 ms 980 KB Output is correct
36 Correct 2 ms 1100 KB Output is correct
37 Correct 2 ms 980 KB Output is correct
38 Correct 2 ms 1236 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 72 ms 19116 KB Output is correct
2 Correct 84 ms 24532 KB Output is correct
3 Correct 80 ms 20080 KB Output is correct
4 Correct 75 ms 19976 KB Output is correct
5 Correct 89 ms 25932 KB Output is correct
6 Correct 81 ms 25888 KB Output is correct
7 Correct 13 ms 1368 KB Output is correct
8 Correct 14 ms 1368 KB Output is correct
9 Correct 76 ms 20380 KB Output is correct
10 Correct 84 ms 20392 KB Output is correct
11 Correct 99 ms 20476 KB Output is correct
12 Correct 75 ms 20548 KB Output is correct
13 Correct 91 ms 21448 KB Output is correct
14 Correct 84 ms 26220 KB Output is correct
15 Correct 100 ms 32132 KB Output is correct
16 Correct 85 ms 35444 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 547 ms 115136 KB Output is correct
2 Correct 445 ms 92924 KB Output is correct
3 Correct 632 ms 127112 KB Output is correct
4 Correct 658 ms 137412 KB Output is correct
5 Correct 628 ms 130448 KB Output is correct
6 Correct 979 ms 178612 KB Output is correct
7 Correct 64 ms 4164 KB Output is correct
8 Correct 68 ms 4884 KB Output is correct
9 Execution timed out 1086 ms 161728 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 852 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 1236 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 1108 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 2 ms 1108 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 980 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 2 ms 852 KB Output is correct
18 Correct 3 ms 1108 KB Output is correct
19 Correct 2 ms 1108 KB Output is correct
20 Correct 2 ms 1236 KB Output is correct
21 Correct 72 ms 19116 KB Output is correct
22 Correct 84 ms 24532 KB Output is correct
23 Correct 80 ms 20080 KB Output is correct
24 Correct 75 ms 19976 KB Output is correct
25 Correct 89 ms 25932 KB Output is correct
26 Correct 81 ms 25888 KB Output is correct
27 Correct 13 ms 1368 KB Output is correct
28 Correct 14 ms 1368 KB Output is correct
29 Correct 76 ms 20380 KB Output is correct
30 Correct 84 ms 20392 KB Output is correct
31 Correct 99 ms 20476 KB Output is correct
32 Correct 75 ms 20548 KB Output is correct
33 Correct 91 ms 21448 KB Output is correct
34 Correct 84 ms 26220 KB Output is correct
35 Correct 100 ms 32132 KB Output is correct
36 Correct 85 ms 35444 KB Output is correct
37 Correct 92 ms 26956 KB Output is correct
38 Correct 98 ms 34504 KB Output is correct
39 Correct 12 ms 1368 KB Output is correct
40 Correct 15 ms 1636 KB Output is correct
41 Correct 165 ms 33916 KB Output is correct
42 Correct 115 ms 33960 KB Output is correct
43 Correct 121 ms 33788 KB Output is correct
44 Correct 141 ms 33868 KB Output is correct
45 Correct 116 ms 33996 KB Output is correct
46 Correct 114 ms 33992 KB Output is correct
47 Correct 32 ms 9560 KB Output is correct
48 Correct 72 ms 34336 KB Output is correct
49 Correct 82 ms 24112 KB Output is correct
50 Correct 129 ms 30708 KB Output is correct
51 Correct 122 ms 34944 KB Output is correct
52 Correct 132 ms 34892 KB Output is correct
53 Correct 66 ms 28472 KB Output is correct
54 Correct 91 ms 35408 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 232 ms 37324 KB Output is correct
2 Correct 166 ms 40628 KB Output is correct
3 Correct 170 ms 42936 KB Output is correct
4 Correct 149 ms 33096 KB Output is correct
5 Correct 187 ms 38764 KB Output is correct
6 Correct 170 ms 44096 KB Output is correct
7 Correct 19 ms 2892 KB Output is correct
8 Correct 19 ms 2964 KB Output is correct
9 Correct 41 ms 11632 KB Output is correct
10 Correct 65 ms 35200 KB Output is correct
11 Correct 117 ms 48996 KB Output is correct
12 Correct 108 ms 48880 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 852 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 1236 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 1108 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 2 ms 1108 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 980 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 2 ms 852 KB Output is correct
18 Correct 3 ms 1108 KB Output is correct
19 Correct 2 ms 1108 KB Output is correct
20 Correct 2 ms 1236 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 3 ms 1108 KB Output is correct
24 Correct 2 ms 1240 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 4 ms 1108 KB Output is correct
28 Correct 3 ms 1108 KB Output is correct
29 Correct 2 ms 1108 KB Output is correct
30 Correct 2 ms 1108 KB Output is correct
31 Correct 3 ms 1108 KB Output is correct
32 Correct 3 ms 1108 KB Output is correct
33 Correct 1 ms 592 KB Output is correct
34 Correct 1 ms 628 KB Output is correct
35 Correct 2 ms 980 KB Output is correct
36 Correct 2 ms 1100 KB Output is correct
37 Correct 2 ms 980 KB Output is correct
38 Correct 2 ms 1236 KB Output is correct
39 Correct 72 ms 19116 KB Output is correct
40 Correct 84 ms 24532 KB Output is correct
41 Correct 80 ms 20080 KB Output is correct
42 Correct 75 ms 19976 KB Output is correct
43 Correct 89 ms 25932 KB Output is correct
44 Correct 81 ms 25888 KB Output is correct
45 Correct 13 ms 1368 KB Output is correct
46 Correct 14 ms 1368 KB Output is correct
47 Correct 76 ms 20380 KB Output is correct
48 Correct 84 ms 20392 KB Output is correct
49 Correct 99 ms 20476 KB Output is correct
50 Correct 75 ms 20548 KB Output is correct
51 Correct 91 ms 21448 KB Output is correct
52 Correct 84 ms 26220 KB Output is correct
53 Correct 100 ms 32132 KB Output is correct
54 Correct 85 ms 35444 KB Output is correct
55 Correct 92 ms 26956 KB Output is correct
56 Correct 98 ms 34504 KB Output is correct
57 Correct 12 ms 1368 KB Output is correct
58 Correct 15 ms 1636 KB Output is correct
59 Correct 165 ms 33916 KB Output is correct
60 Correct 115 ms 33960 KB Output is correct
61 Correct 121 ms 33788 KB Output is correct
62 Correct 141 ms 33868 KB Output is correct
63 Correct 116 ms 33996 KB Output is correct
64 Correct 114 ms 33992 KB Output is correct
65 Correct 32 ms 9560 KB Output is correct
66 Correct 72 ms 34336 KB Output is correct
67 Correct 82 ms 24112 KB Output is correct
68 Correct 129 ms 30708 KB Output is correct
69 Correct 122 ms 34944 KB Output is correct
70 Correct 132 ms 34892 KB Output is correct
71 Correct 66 ms 28472 KB Output is correct
72 Correct 91 ms 35408 KB Output is correct
73 Correct 232 ms 37324 KB Output is correct
74 Correct 166 ms 40628 KB Output is correct
75 Correct 170 ms 42936 KB Output is correct
76 Correct 149 ms 33096 KB Output is correct
77 Correct 187 ms 38764 KB Output is correct
78 Correct 170 ms 44096 KB Output is correct
79 Correct 19 ms 2892 KB Output is correct
80 Correct 19 ms 2964 KB Output is correct
81 Correct 41 ms 11632 KB Output is correct
82 Correct 65 ms 35200 KB Output is correct
83 Correct 117 ms 48996 KB Output is correct
84 Correct 108 ms 48880 KB Output is correct
85 Correct 91 ms 27608 KB Output is correct
86 Correct 110 ms 31988 KB Output is correct
87 Correct 152 ms 38900 KB Output is correct
88 Correct 148 ms 43968 KB Output is correct
89 Correct 73 ms 24540 KB Output is correct
90 Correct 150 ms 35660 KB Output is correct
91 Correct 84 ms 27456 KB Output is correct
92 Correct 87 ms 26188 KB Output is correct
93 Correct 104 ms 35436 KB Output is correct
94 Correct 127 ms 35540 KB Output is correct
95 Correct 106 ms 34124 KB Output is correct
96 Correct 108 ms 35816 KB Output is correct
97 Correct 116 ms 35564 KB Output is correct
98 Correct 85 ms 28680 KB Output is correct
99 Correct 29 ms 10912 KB Output is correct
100 Correct 64 ms 30288 KB Output is correct
101 Correct 77 ms 35620 KB Output is correct
102 Correct 103 ms 35524 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 852 KB Output is correct
2 Correct 2 ms 980 KB Output is correct
3 Correct 2 ms 980 KB Output is correct
4 Correct 2 ms 1236 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 1108 KB Output is correct
8 Correct 3 ms 1108 KB Output is correct
9 Correct 3 ms 1108 KB Output is correct
10 Correct 2 ms 1108 KB Output is correct
11 Correct 2 ms 1108 KB Output is correct
12 Correct 2 ms 1108 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 980 KB Output is correct
16 Correct 2 ms 1108 KB Output is correct
17 Correct 2 ms 852 KB Output is correct
18 Correct 3 ms 1108 KB Output is correct
19 Correct 2 ms 1108 KB Output is correct
20 Correct 2 ms 1236 KB Output is correct
21 Correct 2 ms 980 KB Output is correct
22 Correct 2 ms 980 KB Output is correct
23 Correct 3 ms 1108 KB Output is correct
24 Correct 2 ms 1240 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 4 ms 1108 KB Output is correct
28 Correct 3 ms 1108 KB Output is correct
29 Correct 2 ms 1108 KB Output is correct
30 Correct 2 ms 1108 KB Output is correct
31 Correct 3 ms 1108 KB Output is correct
32 Correct 3 ms 1108 KB Output is correct
33 Correct 1 ms 592 KB Output is correct
34 Correct 1 ms 628 KB Output is correct
35 Correct 2 ms 980 KB Output is correct
36 Correct 2 ms 1100 KB Output is correct
37 Correct 2 ms 980 KB Output is correct
38 Correct 2 ms 1236 KB Output is correct
39 Correct 72 ms 19116 KB Output is correct
40 Correct 84 ms 24532 KB Output is correct
41 Correct 80 ms 20080 KB Output is correct
42 Correct 75 ms 19976 KB Output is correct
43 Correct 89 ms 25932 KB Output is correct
44 Correct 81 ms 25888 KB Output is correct
45 Correct 13 ms 1368 KB Output is correct
46 Correct 14 ms 1368 KB Output is correct
47 Correct 76 ms 20380 KB Output is correct
48 Correct 84 ms 20392 KB Output is correct
49 Correct 99 ms 20476 KB Output is correct
50 Correct 75 ms 20548 KB Output is correct
51 Correct 91 ms 21448 KB Output is correct
52 Correct 84 ms 26220 KB Output is correct
53 Correct 100 ms 32132 KB Output is correct
54 Correct 85 ms 35444 KB Output is correct
55 Correct 547 ms 115136 KB Output is correct
56 Correct 445 ms 92924 KB Output is correct
57 Correct 632 ms 127112 KB Output is correct
58 Correct 658 ms 137412 KB Output is correct
59 Correct 628 ms 130448 KB Output is correct
60 Correct 979 ms 178612 KB Output is correct
61 Correct 64 ms 4164 KB Output is correct
62 Correct 68 ms 4884 KB Output is correct
63 Execution timed out 1086 ms 161728 KB Time limit exceeded
64 Halted 0 ms 0 KB -