#33459 (C++11) No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ

提出ソース

結果

問題	No.230 Splarraay ｽﾌﾟﾗﾚｪｰｲ
ユーザー	shimomire
提出日時	2015-06-20 03:18:11
言語	C++11 (gcc 11.4.0)
結果	WA
実行時間	-
コード長	6,938 bytes
コンパイル時間	927 ms
コンパイル使用メモリ	122,332 KB
実行使用メモリ	11,392 KB
最終ジャッジ日時	2024-07-07 04:36:45
合計ジャッジ時間	6,383 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	WA	-
testcase_02	WA	-
testcase_03	AC	2 ms 6,940 KB
testcase_04	AC	2 ms 6,940 KB
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	WA	-
testcase_12	WA	-
testcase_13	WA	-
testcase_14	AC	74 ms 11,264 KB
testcase_15	WA	-
testcase_16	WA	-
testcase_17	WA	-
testcase_18	WA	-
testcase_19	WA	-

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <cassert>// c
#include <iostream>// io
#include <iomanip>
#include <fstream>
#include <sstream>
#include <vector>// container
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <algorithm>// other
#include <complex>
#include <numeric>
#include <functional>
#include <random>
#include <regex>
using namespace std;

typedef long long ll;typedef unsigned long long ull;typedef long double ld;

#define ALL(c) c.begin(),c.end()
#define IN(l,v,r) (l<=v && v < r)
template<class T> void UNIQUE(T v){v.erase(unique(ALL(v)),v.end());}
//debug
#define DUMP(x) cerr << #x <<" = " << (x)
#define LINE() cerr<< " (L" << __LINE__ << ")"

struct range{
    struct Iter{
        int v,step;
        Iter& operator++(){v+=step;return *this;}
        bool operator!=(Iter& itr){return v<itr.v;}
        int& operator*(){return v;}
    };
    Iter i, n;
    range(int i, int n,int step):i({i,step}), n({n,step}){}
    range(int i, int n):range(i,n,1){}
    range(int n):range(0,n){}
    Iter& begin(){return i;}
    Iter& end(){return n;}
};
struct rrange{
    struct Iter{
        int v,step;
        Iter& operator++(){v-=step;return *this;}
        bool operator!=(Iter& itr){return v>itr.v;}
        int& operator*(){return v;}
    };
    Iter i, n;
    rrange(int i, int n,int step):i({i-1,step}), n({n-1,step}){}
    rrange(int i, int n):rrange(i,n,1){}
    rrange(int n) :rrange(0,n){}
    Iter& begin(){return n;}
    Iter& end(){return i;}
};

//input
template<typename T1,typename T2> istream& operator >> (istream& is,pair<T1,T2>& p){return is>>p.first>>p.second;}
template<typename T1> istream& operator >> (istream& is,tuple<T1>& t){return is >> get<0>(t);}
template<typename T1,typename T2> istream& operator >> (istream& is,tuple<T1,T2>& t){return is >> get<0>(t) >> get<1>(t);}
template<typename T1,typename T2,typename T3> istream& operator >> (istream& is,tuple<T1,T2,T3>& t){return is >>get<0>(t)>>get<1>(t)>>get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> istream& operator >> (istream& is,tuple<T1,T2,T3,T4>& t){return is >> get<0>(t)>>get<1>(t)>>get<2>(t)>>get<3>(t);}
template<typename T> istream& operator >> (istream& is,vector<T>& as){for(int i:range(as.size()))is >>as[i];return is;}
//output
template<typename T> ostream& operator << (ostream& os, const set<T>& ss){for(auto a:ss){if(a!=ss.begin())os<<" "; os<<a;}return os;}
template<typename T1,typename T2> ostream& operator << (ostream& os, const pair<T1,T2>& p){return os<<p.first<<" "<<p.second;}
template<typename K,typename V> ostream& operator << (ostream& os, const map<K,V>& m){bool isF=true;for(auto& p:m){if(!isF)os<<endl;os<<p;isF=false;}return os;}
template<typename T1> ostream& operator << (ostream& os, const tuple<T1>& t){return os << get<0>(t);}
template<typename T1,typename T2> ostream& operator << (ostream& os, const tuple<T1,T2>& t){return os << get<0>(t)<<" "<<get<1>(t);}
template<typename T1,typename T2,typename T3> ostream& operator << (ostream& os, const tuple<T1,T2,T3>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t);}
template<typename T1,typename T2,typename T3,typename T4> ostream& operator << (ostream& os, const tuple<T1,T2,T3,T4>& t){return os << get<0>(t)<<" "<<get<1>(t)<<" "<<get<2>(t)<<" "<<get<3>(t);}
template<typename T> ostream& operator << (ostream& os, const vector<T>& as){for(int i:range(as.size())){if(i!=0)os<<" "; os<<as[i];}return os;}
template<typename T> ostream& operator << (ostream& os, const vector<vector<T>>& as){for(int i:range(as.size())){if(i!=0)os<<endl; os<<as[i];}return os;}

