結果
| 問題 |
No.674 n連勤
|
| ユーザー |
 igeee
|
| 提出日時 | 2025-05-22 00:16:25 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 59 ms / 2,000 ms |
| コード長 | 6,256 bytes |
| コンパイル時間 | 9,895 ms |
| コンパイル使用メモリ | 333,892 KB |
| 実行使用メモリ | 7,844 KB |
| 最終ジャッジ日時 | 2025-05-22 00:16:38 |
| 合計ジャッジ時間 | 7,911 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge4 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 17 |
ソースコード
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)
#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)
#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)
#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)
#define each(p,a) for(auto &p:a)
typedef vector<ll> vll;
typedef vector<pair<ll ,ll>> vpll;
typedef vector<vector<ll>> vvll;
typedef set<ll> sll;
typedef map<ll , ll> mpll;
typedef pair<ll ,ll> pll;
typedef tuple<ll , ll , ll> tpl3;
#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)
#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)
#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)
#define all(a) (a).begin(),(a).end()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define sz(x) (ll)x.size()
// << std::fixed << std::setprecision(10)
const ll INF = 1LL << 60;
const ld EPS = 1e-9;
inline ll lfloor(ll x,ll m){return (x - ((x % m+ m)%m))/m;}
inline ll positive_mod(ll a,ll m){return (a % m + m)%m;}
inline ll popcnt(ull a){ return __builtin_popcountll(a);}
//0indexed
inline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}
inline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}
template<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}
template<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}
template<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;}
template<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << "{" << p.first << "," << p.second << "}";return os;}
template<class... T>void input(T&... a){(cin >> ... >> a);}
void print(){cout << endl;}
template<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}
template<class T> void pspace(const T& a){ cout << a << ' ';}
void perr(){cerr << endl;}
template<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}
void yes(bool i = true){ return print(i?"yes":"no"); }
void Yes(bool i = true){ return print(i?"Yes":"No"); }
void YES(bool i = true){ return print(i?"YES":"NO"); }
template <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}
template <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}
template <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}
template <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}
//grid探索用
vector<ll> _ta = {0,0,1,-1,1,1,-1,-1};
vector<ll> _yo = {1,-1,0,0,1,-1,1,-1};
bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}
ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}
ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;}
const ll MOD9 = 998244353LL;
const ll MOD10 = 1000000007LL;
//ref https://atcoder.jp/contests/abc256/submissions/32647023
//verify https://atcoder.jp/contests/adt_all_20250520_1/submissions/66026478
template<class T>
struct RangeSet{
set<pair<T,T>> se;
T TINF;
RangeSet(T tinf):TINF{tinf}{ //INFの値を定義する
se.emplace(-TINF,-TINF);
se.emplace(TINF,TINF);
}
T insert(T l,T r) {//半開区間
auto itl = se.upper_bound({l,TINF}), itr = se.upper_bound({r,TINF});
if (itl != se.begin() && (--itl)->second < l) itl++;
T ret = T{0};
T minus = T{0};
if (itl != itr) {
l = min(l , itl->first);
r = max(r, prev(itr)->second);
minus += itl->second - itl->first;
minus += itr->second - itr->first;
se.erase(itl,itr);
}
se.insert({l,r});
ret += r-l;
ret -= minus;
return ret;
}
T insert(T x){
return insert(x,x+1);
}
bool count(T x){
auto it = prev(se.lower_bound({x+1,x+1}));
return (it->first <= x && x <= it->second);
}
//ref https://mugen1337.github.io/procon/DataStructure/RangeSet.hpp
//減少量(正の値)を返す
T erase(T l,T r){
assert(l<r);
auto ite=prev(se.lower_bound({l+1,l+1}));
if(ite->first<=l and r<=ite->second){
// 完全に1つの区間に包含されている
if(ite->first<l) se.emplace(ite->first,l);
if(r<ite->second) se.emplace(r,ite->second);
se.erase(ite);
return r-l;
}
T ret=T(0);
if(ite->first<=l and l<=ite->second){
ret += ite->second -l;
if(ite->first<l) se.emplace(ite->first,l);
ite=se.erase(ite);// 次へ
}else ite=next(ite);
while(ite->second<=r){
ret += ite->second - ite->first;
ite=se.erase(ite);
}
// 右端が区間の間にあるか
if(ite->first<=r and r<ite->second){
ret += r-ite->first;
se.emplace(r,ite->second);
se.erase(ite);
}
return ret;
}
T erase(T x){
return erase(x,x+1);
}
// number of range
int size(){
return (int)se.size()-2;
}
T rangesize(T x){
auto it = prev(se.lower_bound({x+1,x+1}));
if(it->first <= x && x <= it->second){
return it->second - it->first;
}else{
return T{0};
}
}
T mex(T x = 0){
auto [nowf,nows] = *prev(se.lower_bound({x+1,x+1}));
if(nowf <=x && x <= nows){
return nows+1;
}else{
return x;
}
}
};
int main(){
ios::sync_with_stdio(false);cin.tie(nullptr);
LL(d,q);
RangeSet<ll> se(INF);
ll ans = 0;
rep(i,q){
LL(a,b);
se.insert(a,b+1);
chmax(ans,se.rangesize(a));
cout << ans << endl;
}
}