oj.uz

답안 #794161

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
794161 2023-07-26T10:04:20 Z ymm 푸드 코트 (JOI21_foodcourt) C++17
68 / 100
 1000 ms 226068 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, cachev;
		int l, r;
		int cache;
	} 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];
		nd[ans].cache = 0;
		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 (nd[t].cache == p+1)
			return nd[t].cachev;
		ll ans;
		if (p < (b+e)/2)
			ans = nd[t].cnt + get(nd[t].l, p, b, (b+e)/2);
		else
			ans = nd[t].cnt + get(nd[t].r, p, (b+e)/2, e);
		nd[t].cachev = ans;
		nd[t].cache = p+1;
		return ans;
	}
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 852 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 2 ms 1364 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 1236 KB Output is correct
8 Correct 2 ms 1236 KB Output is correct
9 Correct 2 ms 1236 KB Output is correct
10 Correct 2 ms 1236 KB Output is correct
11 Correct 2 ms 1264 KB Output is correct
12 Correct 2 ms 1236 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 1108 KB Output is correct
16 Correct 2 ms 1236 KB Output is correct
17 Correct 2 ms 980 KB Output is correct
18 Correct 3 ms 1236 KB Output is correct
19 Correct 2 ms 1236 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 852 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 2 ms 1364 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 1236 KB Output is correct
8 Correct 2 ms 1236 KB Output is correct
9 Correct 2 ms 1236 KB Output is correct
10 Correct 2 ms 1236 KB Output is correct
11 Correct 2 ms 1264 KB Output is correct
12 Correct 2 ms 1236 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 1108 KB Output is correct
16 Correct 2 ms 1236 KB Output is correct
17 Correct 2 ms 980 KB Output is correct
18 Correct 3 ms 1236 KB Output is correct
19 Correct 2 ms 1236 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct
21 Correct 3 ms 1124 KB Output is correct
22 Correct 2 ms 1108 KB Output is correct
23 Correct 2 ms 1236 KB Output is correct
24 Correct 2 ms 1364 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 388 KB Output is correct
27 Correct 2 ms 1236 KB Output is correct
28 Correct 2 ms 1236 KB Output is correct
29 Correct 2 ms 1236 KB Output is correct
30 Correct 2 ms 1236 KB Output is correct
31 Correct 3 ms 1236 KB Output is correct
32 Correct 3 ms 1236 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 1108 KB Output is correct
36 Correct 2 ms 1236 KB Output is correct
37 Correct 2 ms 1108 KB Output is correct
38 Correct 2 ms 1364 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 22340 KB Output is correct
2 Correct 88 ms 29440 KB Output is correct
3 Correct 97 ms 23776 KB Output is correct
4 Correct 77 ms 23504 KB Output is correct
5 Correct 83 ms 31336 KB Output is correct
6 Correct 87 ms 31224 KB Output is correct
7 Correct 14 ms 1240 KB Output is correct
8 Correct 15 ms 1396 KB Output is correct
9 Correct 74 ms 24040 KB Output is correct
10 Correct 78 ms 24080 KB Output is correct
11 Correct 87 ms 24096 KB Output is correct
12 Correct 78 ms 24144 KB Output is correct
13 Correct 72 ms 26084 KB Output is correct
14 Correct 85 ms 31504 KB Output is correct
15 Correct 96 ms 40156 KB Output is correct
16 Correct 94 ms 43604 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 628 ms 142940 KB Output is correct
2 Correct 469 ms 114884 KB Output is correct
3 Correct 698 ms 157680 KB Output is correct
4 Correct 617 ms 171592 KB Output is correct
5 Correct 608 ms 164780 KB Output is correct
6 Correct 946 ms 226068 KB Output is correct
7 Correct 63 ms 3808 KB Output is correct
8 Correct 72 ms 5192 KB Output is correct
9 Execution timed out 1102 ms 201668 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 852 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 2 ms 1364 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 1236 KB Output is correct
8 Correct 2 ms 1236 KB Output is correct
9 Correct 2 ms 1236 KB Output is correct
10 Correct 2 ms 1236 KB Output is correct
11 Correct 2 ms 1264 KB Output is correct
12 Correct 2 ms 1236 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 1108 KB Output is correct
16 Correct 2 ms 1236 KB Output is correct
17 Correct 2 ms 980 KB Output is correct
18 Correct 3 ms 1236 KB Output is correct
19 Correct 2 ms 1236 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct
21 Correct 74 ms 22340 KB Output is correct
22 Correct 88 ms 29440 KB Output is correct
23 Correct 97 ms 23776 KB Output is correct
24 Correct 77 ms 23504 KB Output is correct
25 Correct 83 ms 31336 KB Output is correct
26 Correct 87 ms 31224 KB Output is correct
27 Correct 14 ms 1240 KB Output is correct
28 Correct 15 ms 1396 KB Output is correct
29 Correct 74 ms 24040 KB Output is correct
30 Correct 78 ms 24080 KB Output is correct
31 Correct 87 ms 24096 KB Output is correct
32 Correct 78 ms 24144 KB Output is correct
33 Correct 72 ms 26084 KB Output is correct
34 Correct 85 ms 31504 KB Output is correct
35 Correct 96 ms 40156 KB Output is correct
36 Correct 94 ms 43604 KB Output is correct
37 Correct 100 ms 33184 KB Output is correct
38 Correct 106 ms 43120 KB Output is correct
39 Correct 12 ms 1288 KB Output is correct
40 Correct 15 ms 1724 KB Output is correct
41 Correct 128 ms 41996 KB Output is correct
42 Correct 125 ms 42172 KB Output is correct
43 Correct 112 ms 41868 KB Output is correct
44 Correct 123 ms 41968 KB Output is correct
45 Correct 126 ms 42108 KB Output is correct
46 Correct 111 ms 42048 KB Output is correct
47 Correct 24 ms 9560 KB Output is correct
48 Correct 74 ms 42608 KB Output is correct
49 Correct 90 ms 29796 KB Output is correct
50 Correct 101 ms 37796 KB Output is correct
51 Correct 119 ms 43320 KB Output is correct
52 Correct 131 ms 43168 KB Output is correct
53 Correct 74 ms 34932 KB Output is correct
54 Correct 88 ms 43648 KB Output is correct

