oj.uz

Submission #652903

# Submission time Handle Problem Language Result Execution time Memory
652903 2022-10-25T03:44:52 Z flappybird Food Court (JOI21_foodcourt) C++17
68 / 100
 1000 ms 75536 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define MAX 251010
#define MAXS 20
#define INF 1000000000000000001
#define bb ' '
#define ln '\n'
#define Ln '\n'
struct node {
	ll a, b;
	node() :a(0), b(0) {}
	node(ll a) :a(min(a, 0ll)), b(a) {}
	node(ll a, ll b) :a(a), b(b) {}
};
node operator+(node& n1, node& n2) {
	node ret;
	ret.a = min(n1.a, n1.b + n2.a);
	ret.b = n1.b + n2.b;
	return ret;
}
void operator+= (node& n1, node& n2) { n1 = n1 + n2; }
void operator+=(node& n1, ll x) {
	n1.b += x;
	n1.a = min(n1.a, n1.b);
}
void operator+=(ll& x, node n1) {
	x += n1.a;
	ll ub = n1.b - n1.a;
	x = max(x, 0ll);
	x += ub;
}
typedef pair<int, ll> T;
struct segtree {
	vector<vector<T>> tree;
	vector<node> lazy;
	vector<int> l, r;
	vector<ll> rcnt;
	int s;
	int qcnt = 0;
	void init(int x = 1) {
		if (x >= s) {
			l[x] = r[x] = x - s + 1;
			return;
		}
		init(x * 2);
		init(x * 2 + 1);
		l[x] = l[x * 2];
		r[x] = r[x * 2 + 1];
	}
	segtree(int N = 0) {
		s = 1 << (int)ceil(log2(N));
		tree = vector<vector<T>>(2 * s + 1, vector<T>(1, T(0, 0ll)));
		lazy.resize(2 * s + 1);
		l.resize(2 * s + 1);
		r.resize(2 * s + 1);
		rcnt.resize(2 * s + 1);
		init();
	}
	void add(int low, int high, int t, int num, int loc = 1) {
		if (low == l[loc] && high == r[loc]) {
			tree[loc].emplace_back(t, num + tree[loc].back().second);
			return;
		}
		if (high <= r[loc * 2]) add(low, high, t, num, loc * 2);
		else if (low >= l[loc * 2 + 1]) add(low, high, t, num, loc * 2 + 1);
		else add(low, r[loc * 2], t, num, loc * 2), add(l[loc * 2 + 1], high, t, num, loc * 2 + 1);
	}
	void prop(int loc) {
		if (loc >= s) return;
		for (auto c : { loc * 2, loc * 2 + 1 }) {
			rcnt[c] += lazy[loc];
			lazy[c] += lazy[loc];
		}
		lazy[loc] = node();
	}
	void updnt(int low, int high, node num, int loc = 1) {
		prop(loc);
		if (low == l[loc] && high == r[loc]) {
			rcnt[loc] += num;
			lazy[loc] += num;
			return;
		}
		if (high <= r[loc * 2]) updnt(low, high, num, loc * 2);
		else if (low >= l[loc * 2 + 1]) updnt(low, high, num, loc * 2 + 1);
		else updnt(low, r[loc * 2], num, loc * 2), updnt(l[loc * 2 + 1], high, num, loc * 2 + 1);
		rcnt[loc] = min(rcnt[loc * 2], rcnt[loc * 2 + 1]);
	}
	ll getrcnt(int x, int loc = 1) {
		prop(loc);
		if (l[loc] == r[loc]) return rcnt[loc];
		if (x <= r[loc * 2]) return getrcnt(x, loc * 2);
		else return getrcnt(x, loc * 2 + 1);
	}
	ll gettcnt(int x, int t, int loc = 1) {
		int ind = upper_bound(tree[loc].begin(), tree[loc].end(), T(t + 1, -1)) - tree[loc].begin();
		ind--;
		ll ans;
		if (ind < 0) ans = 0;
		else ans = tree[loc][ind].second;
		if (l[loc] == r[loc]) return ans;
		if (x <= r[loc * 2]) return ans + gettcnt(x, t, loc * 2);
		else return ans + gettcnt(x, t, loc * 2 + 1);
	}
	void update(int l, int r, int t, int n) {
		add(l, r, t, n);
		updnt(l, r, node(n));
		qcnt++;
	}
	void remove(int l, int r, int n) { qcnt++; updnt(l, r, node(-n)); }
	int query(int A, ll B) {
		qcnt++;
		ll nb = B + (gettcnt(A, qcnt) - getrcnt(A));
		int l, r;
		if (gettcnt(A, qcnt) < nb) return -1;
		l = 0, r = qcnt;
		while (r - l > 1) {
			int mid = (l + r + 1) / 2;
			if (gettcnt(A, mid) < nb) l = mid;
			else r = mid;
		}
		return r;
	}
};
int cn[MAX];
signed main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int N, Q;
	cin >> N >> Q >> Q;
	segtree seg(N);
	int i;
	int t, l, r, c, k, a;
	ll b;
	for (i = 1; i <= Q; i++) {
		cin >> t;
		if (t == 1) cin >> l >> r >> c >> k, seg.update(l, r, i, k), cn[i] = c;
		if (t == 2) cin >> l >> r >> k, seg.remove(l, r, k);
		if (t == 3) {
			cin >> a >> b;
			int res = seg.query(a, b);
			if (!~res) cout << 0 << ln;
			else cout << cn[res] << ln;
		}
	}
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 724 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 4 ms 852 KB Output is correct
12 Correct 4 ms 852 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 3 ms 752 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 4 ms 916 KB Output is correct
17 Correct 3 ms 848 KB Output is correct
18 Correct 4 ms 884 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 3 ms 844 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 724 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 4 ms 852 KB Output is correct
12 Correct 4 ms 852 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 3 ms 752 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 4 ms 916 KB Output is correct
17 Correct 3 ms 848 KB Output is correct
18 Correct 4 ms 884 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 3 ms 844 KB Output is correct
21 Correct 4 ms 760 KB Output is correct
22 Correct 4 ms 848 KB Output is correct
23 Correct 4 ms 852 KB Output is correct
24 Correct 5 ms 980 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 852 KB Output is correct
28 Correct 4 ms 848 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 4 ms 852 KB Output is correct
31 Correct 4 ms 848 KB Output is correct
32 Correct 4 ms 884 KB Output is correct
33 Correct 2 ms 724 KB Output is correct
34 Correct 3 ms 840 KB Output is correct
35 Correct 3 ms 852 KB Output is correct
36 Correct 4 ms 852 KB Output is correct
37 Correct 2 ms 724 KB Output is correct
38 Correct 3 ms 856 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 14896 KB Output is correct
2 Correct 121 ms 15624 KB Output is correct
3 Correct 126 ms 15328 KB Output is correct
4 Correct 123 ms 15320 KB Output is correct
5 Correct 132 ms 16460 KB Output is correct
6 Correct 131 ms 16312 KB Output is correct
7 Correct 22 ms 1856 KB Output is correct
8 Correct 28 ms 1928 KB Output is correct
9 Correct 113 ms 14924 KB Output is correct
10 Correct 115 ms 15084 KB Output is correct
11 Correct 121 ms 15072 KB Output is correct
12 Correct 129 ms 15236 KB Output is correct
13 Correct 111 ms 15252 KB Output is correct
14 Correct 133 ms 15808 KB Output is correct
15 Correct 133 ms 16908 KB Output is correct
16 Correct 144 ms 17112 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1053 ms 75536 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 724 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 4 ms 852 KB Output is correct
12 Correct 4 ms 852 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 3 ms 752 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 4 ms 916 KB Output is correct
17 Correct 3 ms 848 KB Output is correct
18 Correct 4 ms 884 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 3 ms 844 KB Output is correct
21 Correct 115 ms 14896 KB Output is correct
22 Correct 121 ms 15624 KB Output is correct
23 Correct 126 ms 15328 KB Output is correct
24 Correct 123 ms 15320 KB Output is correct
25 Correct 132 ms 16460 KB Output is correct
26 Correct 131 ms 16312 KB Output is correct
27 Correct 22 ms 1856 KB Output is correct
28 Correct 28 ms 1928 KB Output is correct
29 Correct 113 ms 14924 KB Output is correct
30 Correct 115 ms 15084 KB Output is correct
31 Correct 121 ms 15072 KB Output is correct
32 Correct 129 ms 15236 KB Output is correct
33 Correct 111 ms 15252 KB Output is correct
34 Correct 133 ms 15808 KB Output is correct
35 Correct 133 ms 16908 KB Output is correct
36 Correct 144 ms 17112 KB Output is correct
37 Correct 231 ms 19268 KB Output is correct
38 Correct 203 ms 21524 KB Output is correct
39 Correct 21 ms 1752 KB Output is correct
40 Correct 34 ms 1716 KB Output is correct
41 Correct 286 ms 21344 KB Output is correct
42 Correct 267 ms 21552 KB Output is correct
43 Correct 227 ms 21492 KB Output is correct
44 Correct 240 ms 21372 KB Output is correct
45 Correct 242 ms 21564 KB Output is correct
46 Correct 267 ms 21476 KB Output is correct
47 Correct 126 ms 16980 KB Output is correct
48 Correct 164 ms 21480 KB Output is correct
49 Correct 155 ms 18656 KB Output is correct
50 Correct 191 ms 20168 KB Output is correct
51 Correct 229 ms 21672 KB Output is correct
52 Correct 220 ms 21664 KB Output is correct
53 Correct 102 ms 15948 KB Output is correct
54 Correct 141 ms 17160 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 339 ms 22688 KB Output is correct
2 Correct 359 ms 23660 KB Output is correct
3 Correct 397 ms 24132 KB Output is correct
4 Correct 253 ms 20976 KB Output is correct
5 Correct 342 ms 22900 KB Output is correct
6 Correct 371 ms 24620 KB Output is correct
7 Correct 45 ms 2380 KB Output is correct
8 Correct 61 ms 2192 KB Output is correct
9 Correct 159 ms 19676 KB Output is correct
10 Correct 148 ms 21760 KB Output is correct
11 Correct 214 ms 25152 KB Output is correct
12 Correct 222 ms 25156 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 724 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 4 ms 852 KB Output is correct
12 Correct 4 ms 852 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 3 ms 752 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 4 ms 916 KB Output is correct
17 Correct 3 ms 848 KB Output is correct
18 Correct 4 ms 884 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 3 ms 844 KB Output is correct
21 Correct 4 ms 760 KB Output is correct
22 Correct 4 ms 848 KB Output is correct
23 Correct 4 ms 852 KB Output is correct
24 Correct 5 ms 980 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 852 KB Output is correct
28 Correct 4 ms 848 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 4 ms 852 KB Output is correct
31 Correct 4 ms 848 KB Output is correct
32 Correct 4 ms 884 KB Output is correct
33 Correct 2 ms 724 KB Output is correct
34 Correct 3 ms 840 KB Output is correct
35 Correct 3 ms 852 KB Output is correct
36 Correct 4 ms 852 KB Output is correct
37 Correct 2 ms 724 KB Output is correct
38 Correct 3 ms 856 KB Output is correct
39 Correct 115 ms 14896 KB Output is correct
40 Correct 121 ms 15624 KB Output is correct
41 Correct 126 ms 15328 KB Output is correct
42 Correct 123 ms 15320 KB Output is correct
43 Correct 132 ms 16460 KB Output is correct
44 Correct 131 ms 16312 KB Output is correct
45 Correct 22 ms 1856 KB Output is correct
46 Correct 28 ms 1928 KB Output is correct
47 Correct 113 ms 14924 KB Output is correct
48 Correct 115 ms 15084 KB Output is correct
49 Correct 121 ms 15072 KB Output is correct
50 Correct 129 ms 15236 KB Output is correct
51 Correct 111 ms 15252 KB Output is correct
52 Correct 133 ms 15808 KB Output is correct
53 Correct 133 ms 16908 KB Output is correct
54 Correct 144 ms 17112 KB Output is correct
55 Correct 231 ms 19268 KB Output is correct
56 Correct 203 ms 21524 KB Output is correct
57 Correct 21 ms 1752 KB Output is correct
58 Correct 34 ms 1716 KB Output is correct
59 Correct 286 ms 21344 KB Output is correct
60 Correct 267 ms 21552 KB Output is correct
61 Correct 227 ms 21492 KB Output is correct
62 Correct 240 ms 21372 KB Output is correct
63 Correct 242 ms 21564 KB Output is correct
64 Correct 267 ms 21476 KB Output is correct
65 Correct 126 ms 16980 KB Output is correct
66 Correct 164 ms 21480 KB Output is correct
67 Correct 155 ms 18656 KB Output is correct
68 Correct 191 ms 20168 KB Output is correct
69 Correct 229 ms 21672 KB Output is correct
70 Correct 220 ms 21664 KB Output is correct
71 Correct 102 ms 15948 KB Output is correct
72 Correct 141 ms 17160 KB Output is correct
73 Correct 339 ms 22688 KB Output is correct
74 Correct 359 ms 23660 KB Output is correct
75 Correct 397 ms 24132 KB Output is correct
76 Correct 253 ms 20976 KB Output is correct
77 Correct 342 ms 22900 KB Output is correct
78 Correct 371 ms 24620 KB Output is correct
79 Correct 45 ms 2380 KB Output is correct
80 Correct 61 ms 2192 KB Output is correct
81 Correct 159 ms 19676 KB Output is correct
82 Correct 148 ms 21760 KB Output is correct
83 Correct 214 ms 25152 KB Output is correct
84 Correct 222 ms 25156 KB Output is correct
85 Correct 242 ms 19832 KB Output is correct
86 Correct 265 ms 20960 KB Output is correct
87 Correct 236 ms 22896 KB Output is correct
88 Correct 303 ms 24640 KB Output is correct
89 Correct 162 ms 18452 KB Output is correct
90 Correct 245 ms 22008 KB Output is correct
91 Correct 199 ms 19840 KB Output is correct
92 Correct 181 ms 19372 KB Output is correct
93 Correct 271 ms 21928 KB Output is correct
94 Correct 250 ms 22152 KB Output is correct
95 Correct 272 ms 21752 KB Output is correct
96 Correct 291 ms 22024 KB Output is correct
97 Correct 243 ms 22080 KB Output is correct
98 Correct 206 ms 20112 KB Output is correct
99 Correct 121 ms 17544 KB Output is correct
100 Correct 143 ms 19224 KB Output is correct
101 Correct 177 ms 21936 KB Output is correct
102 Correct 172 ms 18764 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 724 KB Output is correct
2 Correct 4 ms 852 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 848 KB Output is correct
9 Correct 4 ms 852 KB Output is correct
10 Correct 4 ms 852 KB Output is correct
11 Correct 4 ms 852 KB Output is correct
12 Correct 4 ms 852 KB Output is correct
13 Correct 2 ms 724 KB Output is correct
14 Correct 3 ms 752 KB Output is correct
15 Correct 3 ms 760 KB Output is correct
16 Correct 4 ms 916 KB Output is correct
17 Correct 3 ms 848 KB Output is correct
18 Correct 4 ms 884 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 3 ms 844 KB Output is correct
21 Correct 4 ms 760 KB Output is correct
22 Correct 4 ms 848 KB Output is correct
23 Correct 4 ms 852 KB Output is correct
24 Correct 5 ms 980 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 852 KB Output is correct
28 Correct 4 ms 848 KB Output is correct
29 Correct 4 ms 852 KB Output is correct
30 Correct 4 ms 852 KB Output is correct
31 Correct 4 ms 848 KB Output is correct
32 Correct 4 ms 884 KB Output is correct
33 Correct 2 ms 724 KB Output is correct
34 Correct 3 ms 840 KB Output is correct
35 Correct 3 ms 852 KB Output is correct
36 Correct 4 ms 852 KB Output is correct
37 Correct 2 ms 724 KB Output is correct
38 Correct 3 ms 856 KB Output is correct
39 Correct 115 ms 14896 KB Output is correct
40 Correct 121 ms 15624 KB Output is correct
41 Correct 126 ms 15328 KB Output is correct
42 Correct 123 ms 15320 KB Output is correct
43 Correct 132 ms 16460 KB Output is correct
44 Correct 131 ms 16312 KB Output is correct
45 Correct 22 ms 1856 KB Output is correct
46 Correct 28 ms 1928 KB Output is correct
47 Correct 113 ms 14924 KB Output is correct
48 Correct 115 ms 15084 KB Output is correct
49 Correct 121 ms 15072 KB Output is correct
50 Correct 129 ms 15236 KB Output is correct
51 Correct 111 ms 15252 KB Output is correct
52 Correct 133 ms 15808 KB Output is correct
53 Correct 133 ms 16908 KB Output is correct
54 Correct 144 ms 17112 KB Output is correct
55 Execution timed out 1053 ms 75536 KB Time limit exceeded
56 Halted 0 ms 0 KB -