結果

問題 No.674 n連勤
ユーザー theory_and_metheory_and_me
提出日時 2021-02-14 11:08:26
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 65 ms / 2,000 ms
コード長 5,677 bytes
コンパイル時間 1,968 ms
コンパイル使用メモリ 201,980 KB
最終ジャッジ日時 2025-01-18 20:17:23
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 17
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(ll i=0;i<(ll)n;i++)
#define dump(x) cerr << "Line " << __LINE__ << ": " << #x << " = " << (x) << "\n";
#define spa << " " <<
#define fi first
#define se second
#define ALL(a) (a).begin(),(a).end()
#define ALLR(a) (a).rbegin(),(a).rend()
using ld = long double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
template<typename T> using V = vector<T>;
template<typename T> using P = pair<T, T>;
template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }
template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }
template<class S, class T> ostream& operator << (ostream& os, const pair<S, T> v){os << "(" << v.first << ", " << v.second << ")"; return os;}
template<typename T> ostream& operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<vector<T>> &v){ for(auto &e : v){os << e << "\n";} return os;}
struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
template <class T> void UNIQUE(vector<T> &x) {sort(ALL(x));x.erase(unique(ALL(x)), x.end());}
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
void fail() { cout << -1 << '\n'; exit(0); }
inline int popcount(const int x) { return __builtin_popcount(x); }
inline int popcount(const ll x) { return __builtin_popcountll(x); }
template<typename T> void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cerr<<v[i][0];for(ll j=1;j<w;j++)cerr spa v[i][j];cerr<<"\n";}};
template<typename T> void debug(vector<T>&v,ll n){if(n!=0)cerr<<v[0];
for(ll i=1;i<n;i++)cerr spa v[i];
cerr<<"\n";};
const ll INF = (1ll<<62);
// const ld EPS = 1e-10;
// const ld PI = acos(-1.0);
const ll mod = (int)1e9 + 7;
//const ll mod = 998244353;
//
template<typename T>
struct RangeSet{
set<pair<T,T>> st;
T TINF;
RangeSet(){
TINF=numeric_limits<T>::max()/2;
st.emplace(TINF,TINF);
st.emplace(-TINF,-TINF);
}
// [l,r] covered?
bool covered(T l,T r){
assert(l<=r);
auto ite=prev(st.lower_bound({l+1,l+1}));
return ite->first<=l and r<=ite->second;
}
bool covered(T x){
return covered(x,x);
}
// [l, r]. [-TINF,-TINF]
pair<T,T> covered_by(T l,T r){
assert(l<=r);
auto ite=prev(st.lower_bound({l+1,l+1}));
if(ite->first<=l and r<=ite->second) return *ite;
return make_pair(-TINF,-TINF);
}
pair<T,T> covered_by(T x){
return covered_by(x,x);
}
// insert[l,r],
T insert(T l,T r){
assert(l<=r);
auto ite=prev(st.lower_bound({l+1,l+1}));
if(ite->first<=l and r<=ite->second) return T(0);
T sum_erased=T(0);
if(ite->first<=l and l<=ite->second+1){
l=ite->first;
sum_erased+=ite->second-ite->first+1;
ite=st.erase(ite);
}else ite=next(ite);
while(r>ite->second){
sum_erased+=ite->second-ite->first+1;
ite=st.erase(ite);
}
if(ite->first-1<=r and r<=ite->second){
sum_erased+=ite->second-ite->first+1;
r=ite->second;
st.erase(ite);
}
st.emplace(l,r);
return r-l+1-sum_erased;
}
T insert(T x){
return insert(x,x);
}
// erase [l,r],
T erase(T l,T r){
assert(l<=r);
auto ite=prev(st.lower_bound({l+1,l+1}));
if(ite->first<=l and r<=ite->second){
// 1
if(ite->first<l) st.emplace(ite->first,l-1);
if(r<ite->second) st.emplace(r+1,ite->second);
st.erase(ite);
return r-l+1;
}
T ret=T(0);
if(ite->first<=l and l<=ite->second){
ret+=ite->second-l+1;//
if(ite->first<l) st.emplace(ite->first,l-1);
ite=st.erase(ite);//
}else ite=next(ite);
while(ite->second<=r){
ret+=ite->second-ite->first+1;
ite=st.erase(ite);
}
//
if(ite->first<=r and r<=ite->second){
ret+=r-ite->first+1;
if(r<ite->second) st.emplace(r+1,ite->second);
st.erase(ite);
}
return ret;
}
T erase(T x){
return erase(x,x);
}
// number of range
int size(){
return (int)st.size()-2;
}
// mex [x,~)
int mex(T x=0){
auto ite=prev(st.lower_bound({x+1,x+1}));
if(ite->first<=x and x<=ite->second) return ite->second+1;
else return x;
}
void output(){
cout<<"RangeSet : ";
for(auto &p:st){
if(p.first==-TINF or p.second==TINF) continue;
cout<<"["<<p.first<<", "<<p.second<<"] ";
}
cout<<"\n";
}
};
int main(){
ll D, Q;
cin >> D >> Q;
ll res = 0;
RangeSet<ll> rs;
REP(i, Q){
ll A, B;
cin >> A >> B;
rs.insert(A, B);
auto ran = rs.covered_by(A, B);
chmax(res, ran.second-ran.first+1);
cout << res << endl;
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0