oj.uz

Submission #1080371

# Submission time Handle Problem Language Result Execution time Memory
1080371 2024-08-29T09:20:53 Z coldbr3w Long Mansion (JOI17_long_mansion) C++14
25 / 100
 3000 ms 201812 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()
#define int long long
const ll N = 5e5 + 100;
const ll inf = 1e18;
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], lg[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 = lg[r - l + 1];
	return min(L[l][p], L[r - (1 << p) + 1][p]);
}
ll get_R(ll l, ll r){
	ll p = lg[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;
				}
				if(pos != -1){
					ll mn = stmin.get(x, pos), mx = stmax.get(x, 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;i++) lg[i] = __lg(i);
	for(int i = 1; i <= n - 1;i++) cin >> c[i];
	for(int i = 1; i <= n;i++){
		ll sz; cin >> sz;
		for(int j = 1; j <= sz;j++){
			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 13660 KB Output is correct
2 Correct 7 ms 13916 KB Output is correct
3 Correct 10 ms 14684 KB Output is correct
4 Correct 9 ms 13660 KB Output is correct
5 Correct 6 ms 13724 KB Output is correct
6 Correct 6 ms 13660 KB Output is correct
7 Correct 16 ms 13660 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 13660 KB Output is correct
2 Correct 7 ms 13916 KB Output is correct
3 Correct 10 ms 14684 KB Output is correct
4 Correct 9 ms 13660 KB Output is correct
5 Correct 6 ms 13724 KB Output is correct
6 Correct 6 ms 13660 KB Output is correct
7 Correct 16 ms 13660 KB Output is correct
8 Correct 70 ms 15100 KB Output is correct
9 Correct 75 ms 15184 KB Output is correct
10 Correct 71 ms 15700 KB Output is correct
11 Correct 70 ms 16548 KB Output is correct
12 Correct 65 ms 15012 KB Output is correct
13 Correct 63 ms 15440 KB Output is correct
14 Correct 74 ms 15364 KB Output is correct
15 Correct 84 ms 15452 KB Output is correct
16 Correct 65 ms 15704 KB Output is correct
17 Correct 68 ms 15320 KB Output is correct
18 Correct 79 ms 15332 KB Output is correct
19 Correct 95 ms 15440 KB Output is correct
20 Correct 63 ms 15444 KB Output is correct
21 Correct 63 ms 15696 KB Output is correct
22 Correct 67 ms 15440 KB Output is correct
23 Correct 76 ms 15184 KB Output is correct
24 Correct 74 ms 15184 KB Output is correct
25 Correct 79 ms 15184 KB Output is correct
26 Correct 75 ms 15184 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 202 ms 54264 KB Output is correct
2 Correct 168 ms 54096 KB Output is correct
3 Correct 162 ms 53840 KB Output is correct
4 Correct 191 ms 54140 KB Output is correct
5 Correct 154 ms 54000 KB Output is correct
6 Correct 139 ms 51792 KB Output is correct
7 Correct 127 ms 51792 KB Output is correct
8 Correct 141 ms 51856 KB Output is correct
9 Correct 131 ms 51816 KB Output is correct
10 Correct 131 ms 51796 KB Output is correct
11 Correct 128 ms 51792 KB Output is correct

Subtask #4
0 / 75.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 13660 KB Output is correct
2 Correct 7 ms 13916 KB Output is correct
3 Correct 10 ms 14684 KB Output is correct
4 Correct 9 ms 13660 KB Output is correct
5 Correct 6 ms 13724 KB Output is correct
6 Correct 6 ms 13660 KB Output is correct
7 Correct 16 ms 13660 KB Output is correct
8 Correct 70 ms 15100 KB Output is correct
9 Correct 75 ms 15184 KB Output is correct
10 Correct 71 ms 15700 KB Output is correct
11 Correct 70 ms 16548 KB Output is correct
12 Correct 65 ms 15012 KB Output is correct
13 Correct 63 ms 15440 KB Output is correct
14 Correct 74 ms 15364 KB Output is correct
15 Correct 84 ms 15452 KB Output is correct
16 Correct 65 ms 15704 KB Output is correct
17 Correct 68 ms 15320 KB Output is correct
18 Correct 79 ms 15332 KB Output is correct
19 Correct 95 ms 15440 KB Output is correct
20 Correct 63 ms 15444 KB Output is correct
21 Correct 63 ms 15696 KB Output is correct
22 Correct 67 ms 15440 KB Output is correct
23 Correct 76 ms 15184 KB Output is correct
24 Correct 74 ms 15184 KB Output is correct
25 Correct 79 ms 15184 KB Output is correct
26 Correct 75 ms 15184 KB Output is correct
27 Correct 202 ms 54264 KB Output is correct
28 Correct 168 ms 54096 KB Output is correct
29 Correct 162 ms 53840 KB Output is correct
30 Correct 191 ms 54140 KB Output is correct
31 Correct 154 ms 54000 KB Output is correct
32 Correct 139 ms 51792 KB Output is correct
33 Correct 127 ms 51792 KB Output is correct
34 Correct 141 ms 51856 KB Output is correct
35 Correct 131 ms 51816 KB Output is correct
36 Correct 131 ms 51796 KB Output is correct
37 Correct 128 ms 51792 KB Output is correct
38 Correct 414 ms 164272 KB Output is correct
39 Correct 520 ms 201552 KB Output is correct
40 Correct 304 ms 127060 KB Output is correct
41 Correct 515 ms 201812 KB Output is correct
42 Correct 191 ms 51796 KB Output is correct
43 Correct 150 ms 51536 KB Output is correct
44 Correct 247 ms 89688 KB Output is correct
45 Correct 245 ms 90088 KB Output is correct
46 Correct 260 ms 90192 KB Output is correct
47 Correct 146 ms 51820 KB Output is correct
48 Correct 171 ms 51536 KB Output is correct
49 Correct 243 ms 89408 KB Output is correct
50 Correct 296 ms 89700 KB Output is correct
51 Correct 231 ms 90708 KB Output is correct
52 Execution timed out 3039 ms 87236 KB Time limit exceeded
53 Halted 0 ms 0 KB -