oj.uz

답안 #1080353

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1080353 2024-08-29T09:03:56 Z coldbr3w Long Mansion (JOI17_long_mansion) C++17
25 / 100
 3000 ms 136528 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define ll int
#define pll pair<int, int>
#define pb push_back
#define F first
#define S second  
#define all(x) (x).begin(), (x).end()
 
const ll N = 1e6 + 100;
const ll inf = 1e9;
const ll mod = 1e9 + 7;
const ll block = 230;
ll n, q;
ll c[N], pos[N];
ll L[N][20], R[N][20], l[N], r[N];
struct segment_tree_max{
    ll n;
    vector<ll>st;
    void init(ll _n){
        n = _n;
        st.clear(); st.resize(4 * n + 10, -inf);
    }
    void update(ll id, ll l, ll r, ll left, ll right, ll val){
        if(l > right || r < left) return;
        if(left <= l && r <= right){
            st[id] = max(st[id], val);
            return;
        }
        ll mid = (l + r) / 2;
        update(2 * id, l, mid, left, right, val);
        update(2 * id + 1, mid + 1, r, left, right, val);
        st[id] = max(st[2 * id], st[2 * id + 1]);
    }
    ll get(ll id, ll l, ll r, ll left, ll right){
        if(l > right || r < left) return -inf;
        if(left <= l && r <= right) return st[id];
        ll mid = (l + r) / 2;
        return max(get(2 * id, l, mid, left, right), get(2 * id + 1, mid + 1, r, left, right));
    }
    void update(ll l, ll r, ll val){update(1,1,n,l,r,val);}
    ll get(ll l, ll r){return get(1,1,n,l,r);}
} stmax;
struct segment_tree_min{
    ll n;
    vector<ll>st;
    void init(ll _n){
        n = _n;
        st.clear(); st.resize(4 * n + 10, inf);
    }
    void update(ll id, ll l, ll r, ll left, ll right, ll val){
        if(l > right || r < left) return;
        if(left <= l && r <= right){
            st[id] = min(st[id], val);
            return;
        }
        ll mid = (l + r) / 2;
        update(2 * id, l, mid, left, right, val);
        update(2 * id + 1, mid + 1, r, left, right, val);
        st[id] = min(st[2 * id], st[2 * id + 1]);
    }
    ll get(ll id, ll l, ll r, ll left, ll right){
        if(l > right || r < left) return inf;
        if(left <= l && r <= right) return st[id];
        ll mid = (l + r) / 2;
        return min(get(2 * id, l, mid, left, right), get(2 * id + 1, mid + 1, r, left, right));
    }
    void update(ll l, ll r, ll val){update(1,1,n,l,r,val);}
    ll get(ll l, ll r){return get(1,1,n,l,r);}
} stmin;
vector<ll>g[N];
ll get_L(ll l, ll r){
	ll p = 31 - __builtin_clz(r - l + 1);
	return min(L[l][p], L[r - (1 << p) + 1][p]);
}
ll get_R(ll l, ll r){
	ll p = 31 - __builtin_clz(r - l + 1);
	return max(R[l][p], R[r - (1 << p) + 1][p]);
}
void build(){
	for(int i = 1; i <= n;i++){
		if(i >= 2) L[i][0] = (pos[c[i - 1]] == 0 ? -inf : pos[c[i-1]]);
		else L[i][0] = -inf;
		for(auto x : g[i]) pos[x] = i;
	}
	for(int i = 1; i <= n - 1;i++) pos[c[i]] = 0;
	for(int i = n; i >= 1;i--){
		if(i <= n - 1) R[i][0] = (pos[c[i]] == 0 ? inf : pos[c[i]]);
		else R[i][0] = inf;
		for(auto x : g[i]) pos[x] = i;
	}
	for(int j = 1; j <= 19;j++){
		for(int i = 1; i + (1 << j) <= n + 1;i++){
			L[i][j] = min(L[i][j-1], L[i + (1 << (j - 1))][j-1]);
			R[i][j] = max(R[i][j-1], R[i + (1 << (j - 1))][j-1]);
		}
	}
	for(int i = 1; i <= n;i++){
		ll x = i, y = i;
		while(1){
			pll lst = {x, y};
			if(x > 1){
				ll l = 1, r = x - 1, pos = -1;
				while(l <= r){
					ll mid = (l + r) / 2;
					if(get_R(mid, x - 1) <= y) pos = mid, r = mid - 1;
					else l = mid + 1;
				}
				if(pos != -1){
					ll mn = stmin.get(pos, y), mx = stmax.get(pos, y); 
					x = min({x, mn, pos}); y = max(y, mx);
				}
			}
			if(y < n){
				ll l = y + 1, r = n, pos = -1;
				while(l <= r){
					ll mid = (l + r) / 2;
					if(get_L(y + 1, mid) >= x) pos = mid, l = mid + 1;
					else r = mid - 1;
				}
				y = max(y, pos);	
			}
			if(lst.F == x && lst.S == y) break;	
		}
		l[i] = x, r[i] = y;
		stmin.update(i, i, l[i]); stmax.update(i, i, r[i]);
	}
}
void to_thic_cau(){
	cin >> n;
	for(int i = 1; i <= n - 1;i++) cin >> c[i];
	for(int i = 1; i <= n;i++){
		ll sz; cin >> sz;
		while(sz--){
			ll x; cin >> x;
			g[i].pb(x);
		}
	}
	build();
	cin >> q;
	while(q--){
		ll x,y; cin >> x >> y;
		if(l[x] <= y && y <= r[x]) cout << "YES" << '\n';
		else cout << "NO" << "\n";
	}
}
 
