Submission #204481

#	Time	Username	Problem	Language	Result	Execution time	Memory
204481		coldEr66	Long Mansion (JOI17_long_mansion)	C++14	0 / 100	180 ms	262148 KiB

long_mansion

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<int,int> ii;
typedef pair<ii,int> iii;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define RREP(i,n) for (int i=n-1;i>=0;i--)
#define RST(i,n) memset(i,n,sizeof i)
#define SZ(a) (ll)a.size()
#define ALL(a) a.begin(),a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#ifdef cold66
#define debug(...) do{\
    fprintf(stderr,"%s - %d (%s) = ",__PRETTY_FUNCTION__,__LINE__,#__VA_ARGS__);\
    _do(__VA_ARGS__);\
}while(0)
template<typename T>void _do(T &&_x){cerr<<_x<<endl;}
template<typename T,typename ...S> void _do(T &&_x,S &&..._t){cerr<<_x<<", ";_do(_t...);}
template<typename _a,typename _b> ostream& operator << (ostream &_s,const pair<_a,_b> &_p){return _s<<"("<<_p.X<<","<<_p.Y<<")";}
template<typename It> ostream& _OUTC(ostream &_s,It _ita,It _itb)
{
    _s<<"{";
    for(It _it=_ita;_it!=_itb;_it++)
    {
        _s<<(_it==_ita?"":",")<<*_it;
    }
    _s<<"}";
    return _s;
}
template<typename _a> ostream &operator << (ostream &_s,vector<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a> ostream &operator << (ostream &_s,set<_a> &_c){return _OUTC(_s,ALL(_c));}
template<typename _a,typename _b> ostream &operator << (ostream &_s,map<_a,_b> &_c){return _OUTC(_s,ALL(_c));}
template<typename _t> void pary(_t _a,_t _b){_OUTC(cerr,_a,_b);cerr<<endl;}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() ios_base::sync_with_stdio(0);cin.tie(0);
#endif // cold66
//}
template<class T> inline bool chkmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool chkmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> using MaxHeap = priority_queue<T>;
template<class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;

const ll MAXn=5e5+5,MAXlg=__lg(MAXn)+2;
const ll MOD=1000000007;
const ll INF=0x3f3f3f3f;


struct sparse_table{
    int n;
    ii t[MAXn][MAXlg]; // first:min, second:max
    void init(int *dt,int _n,int c) {
        n = _n;
        REP (i,_n) t[i][0] = ii(dt[i]-c*i,dt[i]-c*i);
    }
    void build() {
        REP1 (j,MAXlg-1) {
            REP (i,n) {
                if (i + (1<<(j-1)) < n) {
                    t[i][j].X = min(t[i][j-1].X,t[i+(1<<(j-1))][j-1].X);
                    t[i][j].Y = max(t[i][j-1].Y,t[i+(1<<(j-1))][j-1].Y);
                }
            }
        }
    }
    ii query(int l,int r){
        int tmp = __lg(r-l+1);
        ii ret;
        ret.X = min(t[l][tmp].X,t[r-(1<<tmp)+1][tmp].X);
        ret.Y = min(t[l][tmp].Y,t[r-(1<<tmp)+1][tmp].Y);
        return ret;
    }
};
int n,nn;
int c[MAXn];
vector<int> key[MAXn];
int ld[MAXn],rd[MAXn];
sparse_table t1,t2,t3,t4;
int main(){
    IOS();
    cin >> n;
    nn = n-1;
    REP (i,nn) cin >> c[i];
    REP (i,n) {
        int x;
        cin >> x;
        REP (j,x) {
            int type;
            cin >> type;
            key[type].eb(i);
        }
    }

    REP (i,nn) {
        if (!SZ(key[c[i]])) {
            ld[i] = -1;
            rd[i] = n;
            continue;
        }
        int it = (int)(upper_bound(ALL(key[c[i]]),i) - key[c[i]].begin());
        if (it == 0) {
            ld[i] = -1;
            rd[i] = key[c[i]][it];
        }
        else if (it == SZ(key[c[i]])) {
            ld[i] = key[c[i]].back();
            rd[i] = n;
        }
        else {
            ld[i] = key[c[i]][it-1];
            rd[i] = key[c[i]][it];
        }
    }
    t1.init(ld,nn,0);
    t2.init(rd,nn,0);
    t3.init(ld,nn,1); // only go right directly
    t4.init(rd,nn,1); // only go left directly
    t1.build();
    t2.build();
    t3.build();
    t4.build();
    debug("ALIVE");

    int q;
    cin >> q;
    while (q--) {
        int x,y;
        cin >> x >> y;
        x--, y--;
        if (x < y) {
            int l = -1, r = x;
            while (l != r-1) {
                int mid = (l+r)>>1;
                ii tmp1 = t2.query(mid,x-1);
                ii tmp2 = t4.query(mid,x-1);
                if (tmp1.Y <= y && tmp2.X >= 1) r = mid;
                else l = mid;
            }
            ii tmp = t1.query(x,y-1);
            if (tmp.X >= r) cout << "YES" << endl;
            else cout << "NO" << endl;
        }
        else {
            int l = x, r = n;
            while (l != r-1) {
                int mid = (l+r)>>1;
                ii tmp1 = t1.query(x,mid-1);
                ii tmp2 = t3.query(x,mid-1);
                if (tmp1.X >= y && tmp2.Y <= 0) l = mid;
                else r = mid;
            }
            ii tmp = t2.query(y,x-1);
            if (tmp.Y <= l) cout << "YES" << endl;
            else cout << "NO" << endl;
        }
    }
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 15
• Subtask 4: 0 / 75