Submission #1161707

#	Time	Username	Problem	Language	Result	Execution time	Memory
1161707		Zero_OP	Long Mansion (JOI17_long_mansion)	C11	Compilation error	0 ms	0 KiB

long_mansion

#include <bits/stdc++.h>

using namespace std;

#define FOR(i, l, r) for(int i = (l); i < (r); ++i)
#define ROF(i, r, l) for(int i = (r) - 1; i >= (l); --i)

#define mp make_pair
#define mt make_tuple
#define ff first
#define ss second

#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define sz(v) (int)v.size()
#define pb push_back
#define eb emplace_back
#define compact(v) v.erase(unique(all(v)), end(v))

#define dbg(x) "[" #x " = " << (x) << "]"

template<typename T>
bool minimize(T& a, const T& b){
      if(a > b) return a = b, true;
      return false;
}

template<typename T>
bool maximize(T& a, const T& b){
      if(a < b) return a = b, true;
      return false;
}

using ll = long long;
using db = double;
using ld = long double;
using ull = unsigned long long;

using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;

using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using vc = vector<char>;
using vd = vector<db>;

using vpi = vector<pi>;
using vpl = vector<pl>;

void setIO(){
      ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef LOCAL
      freopen("task.inp", "r", stdin);
      freopen("task.out", "w", stdout);
#endif // LOCAL
}

int main(){
      setIO();

      int N; cin >> N;
      vi C(N-1);
      FOR(i, 0, N-1) cin >> C[i], --C[i];

      vi B(N);
      vector<vi> A(N);
      FOR(i, 0, N) {
            cin >> B[i];
            A[i].resize(B[i]);
            FOR(j, 0, B[i]) {
                  cin >> A[i][j], --A[i][j];
            }
      }

      vi last(N, N);

      vi needLeft(N-1, -1), needRight(N-1, N);
      ROF(i, N, 0){
            FOR(j, 0, B[i]) last[A[i][j]] = i;
            if(i > 0){
                  needRight[i-1] = last[C[i-1]];
            }
      }

      fill(all(last), -1);
      FOR(i, 0, N){
            FOR(j, 0, B[i]) last[A[i][j]] = i;
            if(i < N-1){
                  needLeft[i] = last[C[i]];
            }
      }

      vi L(N), R(N);
      iota(all(L), 0);
      iota(all(R), 0);

      auto can_expand_left = [&](int l, int r){
            return l > 0 && needRight[l-1] <= r;
      };

      auto can_expand_right = [&](int l, int r){
            return r < N-1 && l <= needLeft[r];
      };

      FOR(i, 0, N){
            while(true){
                  if(can_expand_left(L[i], R[i])){
                        int t = L[i]-1;
                        minimize(L[i], L[t]);
                        maximize(R[i], R[t]);
                  } else if(can_expand_right(L[i], R[i])){
                        int t = R[i]+1;
                        minimize(L[i], L[t]);
                        maximize(R[i], R[t]);
                  } else break;
            }
      }

      int Q;
      cin >> Q;
      while(Q--){
            int x, y;
            cin >> x >> y;
            --x, --y;

            if(x < y){
                  cout << (y <= R[x] ? "YES\n" : "NO\n");
            } else{
                  cout << (L[x] <= y ? "YES\n" : "NO\n");
            }
      }

      return 0;
}

Compilation message (stderr)

long_mansion.c:1:10: fatal error: bits/stdc++.h: No such file or directory
    1 | #include <bits/stdc++.h>
      |          ^~~~~~~~~~~~~~~
compilation terminated.