結果

問題 No.961 Vibrant Fillumination
ユーザー maroon_kuri
提出日時 2019-12-24 00:32:37
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
MLE  
(最新)
AC  
(最初)
実行時間 -
コード長 6,474 bytes
コンパイル時間 2,236 ms
コンパイル使用メモリ 192,672 KB
実行使用メモリ 814,592 KB
最終ジャッジ日時 2024-09-22 16:53:03
合計ジャッジ時間 12,070 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 32 MLE * 1 -- * 15
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
using pi=pair<int,int>;
using vi=vc<int>;
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
    return os<<"{"<<p.a<<","<<p.b<<"}";
}
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
    os<<"{";
    for(auto e:v)os<<e<<",";
    return os<<"}";
}
#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
    os<<t<<" ";
    dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,"Line:",__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif
using uint=unsigned;
using ull=unsigned long long;
template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
    return os<<vc<t>(all(a));
}
template<int i,class T>
void print_tuple(ostream&,const T&){
}
template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
    if(i)os<<",";
    os<<get<i>(t);
    print_tuple<i+1,T,Args...>(os,t);
}
template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
    os<<"{";
    print_tuple<0,tuple<Args...>,Args...>(os,t);
    return os<<"}";
}
void print(ll x,int suc=1){
    cout<<x;
    if(suc==1)
        cout<<"\n";
    if(suc==2)
        cout<<" ";
}
ll read(){
    ll i;
    cin>>i;
    return i;
}
vi readvi(int n,int off=0){
    vi v(n);
    rep(i,n)v[i]=read()+off;
    return v;
}
template<class T>
void print(const vector<T>&v,int suc=1){
    rep(i,v.size())
        print(v[i],i==int(v.size())-1?suc:2);
}
string readString(){
    string s;
    cin>>s;
    return s;
}
template<class T>
T sq(const T& t){
    return t*t;
}
//#define CAPITAL
void yes(bool ex=true){
    #ifdef CAPITAL
    cout<<"YES"<<endl;
    #else
    cout<<"Yes"<<endl;
    #endif
    if(ex)exit(0);
}
void no(bool ex=true){
    #ifdef CAPITAL
    cout<<"NO"<<endl;
    #else
    cout<<"No"<<endl;
    #endif
    if(ex)exit(0);
}
void possible(bool ex=true){
    #ifdef CAPITAL
    cout<<"POSSIBLE"<<endl;
    #else
    cout<<"Possible"<<endl;
    #endif
    if(ex)exit(0);
}
void impossible(bool ex=true){
    #ifdef CAPITAL
    cout<<"IMPOSSIBLE"<<endl;
    #else
    cout<<"Impossible"<<endl;
    #endif
    if(ex)exit(0);
}
constexpr ll ten(int n){
    return n==0?1:ten(n-1)*10;
}
const ll infLL=LLONG_MAX/3;
#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif
int topbit(signed t){
    return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
    return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
    return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
    return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
    return __builtin_popcount(t);
}
int popcount(ll t){
    return __builtin_popcountll(t);
}
bool ispow2(int i){
    return i&&(i&-i)==i;
}
int mask(int i){
    return (int(1)<<i)-1;
}
bool inc(int a,int b,int c){
    return a<=b&&b<=c;
}
template<class t> void mkuni(vc<t>&v){
    sort(all(v));
    v.erase(unique(all(v)),v.ed);
}
ll rand_int(ll l, ll r) { //[l, r]
    #ifdef LOCAL
    static mt19937_64 gen;
    #else
    static random_device rd;
    static mt19937_64 gen(rd());
    #endif
    return uniform_int_distribution<ll>(l, r)(gen);
}
template<class t>
int lwb(const vc<t>&v,const t&a){
    return lower_bound(all(v),a)-v.bg;
}
template<class t>
struct BIT2{
    vc<t> buf;
    int s;
    BIT2(int n=0){init(n);}
    void init(int n){buf.assign(s=n,0);}
    void add(int i,t v){
        for(;i<s;i+=(i+1)&(-i-1))
            buf[i]+=v;
    }
    t get(int i){
        t res=0;
        for(;i>=0;i-=(i+1)&(-i-1))
            res+=buf[i];
        return res;
    }
    t sum(int b,int e){
        return get(e-1)-get(b-1);
    }
    /*int kth(int k){
        int res=0;
        for(int i=topbit(s);i>=0;i--){
            int w=res+(1<<i);
            if(w<=s&&buf[w-1]<=k){
                k-=buf[w-1];
                res=w;
            }
        }
        return res;
    }*/
};
template<class t>
struct BIT{
    vc<t> buf;
    int s;
    BIT(int n=0){init(n);}
    void init(int n){buf.assign(s=n,0);}
    void add(int i,t v){
        for(;i<s;i+=(i+1)&(-i-1))
            buf[i]^=v;
    }
    t get(int i){
        t res=0;
        for(;i>=0;i-=(i+1)&(-i-1))
            res^=buf[i];
        return res;
    }
    t sum(int b,int e){
        return get(e-1)^get(b-1);
    }
    /*int kth(int k){
        int res=0;
        for(int i=topbit(s);i>=0;i--){
            int w=res+(1<<i);
            if(w<=s&&buf[w-1]<=k){
                k-=buf[w-1];
                res=w;
            }
        }
        return res;
    }*/
};
struct rect{
    int a,b,c,d;
};
const int T=200;
int sum[T*2+10][T*2+10];
signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout<<fixed<<setprecision(20);
    
    int n;cin>>n;
    int s=n*2;
    
    vi h=readvi(n);
    vvc<rect> relka(s);
    rep(i,n){
        int a,b,c,d,e;cin>>a>>b>>c>>d>>e;
        e--;
        relka[e].pb({a,b,c,d});
    }
    
    vvc<pi> qs(s);
    
    int q;cin>>q;
    vi ans(q);
    rep(i,q){
        int x,y;cin>>x>>y;
        qs[x].eb(y,i);
    }
    
    rep(w,n)if((int)relka[w].size()>=T){
        BIT2<int> bit(s);
        vvc<pi> rc(s);
        for(auto r:relka[w]){
            rc[r.a].eb(r.b,1);
            rc[r.a].eb(r.d,-1);
            rc[r.c].eb(r.b,-1);
            rc[r.c].eb(r.d,1);
        }
        rep(i,s){
            for(auto z:rc[i])
                bit.add(z.a,z.b);
            for(auto z:qs[i])if(bit.get(z.a))
                ans[z.b]^=h[w];
        }
    }
    {
        BIT<int> bit(s);
        vvc<pi> rc(s);
        rep(i,n)if(inc(1,relka[i].size(),T-1)){
            vi xs,ys;
            for(auto r:relka[i]){
                xs.pb(r.a);
                xs.pb(r.c);
                ys.pb(r.b);
                ys.pb(r.d);
            }
            mkuni(xs);
            mkuni(ys);
            int a=xs.size(),b=ys.size();
            rep(j,a)rep(k,b)
                sum[j][k]=0;
            for(auto r:relka[i]){
                r.a=lwb(xs,r.a);
                r.c=lwb(xs,r.c);
                r.b=lwb(ys,r.b);
                r.d=lwb(ys,r.d);
                sum[r.a][r.b]++;
                sum[r.a][r.d]--;
                sum[r.c][r.b]--;
                sum[r.c][r.d]++;
            }
            rep(j,a)rep(k,b-1)
                sum[j][k+1]+=sum[j][k];
            rep(j,a-1)rep(k,b)
                sum[j+1][k]+=sum[j][k];
            rep(j,a-1)rep(k,b-1)if(sum[j][k]){
                rc[xs[j]].eb(ys[k],h[i]);
                rc[xs[j]].eb(ys[k+1],h[i]);
                rc[xs[j+1]].eb(ys[k],h[i]);
                rc[xs[j+1]].eb(ys[k+1],h[i]);
            }
        }
        
        rep(i,s){
            for(auto z:rc[i])
                bit.add(z.a,z.b);
            for(auto z:qs[i])
                ans[z.b]^=bit.get(z.a);
        }
    }
    
    for(auto v:ans)
        print(v);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0