oj.uz

Submission #682230

# Submission time Handle Problem Language Result Execution time Memory
682230 2023-01-16T04:53:55 Z armashka Food Court (JOI21_foodcourt) C++17
7 / 100
 370 ms 524288 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
using namespace __gnu_pbds;
 
template<class T> using ordered_multiset =tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update> ;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define pb push_back
#define ft first
#define sd second
#define ll long long
#define pll pair<ll,ll>
const int N = 3e5 + 5;
const int M = 1e7 + 5;
const ll mod = 998244353;
const ll inf = 1e18;

ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res=binmul(res,x);x=binmul(x,x);ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }

ll n, m, q, ind[2001], sz[2001], t[N * 4];
set<pll> st[2001];
vector <ll> fl[N * 4];

void push(ll v, ll tl, ll tr) {
	if (tl == tr) {
		for (auto x : fl[v]) {
			t[v] += x;
			t[v] = max(0ll, t[v]);
		}
	} else {
		for (auto x : fl[v]) {
			fl[v + v].pb(x);
			fl[v + v + 1].pb(x);
		}
	}
	fl[v].clear();
}

void upd(ll l, ll r, ll k, ll v = 1, ll tl = 1, ll tr = n) {
	push(v, tl, tr);
	if (r < tl || tr < l) return;
	if (l <= tl && tr <= r) {
		fl[v].pb(k);
		push(v, tl, tr);
		return;
	}
	ll tm = (tl + tr) / 2;
	upd(l, r, k, v + v, tl, tm);
	upd(l, r, k, v + v + 1, tm + 1, tr);
}

ll get(ll pos, ll v = 1, ll tl = 1, ll tr = n) {
	push(v, tl, tr);
	if (tl == tr) return t[v];
	ll tm = (tl + tr) / 2;
	if (pos <= tm) return get(pos, v + v, tl, tm);
	else return get(pos, v + v + 1, tm + 1, tr);
}

const void solve() {
	cin >> n >> m >> q;

	if (m == 1) {
		for (int i = 1; i <= q; ++ i) {
			ll t;
			cin >> t;
			if (t == 1) {
				ll l, r, c, k;
				cin >> l >> r >> c >> k;
				upd(l, r, k);	
			} else if (t == 2) {
				ll l, r, k;
				cin >> l >> r >> k;
				upd(l, r, -k);
			} else {
				ll a, b;
				cin >> a >> b;
				if (get(a) >= b) cout << "1\n";
				else cout << "0\n";
			}
		}
		return;
	}

	for (int i = 1; i <= q; ++ i) {
		ll t;
		cin >> t;
		if (t == 1) {
			ll l, r, c, k;
			cin >> l >> r >> c >> k;
		    for (int j = l; j <= r; ++ j) {
		    	st[j].insert({sz[j] + k, c});
		    	sz[j] += k;
		    }
		} else if (t == 2) {
			ll l, r, k;
			cin >> l >> r >> k;
		    for (int j = l; j <= r; ++ j) {
		    	ind[j] += k;
		    	ind[j] = min(ind[j], sz[j]);
		    }
		} else {
			ll a, b;
			cin >> a >> b;
			auto it = st[a].lower_bound({ind[a] + b, 0ll});
			if (it == st[a].end()) cout << "0\n";
			else cout << it->sd << "\n";
		}
	}
}

int main() {
   	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	srand(time(NULL));

	ll tt = 1;
	//cin >> tt; 

	while (tt --) solve();

	return 0;
}

Compilation message

foodcourt.cpp:5: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    5 | #pragma GCC optimization("O3")
      | 
foodcourt.cpp:6: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    6 | #pragma GCC optimization("unroll-loops")
      | 
