Submission #1209049

#	Time	Username	Problem	Language	Result	Execution time	Memory
1209049		mychecksedad	Long Mansion (JOI17_long_mansion)	C++20	15 / 100	211 ms	33704 KiB

long_mansion

/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define vi vector<int>
const int N = 1e5+100, M = 1e5+10, K = 21, MX = 30;


int n, c[N], L[N][K], R[N][K], pref[N][K];
vector<int> A[N];
array<int, 2> a[N];


void add(vector<int> &keys, int l, int r){
  for(int j = 1; j < K; ++j){
    if(pref[r][j] - pref[l-1][j]) keys[j] = 1;
  }
}

void solve(){
  cin >> n;
  for(int i = 1; i < n; ++i){
    cin >> c[i];
    for(int j = 1; j < K; ++j) pref[i][j] = 0;
  }
  for(int i = 1; i <= n; ++i){
    int x; cin >> x;
    A[i].resize(x);
    for(int &y: A[i]) cin >> y;
    for(int x: A[i]) pref[i][x]++;
  }
  
  for(int i = 1; i <= n; ++i){
    for(int j = 1; j < K; ++j) pref[i][j] += pref[i - 1][j];
  }
  
  for(int i = 1; i < K; ++i){
    L[1][i] = 1;
  }
  
  for(int i = 2; i <= n; ++i){
    for(int j = 1; j < K; ++j) L[i][j] = L[i - 1][j];
    L[i][c[i - 1]] = i;
  }

  
  for(int i = 1; i < K; ++i){
    R[n][i] = n;
  }
  
  for(int i = n - 1; i >= 1; --i){
    for(int j = 1; j < K; ++j) R[i][j] = R[i + 1][j];
    R[i][c[i]] = i;
  }

  for(int i = 1; i <= n; ++i){
    a[i][0] = i, a[i][1] = i;
    bool ok = 1;
    vector<int> keys(K);
    for(int x: A[i]) keys[x] = 1;
    while(ok){
      ok = 0;
      if(a[i][0] > 1 && keys[c[a[i][0] - 1]]){
        // go left for some time
        int lpos = 1;
        for(int j = 1; j < K; ++j){
          if(!keys[j]) lpos = max(lpos, L[a[i][0] - 1][j]);
        }        
        add(keys, lpos, a[i][0]);
        a[i][0] = lpos;  
        ok = 1;
      }else if(a[i][1] < n && keys[c[a[i][1]]]){
        int rpos = n;
        for(int j = 1; j < K; ++j){
          if(!keys[j]) rpos = min(rpos, R[a[i][1]][j]);
        }        
        add(keys, a[i][1], rpos);
        a[i][1] = rpos;  
        ok = 1; 
      }
    }
  }
  
  int q; cin >> q;
  for(int i = 1; i <= q; ++i){
    int x, y; cin >> x >> y;
    if(a[x][0] <= y && a[x][1] >= y){
      cout << "YES\n";
    }else{
      cout << "NO\n";
    }
  }
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
} 

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 15 / 15
• Subtask 4: 0 / 75