oj.uz

답안 #204642

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
204642 2020-02-26T12:52:21 Z coldEr66 Long Mansion (JOI17_long_mansion) C++14
100 / 100
 383 ms 46200 KB 
#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;

int n;
int c[MAXn];
vector<int> key[MAXn];
int ld[MAXn],rd[MAXn];
int L[MAXn],R[MAXn];
bool lchk(int x){
    return L[x] > 0 && rd[L[x]-1] != n && rd[L[x]-1] <= R[x];
}
bool rchk(int x){
    return R[x] < n-1 && ld[R[x]] != -1 && ld[R[x]] >= L[x];
}
int main(){
    IOS();
    cin >> n;
    REP (i,n-1) cin >> c[i];
    REP (i,n) {
        int x;
        cin >> x;
        REP (j,x) {
            int type;
            cin >> type;
            key[type].eb(i);
        }
    }

    REP (i,n-1) {
        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];
        }
    }
    pary(ld,ld+n);
    pary(rd,rd+n);
    REP (i,n) {
        L[i] = R[i] = i;
        while (1) {
            if (lchk(i)) {
                R[i] = max(R[i],R[L[i]-1]);
                L[i] = min(L[i],L[L[i]-1]);
            }
            else if (rchk(i)) {
                R[i]++;
            }
            else break;
        }
    }

    int q;
    cin >> q;
    while (q--) {
        int x,y;
        cin >> x >> y;
        x--, y--;
        if (L[x] <= y && y <= R[x]) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 12280 KB Output is correct
2 Correct 14 ms 12280 KB Output is correct
3 Correct 14 ms 12408 KB Output is correct
4 Correct 14 ms 12152 KB Output is correct
5 Correct 15 ms 12280 KB Output is correct
6 Correct 15 ms 12280 KB Output is correct
7 Correct 15 ms 12280 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 12280 KB Output is correct
2 Correct 14 ms 12280 KB Output is correct
3 Correct 14 ms 12408 KB Output is correct
4 Correct 14 ms 12152 KB Output is correct
5 Correct 15 ms 12280 KB Output is correct
6 Correct 15 ms 12280 KB Output is correct
7 Correct 15 ms 12280 KB Output is correct
8 Correct 139 ms 18168 KB Output is correct
9 Correct 135 ms 18152 KB Output is correct
10 Correct 148 ms 18424 KB Output is correct
11 Correct 140 ms 18844 KB Output is correct
12 Correct 121 ms 17784 KB Output is correct
13 Correct 135 ms 18296 KB Output is correct
14 Correct 138 ms 18300 KB Output is correct
15 Correct 130 ms 18344 KB Output is correct
16 Correct 129 ms 18044 KB Output is correct
17 Correct 132 ms 18296 KB Output is correct
18 Correct 134 ms 18456 KB Output is correct
19 Correct 134 ms 18424 KB Output is correct
20 Correct 133 ms 18424 KB Output is correct
21 Correct 131 ms 18168 KB Output is correct
22 Correct 137 ms 18172 KB Output is correct
23 Correct 143 ms 18040 KB Output is correct
24 Correct 141 ms 18040 KB Output is correct
25 Correct 129 ms 18168 KB Output is correct
26 Correct 133 ms 18168 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 232 ms 18172 KB Output is correct
2 Correct 218 ms 24956 KB Output is correct
3 Correct 218 ms 24928 KB Output is correct
4 Correct 215 ms 25208 KB Output is correct
5 Correct 225 ms 25208 KB Output is correct
6 Correct 196 ms 23416 KB Output is correct
7 Correct 199 ms 23400 KB Output is correct
8 Correct 195 ms 23288 KB Output is correct
9 Correct 198 ms 23288 KB Output is correct
10 Correct 207 ms 23288 KB Output is correct
11 Correct 192 ms 23288 KB Output is correct

Subtask #4
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 12280 KB Output is correct
2 Correct 14 ms 12280 KB Output is correct
3 Correct 14 ms 12408 KB Output is correct
4 Correct 14 ms 12152 KB Output is correct
5 Correct 15 ms 12280 KB Output is correct
6 Correct 15 ms 12280 KB Output is correct
7 Correct 15 ms 12280 KB Output is correct
8 Correct 139 ms 18168 KB Output is correct
9 Correct 135 ms 18152 KB Output is correct
10 Correct 148 ms 18424 KB Output is correct
11 Correct 140 ms 18844 KB Output is correct
12 Correct 121 ms 17784 KB Output is correct
13 Correct 135 ms 18296 KB Output is correct
14 Correct 138 ms 18300 KB Output is correct
15 Correct 130 ms 18344 KB Output is correct
16 Correct 129 ms 18044 KB Output is correct
17 Correct 132 ms 18296 KB Output is correct
18 Correct 134 ms 18456 KB Output is correct
19 Correct 134 ms 18424 KB Output is correct
20 Correct 133 ms 18424 KB Output is correct
21 Correct 131 ms 18168 KB Output is correct
22 Correct 137 ms 18172 KB Output is correct
23 Correct 143 ms 18040 KB Output is correct
24 Correct 141 ms 18040 KB Output is correct
25 Correct 129 ms 18168 KB Output is correct
26 Correct 133 ms 18168 KB Output is correct
27 Correct 232 ms 18172 KB Output is correct
28 Correct 218 ms 24956 KB Output is correct
29 Correct 218 ms 24928 KB Output is correct
30 Correct 215 ms 25208 KB Output is correct
31 Correct 225 ms 25208 KB Output is correct
32 Correct 196 ms 23416 KB Output is correct
33 Correct 199 ms 23400 KB Output is correct
34 Correct 195 ms 23288 KB Output is correct
35 Correct 198 ms 23288 KB Output is correct
36 Correct 207 ms 23288 KB Output is correct
37 Correct 192 ms 23288 KB Output is correct
38 Correct 369 ms 36300 KB Output is correct
39 Correct 383 ms 37824 KB Output is correct
40 Correct 329 ms 33232 KB Output is correct
41 Correct 360 ms 35400 KB Output is correct
42 Correct 240 ms 24952 KB Output is correct
43 Correct 238 ms 24852 KB Output is correct
44 Correct 330 ms 31408 KB Output is correct
45 Correct 343 ms 31760 KB Output is correct
46 Correct 357 ms 31968 KB Output is correct
47 Correct 242 ms 25056 KB Output is correct
48 Correct 217 ms 24568 KB Output is correct
49 Correct 312 ms 30860 KB Output is correct
50 Correct 324 ms 31352 KB Output is correct
51 Correct 345 ms 32480 KB Output is correct
52 Correct 294 ms 32840 KB Output is correct
53 Correct 334 ms 39284 KB Output is correct
54 Correct 382 ms 46200 KB Output is correct
55 Correct 367 ms 39496 KB Output is correct