結果

問題 No.2935 Division Into 3 (Mex Edition)
ユーザー noya2
提出日時 2025-03-04 03:04:07
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
RE  
実行時間 -
コード長 9,934 bytes
コンパイル時間 4,388 ms
コンパイル使用メモリ 295,856 KB
実行使用メモリ 18,656 KB
最終ジャッジ日時 2025-03-04 03:04:18
合計ジャッジ時間 9,668 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other RE * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;
#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}
struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;
} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{
const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";
void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }
} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"
#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"
namespace noya2{
unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}
template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }
long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}
template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}
template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}
template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }
} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
namespace noya2{
/*　~ (. _________ . /)　*/
}
using namespace noya2;
#line 2 "c.cpp"
template<class S, auto op, auto e>
struct persistent_segtree {
    struct node {
        S val;
        int lv, rv;
        node (S _val = e(), int _lv = -1, int _rv = -1) : val(_val), lv(_lv), rv(_rv){}
    };
    int n;
    std::vector<node> nodes;
    std::vector<int> roots;
    persistent_segtree (const std::vector<S> &a) : n(a.size()){
        auto build = [&](auto self, int l, int r) -> int {
            if (r - l == 1){
                return new_node(a[l]);
            }
            int m = (l + r) / 2;
            return merge(self(self, l, m), self(self, m, r));
        };
        nodes.reserve(n * 2);
        roots.emplace_back(build(build, 0, n));
    }
    int new_node(S val){
        int ret = nodes.size();
        nodes.emplace_back(val,-1,-1);
        return ret;
    }
    int merge(int lv, int rv){
        int ret = nodes.size();
        nodes.emplace_back(op(nodes[lv].val, nodes[rv].val), lv, rv);
        return ret;
    }
    int set(int p, S x, int t = -1){
        assert(0 <= p && p < n);
        auto dfs = [&](auto sfs, int v, int l, int r) -> int {
            if (r - l == 1){
                return new_node(x);
            }
            int m = (l + r) / 2;
            if (p < m){
                return merge(sfs(sfs, nodes[v].lv, l, m), nodes[v].rv);
            }
            else {
                return merge(nodes[v].lv, sfs(sfs, nodes[v].rv, m, r));
            }
        };
        if (t == -1){
            t = roots.size() - 1u;
        }
        int root = dfs(dfs, roots[t], 0, n);
        roots.emplace_back(root);
        return root;
    }
    S prod(int _l, int _r, int t = -1){
        assert(0 <= _l && _l <= _r && _r <= n);
        assert(-1 <= t && t < (int)(roots.size()));
        auto dfs = [&](auto sfs, int v, int l, int r) -> S {
            if (v == -1) return e();
            if (_r <= l || r <= _l) return e();
            if (_l <= l && r <= _r) return nodes[v].val;
            int m = (l + r) / 2;
            return op(sfs(sfs,nodes[v].lv, l, m), sfs(sfs,nodes[v].rv, m, r));
        };
        if (t == -1){
            t = roots.size() - 1u;
        }
        return dfs(dfs,nodes[t],0,n);
    }
    void reserve(size_t sz){
        roots.reserve(sz);
        nodes.reserve(sz * std::bit_ceil<unsigned int>(n));
    }
    int max_right(int _l, auto f, int t = -1){
        assert(0 <= _l && _l <= n);
        assert(f(e()));
        assert(-1 <= t && t < (int)(roots.size()));
        // sm = prod[_l, l)
        auto find_r = [&](auto self, int v, int l, int r, S sm) -> std::pair<int, S> {
            {
                S tot = op(sm, nodes[v].val);
                if (f(tot)){
                    return {r, tot};
                }
            }
            if (r - l == 1){
                return {l, sm};
            }
            int m = (l + r) / 2;
            S nsm = op(sm, nodes[nodes[v].lv].val);
            if (f(nsm)){
                return self(self, nodes[v].rv, m, r, nsm);
            }
            else {
                return self(self, nodes[v].lv, l, m, sm);
            }
        };
        // l <= _l < r
        auto find_l = [&](auto self, int v, int l, int r) -> std::pair<int, S> {
            if (l == _l){
                return find_r(find_r, v, l, r, e());
            }
            int m = (l + r) / 2;
            if (_l < m){
                auto [ir, nsm] = self(self, nodes[v].lv, l, m);
                if (ir < m){
                    return {ir, nsm};
                }
                else {
                    return find_r(find_r, nodes[v].rv, m, r, nsm);
                }
            }
            else {
                return self(self, nodes[v].rv, m, r);
            }
        };
        if (t == -1){
            t = roots.size() - 1u;
        }
        return find_l(find_l, roots[t], 0, n).first;
    }
};
int op(int a, int b){
    return max(a,b);
}
int e(){
    return -iinf;
}
const int amx = 100010;
void solve(){
    int n; in(n);
    vector<int> a(n); in(a);
    vector<int> vinf(amx,iinf);
    persistent_segtree<int,op,e> seg1(vinf), seg2(vinf), seg3(vinf);
    seg1.reserve(n);
    seg2.reserve(n);
    seg3.reserve(n);
    vector<vector<int>> ids(amx);
    vector<int> ptr(n);
    {
        rep(i,n){
            ptr[i] = ids[a[i]].size();
            ids[a[i]].emplace_back(i);
        }
        rep(i,amx){
            ids[i].emplace_back(iinf);
            ids[i].emplace_back(iinf);
        }
    }
    reb(i,n){
        seg1.set(a[i],ids[a[i]][ptr[i]]);
        seg2.set(a[i],ids[a[i]][ptr[i]+1]);
        seg3.set(a[i],ids[a[i]][ptr[i]+2]);
    }
    auto calc = [&](int l, int r) -> int {
        int r1 = seg1.max_right(0, [&](int x){
            return x < r;
        }, n-l);
        int r2 = seg2.max_right(0, [&](int x){
            return x < r;
        }, n-l);
        int r3 = seg3.max_right(0, [&](int x){
            return x < r;
        }, n-l);
        int ans = r1 + r2 + r3;
        if (ans == r - l){
            if (r3 == 0){
                if (r2 == 0){
                    ans -= 2;
                }
                else {
                    ans -= 1;
                }
            }
        }
        else if (ans == r - l - 1){
            if (r2 == 0){
                ans -= 1;
            }
        }
        return ans;
    };
    int pans = 0;
    int q; in(q);
    while (q--){
        ll alpha, beta; in(alpha, beta);
        int l = alpha ^ pans;
        int r = beta ^ pans;
        l--;
        int ans = calc(l,r);
        out(ans);
        pans = ans;
    }
}
int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0