#include <bits/stdc++.h>
using namespace std;
#include <ext/rope>
using namespace __gnu_cxx;
// #pragma comment(linker, "/stack:2000000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
typedef long long ll;
typedef long double ld;
typedef pair<ll,ll> pll;
#define precise(a) cout<<fixed<<setprecision(a)
#define sz size()
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
// t1
const ll mod = ll(1e9)+7; //(b + (a%b)) % b (to mod -1%(10^9+7) correctly in c++ its -1 but its suppose to be 10^9+6
const ll MOD = 998244353; // (a%mod)*(binpow(b,mod-2,mod) = (a/b)%mod
const ll N = ll(3e5)+10;
const ll K = 17;
const ll inf = 1e18;
const ld eps = 1e-15L;
//const ll B = 316;
ll lcm(ll a, ll b){ return (a / __gcd(a,b)) * b; }
//const ld P = acos(-1.0);
// ll binpow(ll a, ll b, ll m){ ll res=1;a%=m; while(b>0){ if(b&1)res=(res*a)%m; a=(a*a)%m; b/=2; } return res%m;}
ld binpow(ld a, ll b){ ld res=1; while(b>0){ if(b&1)res=(res*a); a=(a*a); b/=2; } return res;}
void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
void precalc() {
}
ll n, m, q;
ll t[N*4], u[N*4];
vector<pll>cus[N];
ll debt[N];
void push(ll v, ll tl, ll tr) {
if(u[v]) {
t[v] = max(0ll, t[v]+(tr-tl+1)*u[v]);
if(tl!=tr) {
u[v+v] += u[v];
u[v+v+1] += u[v];
}
u[v] = 0;
}
}
void update(ll v, ll tl, ll tr, ll l, ll r, ll x) {
push(v, tl, tr);
if(tl>r || l>tr) return;
if(l<=tl && tr<=r) {
u[v]+=x;
push(v, tl, tr);
return;
}
ll tm = (tl+tr)/2;
update(v+v, tl, tm, l, r, x);
update(v+v+1, tm+1, tr, l, r, x);
t[v] = t[v+v] + t[v+v+1];
}
ll get(ll v, ll tl, ll tr, ll l, ll r) {
push(v, tl, tr);
if(tl>r || l>tr) return 0;
if(l<=tl && tr<=r) return t[v];
ll tm = (tl+tr)/2;
return get(v+v, tl, tm, l, r) + get(v+v+1, tm+1, tr, l, r);
}
void Baizho()
{
cin>>n>>m>>q;
if(m==1) {
while(q--) {
ll t; cin>>t;
if(t==1) {
ll l, r, shop, k; cin>>l>>r>>shop>>k;
update(1, 1, n, l, r, k);
}
else if(t==2) {
ll l, r, k; cin>>l>>r>>k;
update(1, 1, n, l, r, -k);
}
else {
ll shop, pos; cin>>shop>>pos;
ll cnt = get(1, 1, n, shop, shop);
if(cnt<pos) cout<<"0\n";
else cout<<"1\n";
}
}
return;
}
if(n<2000) assert(0);
while(q--) {
ll t; cin>>t;
if(t==1) {
ll l, r, shop, k; cin>>l>>r>>shop>>k;
for(ll i=l; i<=r; i++) {
ll extra = 0;
if(cus[i].sz) {
extra = cus[i].back().ff;
if(cus[i].back().ss==shop) {
cus[i].pop_back();
}
}
cus[i].pb({k+extra, shop});
}
}
else if(t==2) {
ll l, r, k; cin>>l>>r>>k;
for(ll i=l; i<=r; i++) {
if(cus[i].sz) debt[i]+=min(cus[i].back().ff-debt[i], k);
}
}
else {
ll shop, pos; cin>>shop>>pos;
pos+=debt[shop];
if(cus[shop].sz==0) cout<<"0\n";
else if(pos>cus[shop].back().ff) cout<<"0\n";
else cout<<(*lower_bound(all(cus[shop]), make_pair(pos, 0ll))).ss<<"\n";
}
}
}
int main() {
// Freopen("div7");
ios_base::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
precalc();
int ttt = 1;
// cin>>ttt;
for(int i=1; i<=ttt; i++) { Baizho();}
}
Compilation message
foodcourt.cpp: In function 'void Freopen(std::string)':
foodcourt.cpp:37:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
37 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
foodcourt.cpp:37:76: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
37 | void Freopen(string Key){ freopen((Key+".in").c_str(), "r", stdin); freopen((Key+".out").c_str(), "w", stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
10 ms |
14804 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
10 ms |
14804 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1086 ms |
10868 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
223 ms |
15692 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
10 ms |
14804 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
853 ms |
524288 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
10 ms |
14804 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
10 ms |
14804 KB |
Execution killed with signal 6 |
| 2 |
Halted |
0 ms |
0 KB |
- |
