제출 #750151

#제출 시각아이디문제언어결과실행 시간메모리
750151GrindMachineLong Mansion (JOI17_long_mansion)C++17
100 / 100
822 ms146196 KiB
// Om Namah Shivaya #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace std; using namespace __gnu_pbds; template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; typedef long long int ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; #define fastio ios_base::sync_with_stdio(false); cin.tie(NULL) #define pb push_back #define endl '\n' #define sz(a) a.size() #define setbits(x) __builtin_popcountll(x) #define ff first #define ss second #define conts continue #define ceil2(x, y) ((x + y - 1) / (y)) #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() #define yes cout << "YES" << endl #define no cout << "NO" << endl #define rep(i, n) for(int i = 0; i < n; ++i) #define rep1(i, n) for(int i = 1; i <= n; ++i) #define rev(i, s, e) for(int i = s; i >= e; --i) #define trav(i, a) for(auto &i : a) template<typename T> void amin(T &a, T b) { a = min(a, b); } template<typename T> void amax(T &a, T b) { a = max(a, b); } #ifdef LOCAL #include "debug.h" #else #define debug(x) 42 #endif /* refs: https://codeforces.com/blog/entry/51010 */ const int MOD = 1e9 + 7; const int N = 1e5 + 5; const int inf1 = int(1e9) + 5; const ll inf2 = ll(1e18) + 5; void solve(int test_case) { int n; cin >> n; vector<int> c(n+5); rep1(i,n-1) cin >> c[i]; vector<int> a[n+5]; rep1(i,n){ int k; cin >> k; rep1(j,k){ ll x; cin >> x; a[i].pb(x); } } // find left_pos and right_pos vector<int> left_pos(n+5), right_pos(n+5); vector<int> pos(n+5); rep1(i,n){ trav(x,a[i]){ pos[x] = i; } left_pos[i] = pos[c[i]]; } fill(all(pos),n+1); rev(i,n,1){ trav(x,a[i]){ pos[x] = i; } right_pos[i] = pos[c[i-1]]; } // find max unextendable range for every l vector<int> left_here[n+5]; rep1(i,n) left_here[left_pos[i]].pb(i); vector<int> mxbad(n+5); set<int> st; rep1(l,n){ trav(i,left_here[l-1]){ st.insert(i); } // l <= r <= rx, r is max possible int rx = right_pos[l]-1; auto it = st.upper_bound(rx); if(it != st.begin()){ it--; int r = *it; if(r >= l){ mxbad[l] = r; } } } // for every i, find the closest to left l with mxbad[l] >= i vector<int> mxbad_here[n+5]; rep1(i,n) mxbad_here[mxbad[i]].pb(i); st.clear(); vector<int> closestl(n+5); rev(i,n,1){ trav(l,mxbad_here[i]){ st.insert(l); } // find max l <= i in set auto it = st.upper_bound(i); assert(it != st.begin()); it--; int l = *it; closestl[i] = l; } // for every i, find smallest r s.t r >= i and range [closestl[i],r] is bad vector<int> closestl_here[n+5]; rep1(i,n) closestl_here[closestl[i]].pb(i); vector<pii> range(n+5); st.clear(); rep1(l,n){ trav(i,left_here[l-1]){ st.insert(i); } trav(i,closestl_here[l]){ // find smallest r >= i auto it = st.lower_bound(i); assert(it != st.end()); int r = *it; range[i] = {l,r}; } } int q; cin >> q; while(q--){ // can go from x to y if y is in the reachable range of x int x,y; cin >> x >> y; auto [l,r] = range[x]; if(l <= y and y <= r){ yes; } else{ no; } } /* vector<pii> ranges; rep1(l,n){ // find all r s.t [l,r] is unextendable for(int r = l; r < right_pos[l]; ++r){ if(left_pos[r] < l){ ranges.pb({l,r}); } } } vector<pii> range(n+5,{-inf1,inf1}); for(auto [l,r] : ranges){ for(int i = l; i <= r; ++i){ if(l > range[i].ff){ range[i] = {l,r}; } } } int q; cin >> q; while(q--){ int x,y; cin >> x >> y; auto [l,r] = range[x]; if(l <= y and y <= r){ yes; } else{ no; } } */ } int main() { fastio; int t = 1; // cin >> t; rep1(i, t) { solve(i); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...