Pagini recente » Cod sursa (job #1811168) | Cod sursa (job #1854326) | Cod sursa (job #722014) | Cod sursa (job #2842965) | Cod sursa (job #2803727)
#include <bits/stdc++.h>
#define mp(X,Y) make_pair(X,Y)
#define IM set<pair<int,int>>::iterator
using namespace std;ifstream f("hotel.in");ofstream g("hotel.out");
int n,p;
set<pair<int,int>> segm;
multiset<int> vals;
void PUSH(int A,int B)
{
int L=B-A+1;
vals.insert(L);
segm.insert(mp(A,B));
}
void POP(IM it)
{
int A,B;
tie(A,B)=*it;
int L=B-A+1;
vals.erase(vals.find(L));
segm.erase(it);
}
int main()
{
f>>n>>p;
PUSH(-1,-2);
PUSH(n+3,n+2);
PUSH(1,n);
for(; p; p--)
{
for(auto it:vals)cerr<<it<<' ';cerr<<'\n';
int op;f>>op;
if(op==3){auto sol=vals.end();sol--;g<<*sol<<'\n';}
else
{
int A,B,AS,BS,AD,BD;/// se ocupa camere
f>>A>>B;B=A+B-1;
if(op==1)
{
auto it=segm.upper_bound(mp(A,-1));
it--;
tie(AS,BD)=*it;
POP(it);
if(AD<A)PUSH(AD,A-1);
if(B<BD)PUSH(B+1,BD);
}
else
{
auto DR=segm.upper_bound(mp(A,-1));
auto ST=DR;DR--;
tie(AS,BS)=*ST;
tie(AD,BD)=*DR;
if(A==BS+1){POP(ST);A=AS;}
if(B==AD-1){POP(DR);B=BD;}
PUSH(A,B);
}
}
}
return 0;
}