#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], fl[N * 4];
set<pll> st[2001];
void push(ll v, ll tl, ll tr) {
if (tl == tr) {
t[v] += fl[v];
t[v] = max(0ll, t[v]);
} else {
fl[v + v] += fl[v];
fl[v + v + 1] += fl[v];
}
fl[v] = 0;
}
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] += 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")
|
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
3 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
246 ms |
7724 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
