#1186387 (C++23) No.3705 ビバ子とマカロン (Bibako and Macaron)

• 問題: No.3705 ビバ子とマカロン (Bibako and Macaron)
• ユーザー: igeee
• 提出日時: 2026-09-11 23:20:13
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: AC
• 実行時間: 540 ms / 3,000 ms
• コード長: 5,694 bytes
• コンパイル時間: 5,457 ms
• コンパイル使用メモリ: 416,724 KB
• 実行使用メモリ: 100,540 KB
• 最終ジャッジ日時: 2026-09-11 23:22:02
• 合計ジャッジ時間: 26,931 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge3_0

サブタスク	配点	結果
小課題1	10 %	AC * 5
小課題2	30 %	AC * 8
小課題3	60 %	AC * 15
合計	100 点

ソースコード

#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)
#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)
#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)
#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)
#define each(p,a) for(auto &p:a)
typedef vector<ll> vll;
typedef vector<pair<ll ,ll>> vpll;
typedef vector<vector<pair<ll ,ll>>> vvpll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef set<ll> sll;
typedef map<ll , ll> mpll;
typedef pair<ll ,ll> pll;
typedef tuple<ll , ll , ll> tpl3;
typedef tuple<ll , ll , ll , ll> tpl4;
typedef tuple<ll , ll , ll , ll , ll> tpl5;
typedef tuple<ll , ll , ll , ll , ll , ll> tpl6;
#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)
#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)
#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)
#define all(a)  (a).begin(),(a).end()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define sz(x) (ll)x.size()
#define fr first
#define sc second
// << std::fixed << std::setprecision(10)
const ll INF = 1LL << 60;
const ld EPS = 1e-9;
 
ll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}
ll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}
inline ll positive_mod(ll a,ll m){return (a % m + m)%m;}
inline ll popcnt(ull a){ return __builtin_popcountll(a);}
//0indexed
inline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}
inline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}
template<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}
template<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}
template<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;}
template<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << "{" << p.first << "," << p.second << "}";return os;}
template<class... T>void input(T&... a){(cin >> ... >> a);}
void print(){cout << endl;}
template<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}
template<class T> void pspace(const T& a){ cout << a << ' ';}
void perr(){cerr << endl;}
template<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}
void yes(bool i = true){ return print(i?"yes":"no"); }
void Yes(bool i = true){ return print(i?"Yes":"No"); }
void YES(bool i = true){ return print(i?"YES":"NO"); }
template <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}
template <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}
template <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}
template <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}
//grid探索用
vector<ll> _ta = {0,0,1,-1,1,1,-1,-1};
vector<ll> _yo = {1,-1,0,0,1,-1,1,-1};
bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}
  
ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}
ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} 
const ll MOD9 = 998244353LL;
const ll MOD10 = 1000000007LL;
 
// ref https://info.atcoder.jp/entry/algorithm_lectures/disjoint_sparse_table
//verify https://judge.yosupo.jp/submission/397469
template <class T>
struct DisjointSparseTable{
  vector<T> a;
  vector<vector<T>> table;
  ll siz = 0;
  ll h = 0;//高さ
  T e; //単位元 初期化に使われるやつ
  function<T(T,T)> op;
  DisjointSparseTable(){};
  DisjointSparseTable(vector<T> x,T _e,function<T(T,T)> _op):e(_e),op(_op),a(x){
    siz = 1;
    h = 0;
    while(siz < sz(x)){
      siz <<= 1;
      ++h;
    }
    while(sz(x) < siz)x.push_back(e);
    table.resize(h);
    rep(k,h){
      table[k].resize(siz);
      rep(i,1<<(h-k-1)){
        ll l = (1<<(k+1))*i;
        ll r = (1<<(k+1))*(i+1);
        ll m = l+(1<<k);
        {//前
          T val = e;
          rrep(j,m-1,l){
            val = op(x[j],val);
            table[k][j] = val;
          }
        }
        //後ろ
        {
          T val = e;
          reps(j,m,r){
            val = op(val,x[j]);
            table[k][j] = val;
          }
        }
      }
    }
    
  }

  T query(ll l, ll r){
    assert(l < r && 0 <= l && r <= siz);
    if(r == l+1){
      return a[l];
    }
    ll tp = topbit(l^(r-1));
    return op(table[tp][l],table[tp][r-1]);
  }
  
};
int main(){
  ios::sync_with_stdio(false);cin.tie(nullptr);
  LL(n);
  vll a(n);cin >> a;a--;
  vll b(n);
  rep(i,n)b[a[i]]++;
  DisjointSparseTable<ll> ds(b,INF,[](ll u,ll v){return min(u,v);});
  LL(q);
  rep(i,q){
    LL(l1,r1,l2,r2);
    l1--;l2--;
    bool ok = true;
    if(ds.query(l1,r1)<1||ds.query(l2,r2)<1)ok = false;
    ll l3 = max(l1,l2);
    ll r3 = min(r1,r2);
    if(l3 < r3)if(ds.query(l3,r3) < 2)ok = false;
    Yes(ok);
  }

}