oj.uz

Submission #652904

# Submission time Handle Problem Language Result Execution time Memory
652904 2022-10-25T03:46:35 Z flappybird Food Court (JOI21_foodcourt) C++17
68 / 100
 1000 ms 73012 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) {}
};
inline 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;
}
inline void operator+= (node& n1, node& n2) { n1 = n1 + n2; }
inline void operator+=(node& n1, ll x) {
	n1.b += x;
	n1.a = min(n1.a, n1.b);
}
inline 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 3 ms 724 KB Output is correct
2 Correct 4 ms 836 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 6 ms 932 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 4 ms 860 KB Output is correct
9 Correct 4 ms 844 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 724 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 3 ms 724 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 4 ms 836 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 6 ms 932 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 4 ms 860 KB Output is correct
9 Correct 4 ms 844 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 724 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 4 ms 724 KB Output is correct
22 Correct 4 ms 724 KB Output is correct
23 Correct 4 ms 852 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 4 ms 852 KB Output is correct
28 Correct 4 ms 808 KB Output is correct
29 Correct 4 ms 840 KB Output is correct
30 Correct 4 ms 852 KB Output is correct
31 Correct 4 ms 852 KB Output is correct
32 Correct 4 ms 852 KB Output is correct
33 Correct 2 ms 724 KB Output is correct
34 Correct 3 ms 724 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 828 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 117 ms 13600 KB Output is correct
2 Correct 125 ms 14364 KB Output is correct
3 Correct 122 ms 14060 KB Output is correct
4 Correct 124 ms 14216 KB Output is correct
5 Correct 128 ms 15000 KB Output is correct
6 Correct 129 ms 14988 KB Output is correct
7 Correct 23 ms 1112 KB Output is correct
8 Correct 27 ms 1268 KB Output is correct
9 Correct 124 ms 13864 KB Output is correct
10 Correct 112 ms 13828 KB Output is correct
11 Correct 113 ms 13792 KB Output is correct
12 Correct 117 ms 13768 KB Output is correct
13 Correct 100 ms 14392 KB Output is correct
14 Correct 127 ms 14692 KB Output is correct
15 Correct 127 ms 15568 KB Output is correct
16 Correct 131 ms 15852 KB Output is correct