Subtask #6
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 175 ms 46548 KB Output is correct
2 Correct 179 ms 49232 KB Output is correct
3 Correct 212 ms 51768 KB Output is correct
4 Correct 130 ms 39516 KB Output is correct
5 Correct 162 ms 46600 KB Output is correct
6 Correct 206 ms 53212 KB Output is correct
7 Correct 19 ms 1756 KB Output is correct
8 Correct 20 ms 2088 KB Output is correct
9 Correct 34 ms 10052 KB Output is correct
10 Correct 69 ms 42576 KB Output is correct
11 Correct 117 ms 59956 KB Output is correct
12 Correct 110 ms 59748 KB Output is correct

Subtask #7
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 852 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 2 ms 1364 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 1236 KB Output is correct
8 Correct 2 ms 1236 KB Output is correct
9 Correct 2 ms 1236 KB Output is correct
10 Correct 2 ms 1236 KB Output is correct
11 Correct 2 ms 1264 KB Output is correct
12 Correct 2 ms 1236 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 1108 KB Output is correct
16 Correct 2 ms 1236 KB Output is correct
17 Correct 2 ms 980 KB Output is correct
18 Correct 3 ms 1236 KB Output is correct
19 Correct 2 ms 1236 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct
21 Correct 3 ms 1124 KB Output is correct
22 Correct 2 ms 1108 KB Output is correct
23 Correct 2 ms 1236 KB Output is correct
24 Correct 2 ms 1364 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 388 KB Output is correct
27 Correct 2 ms 1236 KB Output is correct
28 Correct 2 ms 1236 KB Output is correct
29 Correct 2 ms 1236 KB Output is correct
30 Correct 2 ms 1236 KB Output is correct
31 Correct 3 ms 1236 KB Output is correct
32 Correct 3 ms 1236 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 1108 KB Output is correct
36 Correct 2 ms 1236 KB Output is correct
37 Correct 2 ms 1108 KB Output is correct
38 Correct 2 ms 1364 KB Output is correct
39 Correct 74 ms 22340 KB Output is correct
40 Correct 88 ms 29440 KB Output is correct
41 Correct 97 ms 23776 KB Output is correct
42 Correct 77 ms 23504 KB Output is correct
43 Correct 83 ms 31336 KB Output is correct
44 Correct 87 ms 31224 KB Output is correct
45 Correct 14 ms 1240 KB Output is correct
46 Correct 15 ms 1396 KB Output is correct
47 Correct 74 ms 24040 KB Output is correct
48 Correct 78 ms 24080 KB Output is correct
49 Correct 87 ms 24096 KB Output is correct
50 Correct 78 ms 24144 KB Output is correct
51 Correct 72 ms 26084 KB Output is correct
52 Correct 85 ms 31504 KB Output is correct
53 Correct 96 ms 40156 KB Output is correct
54 Correct 94 ms 43604 KB Output is correct
55 Correct 100 ms 33184 KB Output is correct
56 Correct 106 ms 43120 KB Output is correct
57 Correct 12 ms 1288 KB Output is correct
58 Correct 15 ms 1724 KB Output is correct
59 Correct 128 ms 41996 KB Output is correct
60 Correct 125 ms 42172 KB Output is correct
61 Correct 112 ms 41868 KB Output is correct
62 Correct 123 ms 41968 KB Output is correct
63 Correct 126 ms 42108 KB Output is correct
64 Correct 111 ms 42048 KB Output is correct
65 Correct 24 ms 9560 KB Output is correct
66 Correct 74 ms 42608 KB Output is correct
67 Correct 90 ms 29796 KB Output is correct
68 Correct 101 ms 37796 KB Output is correct
69 Correct 119 ms 43320 KB Output is correct
70 Correct 131 ms 43168 KB Output is correct
71 Correct 74 ms 34932 KB Output is correct
72 Correct 88 ms 43648 KB Output is correct
73 Correct 175 ms 46548 KB Output is correct
74 Correct 179 ms 49232 KB Output is correct
75 Correct 212 ms 51768 KB Output is correct
76 Correct 130 ms 39516 KB Output is correct
77 Correct 162 ms 46600 KB Output is correct
78 Correct 206 ms 53212 KB Output is correct
79 Correct 19 ms 1756 KB Output is correct
80 Correct 20 ms 2088 KB Output is correct
81 Correct 34 ms 10052 KB Output is correct
82 Correct 69 ms 42576 KB Output is correct
83 Correct 117 ms 59956 KB Output is correct
84 Correct 110 ms 59748 KB Output is correct
85 Correct 111 ms 32460 KB Output is correct
86 Correct 123 ms 37504 KB Output is correct
87 Correct 138 ms 47052 KB Output is correct
88 Correct 143 ms 53004 KB Output is correct
89 Correct 114 ms 28752 KB Output is correct
90 Correct 129 ms 42164 KB Output is correct
91 Correct 98 ms 32556 KB Output is correct
92 Correct 83 ms 31052 KB Output is correct
93 Correct 111 ms 41928 KB Output is correct
94 Correct 118 ms 42064 KB Output is correct
95 Correct 113 ms 40472 KB Output is correct
96 Correct 123 ms 42292 KB Output is correct
97 Correct 119 ms 42184 KB Output is correct
98 Correct 91 ms 34020 KB Output is correct
99 Correct 27 ms 9520 KB Output is correct
100 Correct 68 ms 35920 KB Output is correct
101 Correct 78 ms 42452 KB Output is correct
102 Correct 110 ms 41848 KB Output is correct