foodcourt.cpp:7: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
    7 | #pragma comment(linker, "/stack:200000000")
      |

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 44236 KB Output is correct
2 Correct 78 ms 56720 KB Output is correct
3 Correct 117 ms 68468 KB Output is correct
4 Correct 210 ms 91116 KB Output is correct
5 Correct 15 ms 28628 KB Output is correct
6 Correct 16 ms 28572 KB Output is correct
7 Correct 133 ms 76580 KB Output is correct
8 Correct 141 ms 76492 KB Output is correct
9 Correct 151 ms 76044 KB Output is correct
10 Correct 148 ms 76480 KB Output is correct
11 Correct 145 ms 77644 KB Output is correct
12 Correct 139 ms 76752 KB Output is correct
13 Correct 120 ms 88724 KB Output is correct
14 Correct 228 ms 114760 KB Output is correct
15 Correct 126 ms 87796 KB Output is correct
16 Correct 157 ms 113356 KB Output is correct
17 Correct 72 ms 51968 KB Output is correct
18 Correct 119 ms 69644 KB Output is correct
19 Correct 18 ms 29140 KB Output is correct
20 Correct 16 ms 29244 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 44236 KB Output is correct
2 Correct 78 ms 56720 KB Output is correct
3 Correct 117 ms 68468 KB Output is correct
4 Correct 210 ms 91116 KB Output is correct
5 Correct 15 ms 28628 KB Output is correct
6 Correct 16 ms 28572 KB Output is correct
7 Correct 133 ms 76580 KB Output is correct
8 Correct 141 ms 76492 KB Output is correct
9 Correct 151 ms 76044 KB Output is correct
10 Correct 148 ms 76480 KB Output is correct
11 Correct 145 ms 77644 KB Output is correct
12 Correct 139 ms 76752 KB Output is correct
13 Correct 120 ms 88724 KB Output is correct
14 Correct 228 ms 114760 KB Output is correct
15 Correct 126 ms 87796 KB Output is correct
16 Correct 157 ms 113356 KB Output is correct
17 Correct 72 ms 51968 KB Output is correct
18 Correct 119 ms 69644 KB Output is correct
19 Correct 18 ms 29140 KB Output is correct
20 Correct 16 ms 29244 KB Output is correct
21 Correct 76 ms 53560 KB Output is correct
22 Correct 80 ms 56436 KB Output is correct
23 Correct 138 ms 68684 KB Output is correct
24 Correct 216 ms 90588 KB Output is correct
25 Correct 16 ms 28620 KB Output is correct
26 Correct 15 ms 28596 KB Output is correct
27 Correct 130 ms 74652 KB Output is correct
28 Correct 151 ms 77720 KB Output is correct
29 Correct 148 ms 75460 KB Output is correct
30 Correct 152 ms 76736 KB Output is correct
31 Correct 129 ms 73916 KB Output is correct
32 Correct 125 ms 73004 KB Output is correct
33 Correct 137 ms 89552 KB Output is correct
34 Correct 216 ms 113640 KB Output is correct
35 Correct 112 ms 87828 KB Output is correct
36 Correct 163 ms 112032 KB Output is correct
37 Correct 16 ms 29128 KB Output is correct
38 Correct 19 ms 29264 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Runtime error 44 ms 57792 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Runtime error 370 ms 524288 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 44236 KB Output is correct
2 Correct 78 ms 56720 KB Output is correct
3 Correct 117 ms 68468 KB Output is correct
4 Correct 210 ms 91116 KB Output is correct
5 Correct 15 ms 28628 KB Output is correct
6 Correct 16 ms 28572 KB Output is correct
7 Correct 133 ms 76580 KB Output is correct
8 Correct 141 ms 76492 KB Output is correct
9 Correct 151 ms 76044 KB Output is correct
10 Correct 148 ms 76480 KB Output is correct
11 Correct 145 ms 77644 KB Output is correct
12 Correct 139 ms 76752 KB Output is correct
13 Correct 120 ms 88724 KB Output is correct
14 Correct 228 ms 114760 KB Output is correct
15 Correct 126 ms 87796 KB Output is correct
16 Correct 157 ms 113356 KB Output is correct
17 Correct 72 ms 51968 KB Output is correct
18 Correct 119 ms 69644 KB Output is correct
19 Correct 18 ms 29140 KB Output is correct
20 Correct 16 ms 29244 KB Output is correct
21 Runtime error 44 ms 57792 KB Execution killed with signal 11
22 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Runtime error 44 ms 57840 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 44236 KB Output is correct
2 Correct 78 ms 56720 KB Output is correct
3 Correct 117 ms 68468 KB Output is correct
4 Correct 210 ms 91116 KB Output is correct
5 Correct 15 ms 28628 KB Output is correct
6 Correct 16 ms 28572 KB Output is correct
7 Correct 133 ms 76580 KB Output is correct
8 Correct 141 ms 76492 KB Output is correct
9 Correct 151 ms 76044 KB Output is correct
10 Correct 148 ms 76480 KB Output is correct
11 Correct 145 ms 77644 KB Output is correct
12 Correct 139 ms 76752 KB Output is correct
13 Correct 120 ms 88724 KB Output is correct
14 Correct 228 ms 114760 KB Output is correct
15 Correct 126 ms 87796 KB Output is correct
16 Correct 157 ms 113356 KB Output is correct
17 Correct 72 ms 51968 KB Output is correct
18 Correct 119 ms 69644 KB Output is correct
19 Correct 18 ms 29140 KB Output is correct
20 Correct 16 ms 29244 KB Output is correct
21 Correct 76 ms 53560 KB Output is correct
22 Correct 80 ms 56436 KB Output is correct
23 Correct 138 ms 68684 KB Output is correct
24 Correct 216 ms 90588 KB Output is correct
25 Correct 16 ms 28620 KB Output is correct
26 Correct 15 ms 28596 KB Output is correct
27 Correct 130 ms 74652 KB Output is correct
28 Correct 151 ms 77720 KB Output is correct
29 Correct 148 ms 75460 KB Output is correct
30 Correct 152 ms 76736 KB Output is correct
31 Correct 129 ms 73916 KB Output is correct
32 Correct 125 ms 73004 KB Output is correct
33 Correct 137 ms 89552 KB Output is correct
34 Correct 216 ms 113640 KB Output is correct
35 Correct 112 ms 87828 KB Output is correct
36 Correct 163 ms 112032 KB Output is correct
37 Correct 16 ms 29128 KB Output is correct
38 Correct 19 ms 29264 KB Output is correct
39 Runtime error 44 ms 57792 KB Execution killed with signal 11
40 Halted 0 ms 0 KB -

