oj.uz

답안 #1080404

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1080404 2024-08-29T09:37:16 Z coldbr3w Long Mansion (JOI17_long_mansion) C++14
100 / 100
 598 ms 138836 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 = 5e5 + 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][21], R[N][21], 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 <= 20;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]);
		}
	}
	stmin.init(n); stmax.init(n);
	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, x - 1), mx = stmax.get(pos, x - 1); 
					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;
				}
				if(pos != -1){
					ll mn = stmin.get(y + 1, pos), mx = stmax.get(y + 1, pos); 
					x = min(x, mn); y = max({y, mx, 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 7 ms 13404 KB Output is correct
2 Correct 8 ms 13748 KB Output is correct
3 Correct 9 ms 14208 KB Output is correct
4 Correct 6 ms 13400 KB Output is correct
5 Correct 6 ms 13272 KB Output is correct
6 Correct 8 ms 13400 KB Output is correct
7 Correct 7 ms 13312 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 13404 KB Output is correct
2 Correct 8 ms 13748 KB Output is correct
3 Correct 9 ms 14208 KB Output is correct
4 Correct 6 ms 13400 KB Output is correct
5 Correct 6 ms 13272 KB Output is correct
6 Correct 8 ms 13400 KB Output is correct
7 Correct 7 ms 13312 KB Output is correct
8 Correct 74 ms 17492 KB Output is correct
9 Correct 70 ms 17492 KB Output is correct
10 Correct 103 ms 17696 KB Output is correct
11 Correct 88 ms 18260 KB Output is correct
12 Correct 68 ms 16884 KB Output is correct
13 Correct 66 ms 17488 KB Output is correct
14 Correct 70 ms 17724 KB Output is correct
15 Correct 67 ms 17324 KB Output is correct
16 Correct 68 ms 17576 KB Output is correct
17 Correct 70 ms 17828 KB Output is correct
18 Correct 81 ms 17540 KB Output is correct
19 Correct 68 ms 17744 KB Output is correct
20 Correct 68 ms 17492 KB Output is correct
21 Correct 83 ms 17728 KB Output is correct
22 Correct 66 ms 17488 KB Output is correct
23 Correct 72 ms 17296 KB Output is correct
24 Correct 73 ms 17236 KB Output is correct
25 Correct 71 ms 17216 KB Output is correct
26 Correct 87 ms 17232 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 185 ms 42484 KB Output is correct
2 Correct 179 ms 42484 KB Output is correct
3 Correct 181 ms 42544 KB Output is correct
4 Correct 190 ms 42768 KB Output is correct
5 Correct 175 ms 42560 KB Output is correct
6 Correct 177 ms 41760 KB Output is correct
7 Correct 157 ms 41608 KB Output is correct
8 Correct 163 ms 41556 KB Output is correct
9 Correct 166 ms 41756 KB Output is correct
10 Correct 148 ms 41556 KB Output is correct
11 Correct 146 ms 41552 KB Output is correct

Subtask #4
75.0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 13404 KB Output is correct
2 Correct 8 ms 13748 KB Output is correct
3 Correct 9 ms 14208 KB Output is correct
4 Correct 6 ms 13400 KB Output is correct
5 Correct 6 ms 13272 KB Output is correct
6 Correct 8 ms 13400 KB Output is correct
7 Correct 7 ms 13312 KB Output is correct
8 Correct 74 ms 17492 KB Output is correct
9 Correct 70 ms 17492 KB Output is correct
10 Correct 103 ms 17696 KB Output is correct
11 Correct 88 ms 18260 KB Output is correct
12 Correct 68 ms 16884 KB Output is correct
13 Correct 66 ms 17488 KB Output is correct
14 Correct 70 ms 17724 KB Output is correct
15 Correct 67 ms 17324 KB Output is correct
16 Correct 68 ms 17576 KB Output is correct
17 Correct 70 ms 17828 KB Output is correct
18 Correct 81 ms 17540 KB Output is correct
19 Correct 68 ms 17744 KB Output is correct
20 Correct 68 ms 17492 KB Output is correct
21 Correct 83 ms 17728 KB Output is correct
22 Correct 66 ms 17488 KB Output is correct
23 Correct 72 ms 17296 KB Output is correct
24 Correct 73 ms 17236 KB Output is correct
25 Correct 71 ms 17216 KB Output is correct
26 Correct 87 ms 17232 KB Output is correct
27 Correct 185 ms 42484 KB Output is correct
28 Correct 179 ms 42484 KB Output is correct
29 Correct 181 ms 42544 KB Output is correct
30 Correct 190 ms 42768 KB Output is correct
31 Correct 175 ms 42560 KB Output is correct
32 Correct 177 ms 41760 KB Output is correct
33 Correct 157 ms 41608 KB Output is correct
34 Correct 163 ms 41556 KB Output is correct
35 Correct 166 ms 41756 KB Output is correct
36 Correct 148 ms 41556 KB Output is correct
37 Correct 146 ms 41552 KB Output is correct
38 Correct 408 ms 115280 KB Output is correct
39 Correct 482 ms 138836 KB Output is correct
40 Correct 325 ms 90820 KB Output is correct
41 Correct 598 ms 138324 KB Output is correct
42 Correct 179 ms 42268 KB Output is correct
43 Correct 191 ms 42244 KB Output is correct
44 Correct 330 ms 67500 KB Output is correct
45 Correct 324 ms 67408 KB Output is correct
46 Correct 315 ms 67480 KB Output is correct
47 Correct 165 ms 42260 KB Output is correct
48 Correct 194 ms 42064 KB Output is correct
49 Correct 350 ms 67156 KB Output is correct
50 Correct 329 ms 67316 KB Output is correct
51 Correct 337 ms 67668 KB Output is correct
52 Correct 324 ms 70048 KB Output is correct
53 Correct 389 ms 97108 KB Output is correct
54 Correct 552 ms 123216 KB Output is correct
55 Correct 404 ms 97364 KB Output is correct