Subtask #4
0 / 21.0

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

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 4 ms 836 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 6 ms 932 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 4 ms 860 KB Output is correct
9 Correct 4 ms 844 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 724 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 117 ms 13600 KB Output is correct
22 Correct 125 ms 14364 KB Output is correct
23 Correct 122 ms 14060 KB Output is correct
24 Correct 124 ms 14216 KB Output is correct
25 Correct 128 ms 15000 KB Output is correct
26 Correct 129 ms 14988 KB Output is correct
27 Correct 23 ms 1112 KB Output is correct
28 Correct 27 ms 1268 KB Output is correct
29 Correct 124 ms 13864 KB Output is correct
30 Correct 112 ms 13828 KB Output is correct
31 Correct 113 ms 13792 KB Output is correct
32 Correct 117 ms 13768 KB Output is correct
33 Correct 100 ms 14392 KB Output is correct
34 Correct 127 ms 14692 KB Output is correct
35 Correct 127 ms 15568 KB Output is correct
36 Correct 131 ms 15852 KB Output is correct
37 Correct 224 ms 18268 KB Output is correct
38 Correct 200 ms 20576 KB Output is correct
39 Correct 22 ms 1112 KB Output is correct
40 Correct 33 ms 1108 KB Output is correct
41 Correct 249 ms 20312 KB Output is correct
42 Correct 236 ms 20416 KB Output is correct
43 Correct 225 ms 20336 KB Output is correct
44 Correct 240 ms 20380 KB Output is correct
45 Correct 244 ms 20380 KB Output is correct
46 Correct 233 ms 20480 KB Output is correct
47 Correct 119 ms 16100 KB Output is correct
48 Correct 164 ms 20588 KB Output is correct
49 Correct 152 ms 17848 KB Output is correct
50 Correct 183 ms 19268 KB Output is correct
51 Correct 221 ms 20596 KB Output is correct
52 Correct 218 ms 20616 KB Output is correct
53 Correct 125 ms 14924 KB Output is correct
54 Correct 135 ms 15736 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 299 ms 21252 KB Output is correct
2 Correct 336 ms 22092 KB Output is correct
3 Correct 348 ms 22476 KB Output is correct
4 Correct 247 ms 19780 KB Output is correct
5 Correct 309 ms 21440 KB Output is correct
6 Correct 352 ms 23024 KB Output is correct
7 Correct 42 ms 1208 KB Output is correct
8 Correct 57 ms 1172 KB Output is correct
9 Correct 161 ms 18072 KB Output is correct
10 Correct 144 ms 20716 KB Output is correct
11 Correct 213 ms 23556 KB Output is correct
12 Correct 217 ms 23472 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 4 ms 836 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 6 ms 932 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 4 ms 860 KB Output is correct
9 Correct 4 ms 844 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 724 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 4 ms 724 KB Output is correct
22 Correct 4 ms 724 KB Output is correct
23 Correct 4 ms 852 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 4 ms 852 KB Output is correct
28 Correct 4 ms 808 KB Output is correct
29 Correct 4 ms 840 KB Output is correct
30 Correct 4 ms 852 KB Output is correct
31 Correct 4 ms 852 KB Output is correct
32 Correct 4 ms 852 KB Output is correct
33 Correct 2 ms 724 KB Output is correct
34 Correct 3 ms 724 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 828 KB Output is correct
39 Correct 117 ms 13600 KB Output is correct
40 Correct 125 ms 14364 KB Output is correct
41 Correct 122 ms 14060 KB Output is correct
42 Correct 124 ms 14216 KB Output is correct
43 Correct 128 ms 15000 KB Output is correct
44 Correct 129 ms 14988 KB Output is correct
45 Correct 23 ms 1112 KB Output is correct
46 Correct 27 ms 1268 KB Output is correct
47 Correct 124 ms 13864 KB Output is correct
48 Correct 112 ms 13828 KB Output is correct
49 Correct 113 ms 13792 KB Output is correct
50 Correct 117 ms 13768 KB Output is correct
51 Correct 100 ms 14392 KB Output is correct
52 Correct 127 ms 14692 KB Output is correct
53 Correct 127 ms 15568 KB Output is correct
54 Correct 131 ms 15852 KB Output is correct
55 Correct 224 ms 18268 KB Output is correct
56 Correct 200 ms 20576 KB Output is correct
57 Correct 22 ms 1112 KB Output is correct
58 Correct 33 ms 1108 KB Output is correct
59 Correct 249 ms 20312 KB Output is correct
60 Correct 236 ms 20416 KB Output is correct
61 Correct 225 ms 20336 KB Output is correct
62 Correct 240 ms 20380 KB Output is correct
63 Correct 244 ms 20380 KB Output is correct
64 Correct 233 ms 20480 KB Output is correct
65 Correct 119 ms 16100 KB Output is correct
66 Correct 164 ms 20588 KB Output is correct
67 Correct 152 ms 17848 KB Output is correct
68 Correct 183 ms 19268 KB Output is correct
69 Correct 221 ms 20596 KB Output is correct
70 Correct 218 ms 20616 KB Output is correct
71 Correct 125 ms 14924 KB Output is correct
72 Correct 135 ms 15736 KB Output is correct
73 Correct 299 ms 21252 KB Output is correct
74 Correct 336 ms 22092 KB Output is correct
75 Correct 348 ms 22476 KB Output is correct
76 Correct 247 ms 19780 KB Output is correct
77 Correct 309 ms 21440 KB Output is correct
78 Correct 352 ms 23024 KB Output is correct
79 Correct 42 ms 1208 KB Output is correct
80 Correct 57 ms 1172 KB Output is correct
81 Correct 161 ms 18072 KB Output is correct
82 Correct 144 ms 20716 KB Output is correct
83 Correct 213 ms 23556 KB Output is correct
84 Correct 217 ms 23472 KB Output is correct
85 Correct 217 ms 18380 KB Output is correct
86 Correct 257 ms 19368 KB Output is correct
87 Correct 246 ms 21528 KB Output is correct
88 Correct 264 ms 22924 KB Output is correct
89 Correct 171 ms 17260 KB Output is correct
90 Correct 252 ms 20416 KB Output is correct
91 Correct 193 ms 18460 KB Output is correct
92 Correct 167 ms 18208 KB Output is correct
93 Correct 261 ms 20360 KB Output is correct
94 Correct 237 ms 20412 KB Output is correct
95 Correct 232 ms 20212 KB Output is correct
96 Correct 231 ms 20460 KB Output is correct
97 Correct 226 ms 20464 KB Output is correct
98 Correct 191 ms 18884 KB Output is correct
99 Correct 119 ms 16200 KB Output is correct
100 Correct 135 ms 17960 KB Output is correct
101 Correct 160 ms 20536 KB Output is correct
102 Correct 150 ms 17116 KB Output is correct

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 724 KB Output is correct
2 Correct 4 ms 836 KB Output is correct
3 Correct 3 ms 852 KB Output is correct
4 Correct 6 ms 932 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 4 ms 860 KB Output is correct
9 Correct 4 ms 844 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 724 KB Output is correct
15 Correct 3 ms 724 KB Output is correct
16 Correct 5 ms 980 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 4 ms 852 KB Output is correct
19 Correct 3 ms 724 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 4 ms 724 KB Output is correct
22 Correct 4 ms 724 KB Output is correct
23 Correct 4 ms 852 KB Output is correct
24 Correct 4 ms 852 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 4 ms 852 KB Output is correct
28 Correct 4 ms 808 KB Output is correct
29 Correct 4 ms 840 KB Output is correct
30 Correct 4 ms 852 KB Output is correct
31 Correct 4 ms 852 KB Output is correct
32 Correct 4 ms 852 KB Output is correct
33 Correct 2 ms 724 KB Output is correct
34 Correct 3 ms 724 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 828 KB Output is correct
39 Correct 117 ms 13600 KB Output is correct
40 Correct 125 ms 14364 KB Output is correct
41 Correct 122 ms 14060 KB Output is correct
42 Correct 124 ms 14216 KB Output is correct
43 Correct 128 ms 15000 KB Output is correct
44 Correct 129 ms 14988 KB Output is correct
45 Correct 23 ms 1112 KB Output is correct
46 Correct 27 ms 1268 KB Output is correct
47 Correct 124 ms 13864 KB Output is correct
48 Correct 112 ms 13828 KB Output is correct
49 Correct 113 ms 13792 KB Output is correct
50 Correct 117 ms 13768 KB Output is correct
51 Correct 100 ms 14392 KB Output is correct
52 Correct 127 ms 14692 KB Output is correct
53 Correct 127 ms 15568 KB Output is correct
54 Correct 131 ms 15852 KB Output is correct
55 Execution timed out 1095 ms 73012 KB Time limit exceeded
56 Halted 0 ms 0 KB -