// values
template<typename T> inline T INF(){assert(false);};
template<> inline int INF<int>(){return 1<<28;};
template<> inline ll INF<ll>(){return 1LL<<58;};
template<> inline double INF<double>(){return 1e16;};
template<> inline long double INF<long double>(){return 1e16;};

template<class T> inline T EPS(){assert(false);};
template<> inline int EPS<int>(){return 1;};
template<> inline ll EPS<ll>(){return 1LL;};
template<> inline double EPS<double>(){return 1e-8;};
template<> inline long double EPS<long double>(){return 1e-8;};

// min{2^r | n < 2^r}
template<typename T> T upper_pow2(T n){ T res=1;while(res<n)res<<=1;return res;}
// max{d | 2^d  <= n}
template<typename T> T msb(T n){ int d=62;while((1LL<<d)>n)d--;return d;}

template<typename T,typename U> T pmod(T v,U M){return (v%M+M)%M;}

ll gcd_positive(ll a,ll b) { return b == 0 ? a : gcd_positive(b,a%b); }
ll gcd(ll a,ll b) { return gcd_positive(abs(a), abs(b)); }
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

template<class T> class StarrySkyTree{
public:
    const int size,n2;
    vector<T> dat,lazy;

    StarrySkyTree(int n):size(n),n2(upper_pow2(size)){
        dat = vector<T>(n2*2,0); lazy = vector<T>(n2*2,-1); 
    }
    inline T get(int v){update(v);return dat[v+n2];}
    void set(int v,T a){
        v+=n2;dat[v]=a;
        propagate(v);
    }
    //+=x in [a,b)
    void lquery(int a,int b,T x){lquery(a,b,1,0,n2,x);}
    //+= in [a,b)
    T query(int a,int b){return query(a,b,1,0,n2);}
private:
    void propagate(int v){
        while(v!=1){
            v = v/2; update(v);
        }
    }

    void update(int v){
        int chl=2*v,chr=2*v+1;
        if(not (chl < n2*2)) return;
        
        if(lazy[v]!=-1){
            dat[chl] = lazy[v]*(1<< (msb(n2)-msb(chl)));lazy[chl]=lazy[v];
            dat[chr] = lazy[v]*(1<< (msb(n2)-msb(chr)));lazy[chr]=lazy[v];
        }
        dat[v] = (dat[chl] + dat[chr]);
        lazy[v]= -1;
    }

    void lquery(int a,int b,int v,int l,int r,T x){
        if(r<=a || b<=l)return;//out range
        if(a<=l && r<=b){
            dat[v] = x * (r-l);
            lazy[v] = x;
            propagate(v);
            return;
        }
        lquery(a,b,v*2,l,(l+r)/2,x);lquery(a,b,v*2+1,(l+r)/2,r,x);
    }
    T query(int a,int b,int v,int l,int r){//[a,b) on v:[l,r)
        if(r<=a || b<=l)return 0;//out range
        update(v);
        if(a<=l && r<=b)return dat[v];
        return (query(a,b,v*2,l,(l+r)/2) + query(a,b,v*2+1,(l+r)/2,r));
    }
};
class Main{
    public:

    void run(){
        int N;cin >> N;
        int Q;cin >> Q;

        ll a=0,b=0;

        StarrySkyTree<ll> as(N),bs(N);
        for(int q:range(Q)){
            int x,l,r;cin >> x >> l >> r;r++;
            if(x==0){
                ll av = as.query(l, r),bv = bs.query(l, r);
                if(av>bv)a+=av;
                else if(av<bv) b+=bv;
            }else if(x==1){
                as.lquery(l,r,1);bs.lquery(l,r,0);
            }else{
                as.lquery(l,r,0);bs.lquery(l,r,1);
            }
            //面倒なので伝搬
            as.query(0, N);
            bs.query(0, N);
        }
        a+=as.query(0,N);b+=bs.query(0, N);
        cout << make_tuple(a,b)<<endl;
    }
};

int main(){
    cout <<fixed<<setprecision(20);
    cin.tie(0);
    ios::sync_with_stdio(false);
    Main().run();
    return 0;
}

yukicoder

結果

テストケース

ソースコード