結果
問題 | No.674 n連勤 |
ユーザー |
![]() |
提出日時 | 2021-01-12 11:41:22 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 21 ms / 2,000 ms |
コード長 | 5,559 bytes |
コンパイル時間 | 11,120 ms |
コンパイル使用メモリ | 280,412 KB |
最終ジャッジ日時 | 2025-01-17 16:25:20 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 17 |
ソースコード
#pragma GCC target("avx")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include<bits/stdc++.h>// #include<ext/pb_ds/assoc_container.hpp>// #include<ext/pb_ds/tree_policy.hpp>// #include<ext/pb_ds/tag_and_trait.hpp>// using namespace __gnu_pbds;// #include<boost/multiprecision/cpp_int.hpp>// namespace multiprecisioninteger = boost::multiprecision;// using cint=multiprecisioninteger::cpp_int;using namespace std;using ll=long long;#define double long doubleusing datas=pair<ll,ll>;using ddatas=pair<double,double>;using tdata=pair<ll,datas>;using vec=vector<ll>;using mat=vector<vec>;using pvec=vector<datas>;using pmat=vector<pvec>;// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;#define For(i,a,b) for(i=a;i<(ll)b;++i)#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)#define rep(i,N) For(i,0,N)#define rep1(i,N) For(i,1,N)#define brep(i,N) bFor(i,N,0)#define brep1(i,N) bFor(i,N,1)#define all(v) (v).begin(),(v).end()#define allr(v) (v).rbegin(),(v).rend()#define vsort(v) sort(all(v))#define vrsort(v) sort(allr(v))#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())#define endl "\n"#define eb emplace_back#define print(x) cout<<x<<endl#define printyes print("Yes")#define printno print("No")#define printYES print("YES")#define printNO print("NO")#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)constexpr ll mod=1000000007;// constexpr ll mod=998244353;constexpr ll inf=1LL<<60;constexpr double eps=1e-9;const double PI=acos(-1);template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}template<class T> ostream& operator<<(ostream& os,const vector<T>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T> ostream& operator<<(ostream& os,const set<T>& v){os<<"{";bool f=false;for(auto& x:v){if(f)os<<",";os<<x;f=true;}os<<"}";return os;}template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}#ifdef DEBUGvoid debugg(){cout<<endl;}template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)#else#define debug(...) (void(0))#endifvoid startupcpp(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}// Merge:0->interval set,1->point settemplate<typename T,int Merge=1>struct rangeset:set<pair<T,T>>{private:using P=pair<T,T>;using seitr=_Rb_tree_const_iterator<P>;const T TINF=numeric_limits<T>::max()/2;public:// There are all [L,R] (not [L,R) )rangeset(){this->emplace(-TINF,-TINF);this->emplace(TINF,TINF);}// [L,R] covered?bool covered(T L,T R){assert(L<=R);seitr itr(--this->lower_bound(P(L+1,L)));return R<=itr->second;}bool covered(T x){return covered(x,x);}// what is covered [L,R] (not cover->return [-TINF,-TINF])P covered_by(T L,T R){assert(L<=R);seitr itr(--this->lower_bound(P(L+1,L)));if(R<=itr->second)return *itr;else return *(this->begin());}P covered_by(T x){return covered_by(x,x);}//insert [L,R] and merge, return (how many add point or interval)pair<seitr,T> insert(T L,T R){assert(L<=R);seitr itr(--this->lower_bound(P(L+1,L)));if(R<=itr->second)return pair<seitr,T>(itr,0);T deletecnt(0);if(itr->second<L-Merge){++itr;}else{L=itr->first;deletecnt=itr->second-itr->first+Merge;itr=this->erase(itr);}while(itr->second<=R){deletecnt+=itr->second-itr->first+Merge;itr=this->erase(itr);}if(itr->first<=R+Merge){R=itr->second;deletecnt+=itr->second-itr->first+Merge;itr=this->erase(itr);}itr=this->emplace_hint(itr,L,R);return pair<seitr,T>(itr,R-L+Merge-deletecnt);}pair<seitr,T> insert(T x){// assert(Merge==1);return insert(x,x);}//delete intersect [L,R], return (how many erase point or interval)T remove(T L,T R){assert(L<=R);seitr itr(--this->lower_bound(P(L+1,L)));if(R<=itr->second){if(itr->first!=L)this->emplace_hint(itr,itr->first,L-Merge);if(itr->second!=R)this->emplace_hint(next(itr),R+Merge,itr->second);this->erase(itr);return R-L+Merge;}T deletecnt(0);if(itr->second<=L-Merge){++itr;}else{deletecnt=itr->second-L+Merge;this->emplace_hint(itr,itr->first,L-Merge);itr=this->erase(itr);}while(itr->second<=R){deletecnt+=itr->second-itr->first+Merge;itr=this->erase(itr);}if(itr->first<R+Merge){deletecnt+=R-itr->first+Merge;this->emplace_hint(next(itr),R+Merge,itr->second);this->erase(itr);}return deletecnt;}T remove(T x){// assert(Merge==1);return remove(x,x);}T mex(T x){// assert(Merge==1);seitr itr(this->lower_bound(P(x,x)));if(itr->first<=x)return itr->second+1;else return x+1;}};ll N,ans;int main(){startupcpp();cin>>N>>N;rangeset<ll> se;for(int i=0;i<N;++i){ll L,R;cin>>L>>R;auto itr=*se.insert(L,R).first;chmax(ans,itr.second-itr.first+1);debug(se);print(ans);}}