#1049065 (C++23) No.2935 Division Into 3 (Mex Edition)

提出ソース
結果

問題	No.2935 Division Into 3 (Mex Edition)
ユーザー	noya2
提出日時	2025-03-03 23:29:02
言語	C++23 (gcc 13.3.0 + boost 1.87.0)
結果	MLE
実行時間	-
コード長	13,171 bytes
コンパイル時間	4,437 ms
コンパイル使用メモリ	304,456 KB
実行使用メモリ	535,424 KB
最終ジャッジ日時	2025-03-03 23:30:00
合計ジャッジ時間	19,286 ms
ジャッジサーバーID （参考情報）	judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン	結果
sample	MLE * 3
other	TLE * 2 MLE * 9 -- * 10
権限があれば一括ダウンロードができます
ソースコード

raw source code
#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"

#line 2 "/Users/noya2/Desktop/Noya2_library/data_structure/segment_tree.hpp"

namespace noya2{

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    segtree(int n) : segtree(std::vector<S>(n, e())) {}
    segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = 0;
        size = 1;
        while (size < _n) size <<= 1, log++;

        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() { return d[1]; }

    template <bool (*f)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

} // namespace noya2
#line 4 "c.cpp"

ll gethash(ll x, ll y, ll z){
    return (x << 40) | (y << 20) | z;
}

const int bmx = (1 << 20) - 1;

ll get1(ll x){
    return x >> 40;
}
ll get2(ll x){
    return x >> 20 & bmx;
}
ll get3(ll x){
    return x & bmx;
}

ll op(ll a, ll b){
    return gethash(max(get1(a),get1(b)),max(get2(a),get2(b)),max(get3(a),get3(b)));
}
ll e(){
    return 0;
}

const int nmx = 100000;
const int amx = 100010;

// const bool LOCAL = true;
const bool LOCAL = false;

#line 2 "/Users/noya2/Desktop/Noya2_library/misc/rng.hpp"

#line 4 "/Users/noya2/Desktop/Noya2_library/misc/rng.hpp"

namespace noya2 {

// [0, 2^64 - 1)
ull rng() {
  static ull _x = 88172645463325252UL;
  return _x ^= _x << 7, _x ^= _x >> 9;
}

// [l, r]
ll rng(ll l, ll r) {
  assert(l <= r);
  return l + rng() % ull(r - l + 1);
}

// [l, r)
ll randint(ll l, ll r) {
  assert(l < r);
  return l + rng() % ull(r - l);
}

// [0.0, 1.0)
ld rnd() { return rng() * 5.42101086242752217004e-20; }
// [l, r)
ld rnd(ld l, ld r) {
  assert(l < r);
  return l + rnd() * (r - l);
}

} // namespace noya2
#line 35 "c.cpp"

void solve(){
    int n = [&]{
        if (LOCAL){
            return nmx;
        }
        else {
            int ret; in(ret);
            return ret;
        }
    }();
    vector<int> a = [&]{
        if (LOCAL){
            vector<int> ret(n);
            rep(i,n){
                ret[i] = randint(0,1000);
            }
            return ret;
        }
        else {
            vector<int> ret(n); in(ret);
            return ret;
        }
    }();
    a.resize(nmx);
    n = nmx;
    vector<int> ptr(n);
    vector<vector<int>> ids(amx);
    {
        rep(i,n){
            ptr[i] = ids[a[i]].size();
            ids[a[i]].emplace_back(i);
        }
        rep(i,amx){
            ids[i].emplace_back(bmx-1);
            ids[i].emplace_back(bmx-1);
        }
    }
    const int bk = 400;
    const int cseg = nmx / bk;
    vector<segtree<ll,op,e>> seg(cseg);
    ll seginf = gethash(bmx,bmx,bmx);
    vector<ll> vinf(amx,seginf);
    auto get = [&](int i, int j, int k){
        return gethash(i+1,j+1,k+1);
    };
    rep(si,cseg){
        int l = bk * si;
        auto init = vinf;
        vector<bool> done(amx,false);
        repp(i,l,n){
            if (done[a[i]]) continue;
            done[a[i]] = true;
            init[a[i]] = get(ids[a[i]][ptr[i]],ids[a[i]][ptr[i]+1],ids[a[i]][ptr[i]+2]);
        }
        seg[si] = segtree<ll,op,e>(init);
    }
    vector<bool> done(n,false);
    segtree<ll,op,e> buf(vinf);
    auto naive = [&](int l, int r) -> int {
        repp(i,l,r){
            if (done[a[i]]) continue;
            done[a[i]] = true;
            buf.set(a[i],get(ids[a[i]][ptr[i]],ids[a[i]][ptr[i]+1],ids[a[i]][ptr[i]+2]));
        }
        int r3 = buf.max_right(0, [&](ll x){
            return get3(x)-1 < r;
        });
        int r2 = buf.max_right(0, [&](ll x){
            return get2(x)-1 < r;
        });
        int r1 = buf.max_right(0, [&](ll x){
            return get1(x)-1 < r;
        });
        int ans = r3 + r2 + r1;
        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;
            }
        }
        repp(i,l,r){
            buf.set(a[i],seginf);
        }
        repp(i,l,r){
            done[a[i]] = false;
        }
        return ans;
    };
    auto calc = [&](int l, int r) -> int {
        vector<pii> memo1, memo2, memo3;
        vector<pil> memo;
        int si = ceil_div(l,bk);
        int nl = si * bk;
        if (si == cseg || r < nl){
            return naive(l,r);
        }
        assert(0 <= si && si < cseg);
        assert(0 <= nl && nl <= n);
        repp(i,l,nl){
            if (done[a[i]]) continue;
            done[a[i]] = true;
            assert(0 <= a[i] && a[i] < amx);
            memo.emplace_back(a[i],seg[si].get(a[i]));
            seg[si].set(a[i],get(ids[a[i]][ptr[i]],ids[a[i]][ptr[i]+1],ids[a[i]][ptr[i]+2]));
        }
        int r3 = seg[si].max_right(0, [&](ll x){
            return get3(x)-1 < r;
        });
        int r2 = seg[si].max_right(0, [&](ll x){
            return get2(x)-1 < r;
        });
        int r1 = seg[si].max_right(0, [&](ll x){
            return get1(x)-1 < r;
        });
        int ans = r3 + r2 + r1;
        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;
            }
        }
        for (auto [p, v] : memo){
            seg[si].set(p, v);
        }
        repp(i,l,nl){
            done[a[i]] = false;
        }
        return ans;
    };
    int q = [&]{
        if (LOCAL){
            return 100000;
        }
        else {
            int ret; in(ret);
            return ret;
        }
    }();
    int pans = 0;
    while (q--){
        auto [l, r] = [&] -> pii {
            if (LOCAL){
                int il = randint(0,n);
                int ir = randint(0,n);
                if (il > ir) swap(il,ir);
                ir++;
                return {il, ir};
            }
            else {
                ll w, z; in(w,z);
                int il = w ^ pans;
                int ir = z ^ pans;
                il--;
                return {il, ir};
            }
        }();
        assert(0 <= l && l < r && r <= n);
        int ans = calc(l,r);
        if (LOCAL){
            // pass
        }
        else {
            out(ans);
        }
        pans = ans;
    }
    if (LOCAL){
        out(pans);
    }
    else {
        // pass
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
yukicoder

結果

ソースコード