Subtask #8
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 852 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 2 ms 1108 KB Output is correct
4 Correct 2 ms 1364 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 1236 KB Output is correct
8 Correct 2 ms 1236 KB Output is correct
9 Correct 2 ms 1236 KB Output is correct
10 Correct 2 ms 1236 KB Output is correct
11 Correct 2 ms 1264 KB Output is correct
12 Correct 2 ms 1236 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 1108 KB Output is correct
16 Correct 2 ms 1236 KB Output is correct
17 Correct 2 ms 980 KB Output is correct
18 Correct 3 ms 1236 KB Output is correct
19 Correct 2 ms 1236 KB Output is correct
20 Correct 2 ms 1364 KB Output is correct
21 Correct 3 ms 1124 KB Output is correct
22 Correct 2 ms 1108 KB Output is correct
23 Correct 2 ms 1236 KB Output is correct
24 Correct 2 ms 1364 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 388 KB Output is correct
27 Correct 2 ms 1236 KB Output is correct
28 Correct 2 ms 1236 KB Output is correct
29 Correct 2 ms 1236 KB Output is correct
30 Correct 2 ms 1236 KB Output is correct
31 Correct 3 ms 1236 KB Output is correct
32 Correct 3 ms 1236 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 1108 KB Output is correct
36 Correct 2 ms 1236 KB Output is correct
37 Correct 2 ms 1108 KB Output is correct
38 Correct 2 ms 1364 KB Output is correct
39 Correct 74 ms 22340 KB Output is correct
40 Correct 88 ms 29440 KB Output is correct
41 Correct 97 ms 23776 KB Output is correct
42 Correct 77 ms 23504 KB Output is correct
43 Correct 83 ms 31336 KB Output is correct
44 Correct 87 ms 31224 KB Output is correct
45 Correct 14 ms 1240 KB Output is correct
46 Correct 15 ms 1396 KB Output is correct
47 Correct 74 ms 24040 KB Output is correct
48 Correct 78 ms 24080 KB Output is correct
49 Correct 87 ms 24096 KB Output is correct
50 Correct 78 ms 24144 KB Output is correct
51 Correct 72 ms 26084 KB Output is correct
52 Correct 85 ms 31504 KB Output is correct
53 Correct 96 ms 40156 KB Output is correct
54 Correct 94 ms 43604 KB Output is correct
55 Correct 628 ms 142940 KB Output is correct
56 Correct 469 ms 114884 KB Output is correct
57 Correct 698 ms 157680 KB Output is correct
58 Correct 617 ms 171592 KB Output is correct
59 Correct 608 ms 164780 KB Output is correct
60 Correct 946 ms 226068 KB Output is correct
61 Correct 63 ms 3808 KB Output is correct
62 Correct 72 ms 5192 KB Output is correct
63 Execution timed out 1102 ms 201668 KB Time limit exceeded
64 Halted 0 ms 0 KB -