oj.uz

Submission #1080389

# Submission time Handle Problem Language Result Execution time Memory
1080389 2024-08-29T09:31:42 Z coldbr3w Long Mansion (JOI17_long_mansion) C++14
25 / 100
 3000 ms 119636 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]);
		}
	}
	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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 23132 KB Output is correct
2 Correct 5 ms 23132 KB Output is correct
3 Correct 5 ms 23336 KB Output is correct
4 Correct 6 ms 23132 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 21 ms 23260 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 23132 KB Output is correct
2 Correct 5 ms 23132 KB Output is correct
3 Correct 5 ms 23336 KB Output is correct
4 Correct 6 ms 23132 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 21 ms 23260 KB Output is correct
8 Correct 63 ms 24700 KB Output is correct
9 Correct 64 ms 24656 KB Output is correct
10 Correct 71 ms 24732 KB Output is correct
11 Correct 66 ms 25044 KB Output is correct
12 Correct 61 ms 24908 KB Output is correct
13 Correct 61 ms 24912 KB Output is correct
14 Correct 69 ms 24916 KB Output is correct
15 Correct 61 ms 24912 KB Output is correct
16 Correct 60 ms 25168 KB Output is correct
17 Correct 61 ms 18772 KB Output is correct
18 Correct 62 ms 19024 KB Output is correct
19 Correct 66 ms 19028 KB Output is correct
20 Correct 99 ms 21072 KB Output is correct
21 Correct 64 ms 21216 KB Output is correct
22 Correct 60 ms 24916 KB Output is correct
23 Correct 81 ms 24660 KB Output is correct
24 Correct 80 ms 24656 KB Output is correct
25 Correct 100 ms 24784 KB Output is correct
26 Correct 87 ms 24636 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 43288 KB Output is correct
2 Correct 170 ms 44884 KB Output is correct
3 Correct 132 ms 43088 KB Output is correct
4 Correct 172 ms 43152 KB Output is correct
5 Correct 132 ms 43348 KB Output is correct
6 Correct 128 ms 44352 KB Output is correct
7 Correct 112 ms 42988 KB Output is correct
8 Correct 109 ms 42836 KB Output is correct
9 Correct 108 ms 43048 KB Output is correct
10 Correct 108 ms 42836 KB Output is correct
11 Correct 111 ms 42832 KB Output is correct

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 23132 KB Output is correct
2 Correct 5 ms 23132 KB Output is correct
3 Correct 5 ms 23336 KB Output is correct
4 Correct 6 ms 23132 KB Output is correct
5 Correct 4 ms 23132 KB Output is correct
6 Correct 4 ms 23132 KB Output is correct
7 Correct 21 ms 23260 KB Output is correct
8 Correct 63 ms 24700 KB Output is correct
9 Correct 64 ms 24656 KB Output is correct
10 Correct 71 ms 24732 KB Output is correct
11 Correct 66 ms 25044 KB Output is correct
12 Correct 61 ms 24908 KB Output is correct
13 Correct 61 ms 24912 KB Output is correct
14 Correct 69 ms 24916 KB Output is correct
15 Correct 61 ms 24912 KB Output is correct
16 Correct 60 ms 25168 KB Output is correct
17 Correct 61 ms 18772 KB Output is correct
18 Correct 62 ms 19024 KB Output is correct
19 Correct 66 ms 19028 KB Output is correct
20 Correct 99 ms 21072 KB Output is correct
21 Correct 64 ms 21216 KB Output is correct
22 Correct 60 ms 24916 KB Output is correct
23 Correct 81 ms 24660 KB Output is correct
24 Correct 80 ms 24656 KB Output is correct
25 Correct 100 ms 24784 KB Output is correct
26 Correct 87 ms 24636 KB Output is correct
27 Correct 138 ms 43288 KB Output is correct
28 Correct 170 ms 44884 KB Output is correct
29 Correct 132 ms 43088 KB Output is correct
30 Correct 172 ms 43152 KB Output is correct
31 Correct 132 ms 43348 KB Output is correct
32 Correct 128 ms 44352 KB Output is correct
33 Correct 112 ms 42988 KB Output is correct
34 Correct 109 ms 42836 KB Output is correct
35 Correct 108 ms 43048 KB Output is correct
36 Correct 108 ms 42836 KB Output is correct
37 Correct 111 ms 42832 KB Output is correct
38 Correct 280 ms 100872 KB Output is correct
39 Correct 331 ms 119384 KB Output is correct
40 Correct 229 ms 80208 KB Output is correct
41 Correct 388 ms 119636 KB Output is correct
42 Correct 121 ms 42728 KB Output is correct
43 Correct 130 ms 42576 KB Output is correct
44 Correct 210 ms 61564 KB Output is correct
45 Correct 212 ms 61520 KB Output is correct
46 Correct 218 ms 61524 KB Output is correct
47 Correct 126 ms 42644 KB Output is correct
48 Correct 130 ms 44368 KB Output is correct
49 Correct 199 ms 61576 KB Output is correct
50 Correct 205 ms 61520 KB Output is correct
51 Correct 205 ms 61520 KB Output is correct
52 Execution timed out 3025 ms 59216 KB Time limit exceeded
53 Halted 0 ms 0 KB -