signed main()   
{  
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	ll tc = 1;
	//cin >> tc;
	while(tc--) to_thic_cau();
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25692 KB Output is correct
2 Correct 13 ms 25760 KB Output is correct
3 Correct 13 ms 26288 KB Output is correct
4 Correct 15 ms 25760 KB Output is correct
5 Correct 12 ms 25692 KB Output is correct
6 Correct 14 ms 25692 KB Output is correct
7 Correct 31 ms 25744 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25692 KB Output is correct
2 Correct 13 ms 25760 KB Output is correct
3 Correct 13 ms 26288 KB Output is correct
4 Correct 15 ms 25760 KB Output is correct
5 Correct 12 ms 25692 KB Output is correct
6 Correct 14 ms 25692 KB Output is correct
7 Correct 31 ms 25744 KB Output is correct
8 Correct 78 ms 31568 KB Output is correct
9 Correct 80 ms 31312 KB Output is correct
10 Correct 82 ms 32084 KB Output is correct
11 Correct 78 ms 32580 KB Output is correct
12 Correct 73 ms 30800 KB Output is correct
13 Correct 78 ms 31672 KB Output is correct
14 Correct 75 ms 31572 KB Output is correct
15 Correct 77 ms 31668 KB Output is correct
16 Correct 72 ms 31496 KB Output is correct
17 Correct 73 ms 31568 KB Output is correct
18 Correct 70 ms 31572 KB Output is correct
19 Correct 74 ms 31572 KB Output is correct
20 Correct 79 ms 31684 KB Output is correct
21 Correct 76 ms 31572 KB Output is correct
22 Correct 70 ms 31572 KB Output is correct
23 Correct 88 ms 31396 KB Output is correct
24 Correct 86 ms 31312 KB Output is correct
25 Correct 92 ms 31316 KB Output is correct
26 Correct 90 ms 31312 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 152 ms 54352 KB Output is correct
2 Correct 149 ms 54096 KB Output is correct
3 Correct 141 ms 52980 KB Output is correct
4 Correct 173 ms 53332 KB Output is correct
5 Correct 163 ms 53332 KB Output is correct
6 Correct 161 ms 52968 KB Output is correct
7 Correct 139 ms 52840 KB Output is correct
8 Correct 149 ms 52668 KB Output is correct
9 Correct 140 ms 52816 KB Output is correct
10 Correct 132 ms 52716 KB Output is correct
11 Correct 129 ms 52596 KB Output is correct

Subtask #4
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 25692 KB Output is correct
2 Correct 13 ms 25760 KB Output is correct
3 Correct 13 ms 26288 KB Output is correct
4 Correct 15 ms 25760 KB Output is correct
5 Correct 12 ms 25692 KB Output is correct
6 Correct 14 ms 25692 KB Output is correct
7 Correct 31 ms 25744 KB Output is correct
8 Correct 78 ms 31568 KB Output is correct
9 Correct 80 ms 31312 KB Output is correct
10 Correct 82 ms 32084 KB Output is correct
11 Correct 78 ms 32580 KB Output is correct
12 Correct 73 ms 30800 KB Output is correct
13 Correct 78 ms 31672 KB Output is correct
14 Correct 75 ms 31572 KB Output is correct
15 Correct 77 ms 31668 KB Output is correct
16 Correct 72 ms 31496 KB Output is correct
17 Correct 73 ms 31568 KB Output is correct
18 Correct 70 ms 31572 KB Output is correct
19 Correct 74 ms 31572 KB Output is correct
20 Correct 79 ms 31684 KB Output is correct
21 Correct 76 ms 31572 KB Output is correct
22 Correct 70 ms 31572 KB Output is correct
23 Correct 88 ms 31396 KB Output is correct
24 Correct 86 ms 31312 KB Output is correct
25 Correct 92 ms 31316 KB Output is correct
26 Correct 90 ms 31312 KB Output is correct
27 Correct 152 ms 54352 KB Output is correct
28 Correct 149 ms 54096 KB Output is correct
29 Correct 141 ms 52980 KB Output is correct
30 Correct 173 ms 53332 KB Output is correct
31 Correct 163 ms 53332 KB Output is correct
32 Correct 161 ms 52968 KB Output is correct
33 Correct 139 ms 52840 KB Output is correct
34 Correct 149 ms 52668 KB Output is correct
35 Correct 140 ms 52816 KB Output is correct
36 Correct 132 ms 52716 KB Output is correct
37 Correct 129 ms 52596 KB Output is correct
38 Correct 331 ms 116848 KB Output is correct
39 Correct 348 ms 136528 KB Output is correct
40 Correct 285 ms 95840 KB Output is correct
41 Correct 507 ms 135012 KB Output is correct
42 Correct 189 ms 53980 KB Output is correct
43 Correct 153 ms 53984 KB Output is correct
44 Correct 292 ms 76396 KB Output is correct
45 Correct 297 ms 76040 KB Output is correct
46 Correct 323 ms 76496 KB Output is correct
47 Correct 173 ms 53328 KB Output is correct
48 Correct 163 ms 53676 KB Output is correct
49 Correct 235 ms 76356 KB Output is correct
50 Correct 269 ms 76488 KB Output is correct
51 Correct 286 ms 77144 KB Output is correct
52 Execution timed out 3080 ms 67668 KB Time limit exceeded
53 Halted 0 ms 0 KB -