結果

問題 No.255 Splarrraaay ｽﾌﾟﾗｰﾚｪｰｰｲ
ユーザー fumiphysfumiphys
提出日時 2019-10-15 00:56:15
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 4,207 ms / 10,000 ms
コード長 7,282 bytes
コンパイル時間 2,689 ms
コンパイル使用メモリ 208,096 KB
実行使用メモリ 200,592 KB
最終ジャッジ日時 2024-06-07 04:56:01
合計ジャッジ時間 43,782 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4,207 ms
200,456 KB
testcase_01 AC 4,153 ms
200,588 KB
testcase_02 AC 3,841 ms
200,592 KB
testcase_03 AC 3,242 ms
200,452 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 3,825 ms
200,468 KB
testcase_06 AC 3,802 ms
200,464 KB
testcase_07 AC 3,873 ms
200,460 KB
testcase_08 AC 3,842 ms
200,464 KB
testcase_09 AC 3,842 ms
200,448 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
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;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const ll mod = (ll)(1e18) + 9;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

template<typename T, typename E>
struct LazySegmentTree_ {
  function<T(T, T)> f; // aggregation
  function<E(E, E)> h; // update lazy element
  function<T(T, E, int)> p; // update element with lazy element
  int n;
  T def;
  E l_def;
  vector<T> vec;
  vector<E> lazy;
  LazySegmentTree_(){}
  LazySegmentTree_(int n_, function<T(T, T)> f, T def,
                   function<E(E, E)> h, E l_def, function<T(T, E, int)> p,
                   vector<T> v=vector<T>()): f(f), def(def), h(h), l_def(l_def), p(p){

    // initialize vector
    n = 1;
    while(n < n_){
      n *= 2;
    }
    vec = vector<T>(2*n-1, def);
    lazy = vector<E>(2*n-1, l_def);

    // initialize segment tree
    for(int i = 0; i < v.size(); i++){
      vec[i + n - 1] = v[i];
    }
    for(int i = n - 2; i >= 0; i--){
      vec[i] = f(vec[2*i+1], vec[2*i+2]);
    }
  }
  void eval(int k, int len){
    if(lazy[k] != l_def){
      if(k < n - 1){
        lazy[2*k+1] = h(lazy[2*k+1], lazy[k]);
        lazy[2*k+2] = h(lazy[2*k+2], lazy[k]);
      }
      vec[k] = p(vec[k], lazy[k], len);
      lazy[k] = l_def;
    }
  }
  T update(int a, int b, const E &val, int k, int l, int r){
    eval(k, r - l);
    if(r <= a || b <= l){
      return vec[k];
    }else if(a <= l && r <= b){
      lazy[k] = h(lazy[k], val);
      eval(k, r - l);
      return vec[k];
    }else{
      return vec[k] = f(update(a, b, val, 2*k+1, l, (l+r)/2),
                        update(a, b, val, 2*k+2, (l+r)/2, r));
    }
  }
  T update(int a, int b, E val){
    return update(a, b, val, 0, 0, n);
  }
  // [l, r) -> [a, b) (at k)
  T query(int a, int b, int k, int l, int r){
    eval(k, r - l);
    if(r <= a || b <= l)return def;
    if(a <= l && r <= b)return vec[k];
    T ld = query(a, b, 2*k+1, l, (l+r)/2);
    T rd = query(a, b, 2*k+2, (l+r)/2, r);
    return f(ld, rd);
  }
  T query(int a, int b){
    return query(a, b, 0, 0, n);
  }
};

template<typename T, typename E>
using LazySegmentTree = struct LazySegmentTree_<T, E>;
using LazySegmentTreeI = LazySegmentTree<int, int>;
using LazySegmentTreeL = LazySegmentTree<long long, long long>;


int main(int argc, char const* argv[])
{
  ll n; cin >> n;
  int q; cin >> q;
  vector<int> x(q);
  vector<ll> l(q), r(q);
  rep(i, q)cin >> x[i] >> l[i] >> r[i];
  vector<ll> X;
  X.pb(0);
  X.pb(n);
  rep(i, q){
    X.pb(l[i]);
    X.pb(r[i] + 1);
  }
  sort(all(X)); UNIQUE(X);
  map<ll, int> mp;
  rep(i, sz(X))mp[X[i]] = i;
  vector<LazySegmentTree<pair<ll, ll>, pair<ll, int>>> seg(5);
  vector<pair<ll, ll>> ini(sz(X));
  rep(j, sz(X)){
    ini[j] = mk(0, (j + 1 == sz(X) ? n + 1: X[j+1]) - X[j]);
  }
  rep(i, 5){
    seg[i] =
    LazySegmentTree<pair<ll, ll>, pair<ll, int>>(
      sz(X),
      [](pair<ll, ll> a, pair<ll, ll> b){
        return mk((a.first + b.first) % mod, (a.second + b.second) % mod);
      },
      mk(0, 0),
      [](pair<ll, int> a, pair<ll, int> b){
        if(a.first == -linf)return b;
        if(b.second == 1){
          return b;
        }
        if(a.second == -1 && b.second == -1){
          return mk((a.first + b.first) % mod, -1);
        }
        return mk((a.first + b.first) % mod, 1);
      },
      mk(-linf, -linf),
      [](pair<ll, ll> a, pair<ll, int> b, int c){
        if(b.second == -1){
          return mk((a.first + a.second * (b.first % mod) % mod) % mod, a.second);
        }
        return mk(a.second * (b.first % mod) % mod, a.second);
      },
      ini
    );
  }
  vector<ll> res(5, 0);
  rep(i, q){
    if(x[i] == 0){
      int L = mp[l[i]];
      int R = mp[r[i] + 1];
      ll maxi = -1;
      vector<int> can;
      rep(j, 5){
        ll tmp = seg[j].query(L, R).first;
        if(tmp > maxi){
          maxi = tmp;
          can.clear();
          can.pb(j);
        }else if(tmp == maxi){
          can.pb(j);
        }
      }
      if(sz(can) == 1){
        (res[can[0]] += maxi) %= mod;
      }
    }else{
      x[i]--;
      int L = mp[l[i]];
      int R = mp[r[i] + 1];
      rep(j, 5){
        if(x[i] != j){
          seg[j].update(L, R, mk(0, 1));
        }else{
          seg[j].update(L, R, mk(1, -1));
        }
      }
    }
    /*rep(k, 5){
      rep(j, sz(X)){
        cerr << seg[k].query(j, j + 1).first << "\n "[j + 1 != sz(X)];
      }
    }
    cerr << res << endl;
    cerr << endl;*/
  }
  rep(i, 5){
    (res[i] += seg[i].query(0, sz(X)).first) %= mod;
  }
  cout << res << endl;
  return 0;
}
0