結果
問題 | No.255 Splarrraaay スプラーレェーーイ |
ユーザー |
![]() |
提出日時 | 2019-02-20 04:04:39 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,712 ms / 10,000 ms |
コード長 | 5,851 bytes |
コンパイル時間 | 2,372 ms |
コンパイル使用メモリ | 219,180 KB |
最終ジャッジ日時 | 2025-01-06 21:17:45 |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 |
コンパイルメッセージ
main.cpp:159:1: warning: ISO C++ forbids declaration of ‘main’ with no type [-Wreturn-type] 159 | main(){ | ^~~~
ソースコード
#include <bits/stdc++.h>using namespace std;/*#include "unistd.h"#define WA cout<<"char134217728";exit(0)#define RE throw#define TLE sleep(1000)*/#define FOR(i,a,b) for(int i=(a),i##formax=(b);i<i##formax;i++)#define FORR(i,a,b) for(int i=(a),i##formax=(b);i>=i##formax;i--)#define pb push_back#define mp make_pair#define fi first#define se second#define pcnt __builtin_popcount#define sz(x) (int)(x).size()#define maxs(x,y) x=max(x,y)#define mins(x,y) x=min(x,y)#define show(x) cout<<#x<<" = "<<x<<endl;#define all(a) (a.begin()),(a.end())#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)#define perm(c) sort(all(c));for(bool c##p=1;c##p;c##p=next_permutation(all(c)))#define uniq(v) sort(all(v));v.erase(unique(all(v)), v.end());#define bit(n) (1LL<<(n))#define randInt(l,r) (uniform_int_distribution<ll>(l,r)(rnd))#define randDouble(l,r) (uniform_real_distribution<double>(l,r)(rnd))#define dout(d) printf("%.12f\n",d)typedef long long ll;typedef __int128_t lll;typedef pair<int,int> pii;typedef pair<ll,ll> pll;template<class T>using V=vector<T>;template<class T>using VV=V<V<T>>;template<class T,class Y>ostream& operator<<(ostream& o,const pair<T,Y>& p){return o<<"("<<p.fi<<", "<<p.se<<")";}template<typename A,size_t N,typename T>void Fill(A (&array)[N],const T&v){fill((T*)array,(T*)(array+N),v);}lll gcd(lll a,lll b,lll &x,lll &y){if(!b){x=1;y=0;return a;}lll d=gcd(b,a%b,y,x);y-=a/b*x;return d;}ll gcd(ll a,ll b){lll x=0,y=0;return gcd(a,b,x,y);}ll modPow(lll a,lll n,ll m){if(!a)return a;lll p=1;for(;n>0;n>>=1,a=a*a%m)if(n&1)p=p*a%m;return(ll)p;}bool isPrime(ll n){if(n<2||n%2==0)return n==2;lll t=n-1,d=t/(t&-t);for(lll a:{2,325,9375,28178,450775,9780504,1795265022})if(a%n){for(t=d,a=modPow(a,t,n);t!=n-1&&a!=1&&a!=n-1;a=a*a%n,t=t*2%n);if(a!=n-1&&t%2==0)return 0;}return 1;}const int IINF = 1e9+6;const ll LINF = 1e18;const ll MOD = 1000000000000000009;const double PI = acos(-1);const double EPS = 1e-10;static random_device rd;static mt19937 rnd(rd());const int N = 1e5;map<ll, int> Z;V<ll> RZ;struct StarrySky{typedef ll V;typedef int B;const V EV = 0;const B EB = 0;inline V mVV(const V&a, const V&b){// node値同士のmerge. seg_treeと同様return a+b;}inline V mBV(const V&v, const ll&l, const B&b){// node値v,長さlのnodeにbのbuffが掛かった後のnode値return v+l*b;}inline B mBB(const B&a, const B&b){// 既にaのbuffがかかっているnodeに加えてbのbuffが掛かった後のbuff値return a+b;}inline V uV(const V&v, const ll&l){// vがl個入ったnodeの値. update時に使うreturn v*l;}//###################################################int n;vector<V> vv; // node値vector<V> vl; // lazy値vector<B> vb; // buff値vector<bool> vz; // lazy状態かどうかvoid init(int m){n = 1<<(32-__builtin_clz(m-1));vv = vector<V>(2*n-1, EV);vl.resize(2*n-1);vb = vector<B>(2*n-1, EB);vz = vector<bool>(2*n-1, false);}void init(vector<V>&v){init(v.size());for(int j=0; j<v.size(); j++) vv[j+n-1] = v[j];for(int j=n-2; j>=0; j--) vv[j] = mVV(vv[j*2+1], vv[j*2+2]);}inline void ref(int k, int l, int r){int k1 = k*2+1, k2=k*2+2, m=(l+r)/2;if(vz[k]){vz[k1] = vz[k2] = true;vl[k1] = vl[k2] = vl[k];vb[k1] = vb[k2] = EB;vv[k1] = uV(vl[k], RZ[m]-RZ[l]);vv[k2] = uV(vl[k], RZ[r]-RZ[m]);vz[k] = false;}if(vb[k] != EB){vv[k1] = mBV(vv[k1], RZ[m]-RZ[l], vb[k]); vb[k1] = mBB(vb[k1], vb[k]);vv[k2] = mBV(vv[k2], RZ[r]-RZ[m], vb[k]); vb[k2] = mBB(vb[k2], vb[k]);vb[k] = EB;}}inline V _buff(int a,int b,int k,int l,int r, B v){if(r<=a||b<=l){}else if(a<=l&&r<=b){vv[k] = mBV(vv[k], RZ[r]-RZ[l], v);vb[k] = mBB(vb[k], v);}else{ref(k, l, r);vv[k] = mVV(_buff(a, b, k*2+1, l, (l+r)/2, v),_buff(a, b, k*2+2, (l+r)/2, r, v));}return vv[k];}void buff(int a, int b, B v){_buff(a, b, 0, 0, n, v);}inline V _update(int a, int b, int k, int l, int r, V v){if(r<=a||b<=l){}else if(a<=l&&r<=b){vv[k] = uV(v, RZ[r]-RZ[l]);vb[k] = EB;vz[k] = true;}else{ref(k, l, r);vv[k] = mVV(_update(a, b, k*2+1, l, (l+r)/2, v),_update(a, b, k*2+2, (l+r)/2, r, v));}return vv[k];}void update(int a, int b, V v){_update(a, b, 0, 0, n, v);}inline V _query(int a,int b,int k,int l,int r){if(r<=a||b<=l) return EV;if(a<=l&&r<=b) return vv[k];ref(k, l, r);return mVV(_query(a, b, k*2+1, l, (l+r)/2),_query(a, b, k*2+2, (l+r)/2, r));}V query(int a,int b){return _query(a, b, 0, 0, n);}} ss[5];ll n, q;V<ll> X, L, R;ll tmp[5], ans[]={0,0,0,0,0};main(){cin.tie(0);ios::sync_with_stdio(false);cin >> n >> q;FOR(_, 0, q){ll x, l, r;cin >> x >> l >> r;x--;r++;X.pb(x);L.pb(l);R.pb(r);RZ.pb(l);RZ.pb(r);}RZ.pb(0);RZ.pb(n);uniq(RZ);FOR(i, 0, sz(RZ)) Z[RZ[i]] = i;FOR(i, 0, 5) ss[i].init(sz(Z));FOR(_, 0, q){ll x = X[_];int l=Z[L[_]], r=Z[R[_]];if(x<0){FOR(i, 0, 5) tmp[i] = ss[i].query(l, r);ll m = -1; FOR(i, 0, 5) maxs(m, tmp[i]);int idx = -1;FOR(i, 0, 5) if(m==tmp[i]){if(idx >= 0) goto bad;idx = i;}ans[idx] = (ans[idx]+m)%MOD;}else{FOR(i, 0, 5){if(x==i){ss[i].buff(l, r, 1);}else{ss[i].update(l, r, 0);}}}bad:;}FOR(i, 0, 5) ans[i] += ss[i].query(0, sz(Z));FOR(i, 0, 5) cout << ans[i]%MOD << (i==4 ? "\n" : " ");}