Subtask #8
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 44236 KB Output is correct
2 Correct 78 ms 56720 KB Output is correct
3 Correct 117 ms 68468 KB Output is correct
4 Correct 210 ms 91116 KB Output is correct
5 Correct 15 ms 28628 KB Output is correct
6 Correct 16 ms 28572 KB Output is correct
7 Correct 133 ms 76580 KB Output is correct
8 Correct 141 ms 76492 KB Output is correct
9 Correct 151 ms 76044 KB Output is correct
10 Correct 148 ms 76480 KB Output is correct
11 Correct 145 ms 77644 KB Output is correct
12 Correct 139 ms 76752 KB Output is correct
13 Correct 120 ms 88724 KB Output is correct
14 Correct 228 ms 114760 KB Output is correct
15 Correct 126 ms 87796 KB Output is correct
16 Correct 157 ms 113356 KB Output is correct
17 Correct 72 ms 51968 KB Output is correct
18 Correct 119 ms 69644 KB Output is correct
19 Correct 18 ms 29140 KB Output is correct
20 Correct 16 ms 29244 KB Output is correct
21 Correct 76 ms 53560 KB Output is correct
22 Correct 80 ms 56436 KB Output is correct
23 Correct 138 ms 68684 KB Output is correct
24 Correct 216 ms 90588 KB Output is correct
25 Correct 16 ms 28620 KB Output is correct
26 Correct 15 ms 28596 KB Output is correct
27 Correct 130 ms 74652 KB Output is correct
28 Correct 151 ms 77720 KB Output is correct
29 Correct 148 ms 75460 KB Output is correct
30 Correct 152 ms 76736 KB Output is correct
31 Correct 129 ms 73916 KB Output is correct
32 Correct 125 ms 73004 KB Output is correct
33 Correct 137 ms 89552 KB Output is correct
34 Correct 216 ms 113640 KB Output is correct
35 Correct 112 ms 87828 KB Output is correct
36 Correct 163 ms 112032 KB Output is correct
37 Correct 16 ms 29128 KB Output is correct
38 Correct 19 ms 29264 KB Output is correct
39 Runtime error 44 ms 57792 KB Execution killed with signal 11
40 Halted 0 ms 0 KB -