QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#853145	#9727. Barkley III	Mofumofu Binary Tree (Shunsuke Fujisawa, Yui Tamura, Kawaue Yamato)^#	AC ✓	1986ms	92096kb	C++23	23.7kb	2025-01-11 15:56:10	2025-01-13 04:13:20

Judging History

This is the latest submission verdict.

[2025-01-13 04:13:20]
自动重测本题所有获得100分的提交记录

Verdict: AC
Time: 1986ms
Memory: 92096kb

Show

[2025-01-13 03:55:43]
hack成功，自动添加数据
(/hack/1447)

[2025-01-11 15:56:12]
Judged

Verdict: 100
Time: 1415ms
Memory: 91896kb

Show

[2025-01-11 15:56:10]
Submitted

answer

#include <bits/stdc++.h>
using namespace std;

#ifndef LOCAL_TEST
#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif // LOCAL_TEST

using ll = long long;
using i128 = __int128_t;
using str = string;
using pii = pair<int, int>; using pll = pair<ll, ll>;
using vi = vector<int>;  using vvi = vector<vi>; using vvvi = vector<vvi>;
using vl = vector<ll>;  using vvl = vector<vl>; using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using vs = vector<string>; using vvs = vector<vector<string>>; using vvvs = vector<vector<vector<string>>>;

template<typename T> vector<vector<T>> vv(int h, int w, T val = T()) { return vector(h, vector<T>(w, val)); }
template<typename T> vector<vector<vector<T>>> vvv(int h1, int h2, int h3, T val = T()) { return vector(h1, vector(h2, vector<T>(h3, val))); }
template<typename T> vector<vector<vector<vector<T>>>> vvvv(int h1, int h2, int h3, int h4, T val = T()) { return vector(h1, vector(h2, vector(h3, vector<T>(h4, val)))); }

template <class T> using priority_queue_min = priority_queue<T, vector<T>, greater<T>>;

constexpr double PI = 3.14159265358979323;
constexpr int INF = 100100111; constexpr ll INFL = 3300300300300300491LL;
float EPS = 1e-8; double EPSL = 1e-10;


struct Nyan { Nyan() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } nyan;

#define all(a) (a).begin(), (a).end()
#define len(x) ((ll)(x).size())
#define sz(x) ((ll)(x).size())
#define rep1(n) for(ll dummy_iter = 0LL; dummy_iter < n; ++dummy_iter) // 0,1,...,n-1
#define rep2(i, n) for(ll i = 0LL, i##_counter = 0LL; i##_counter < ll(n); ++(i##_counter), (i) = i##_counter) // i=0,1,...,n-1
#define rep3(i, s, t) for(ll i = ll(s), i##_counter = ll(s); i##_counter < ll(t); ++(i##_counter), (i) = (i##_counter)) // i=s,s+1,...,t-1
#define rep4(i, s, t, step) for(ll i##_counter = step > 0 ? ll(s) : -ll(s), i##_end = step > 0 ? ll(t) : -ll(t), i##_step = abs(step), i = ll(s); i##_counter < i##_end; i##_counter += i##_step, i = step > 0 ? i##_counter : -i##_counter) // i=s,s+step,...,<t
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define repe(a, v) for(auto&& a : (v)) // iterate over all elements in v
#define repc(a, v) for(const auto& a : (v)) // iterate over all elements in v
#define smod(n, m) ((((n) % (m)) + (m)) % (m))
#define sdiv(n, m) (((n) - smod(n, m)) / (m))
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());}

int Yes(bool b=true) { cout << (b ? "Yes\n" : "No\n"); return 0; };
int YES(bool b=true) { cout << (b ? "YES\n" : "NO\n"); return 0; };
int No(bool b=true) {return Yes(!b);};
int NO(bool b=true) {return YES(!b);};

template<typename T, size_t N> T max(array<T, N>& a) { return *max_element(all(a)); };
template<typename T, size_t N> T min(array<T, N>& a) { return *min_element(all(a)); };
template<typename T> T max(vector<T>& a) { return *max_element(all(a)); };
template<typename T> T min(vector<T>& a) { return *min_element(all(a)); };
template<typename T> vector<T> vec_slice(const vector<T>& a, int l, int r) { vector<T> rev; rep(i, l, r) rev.push_back(a[i]); return rev; };
template<typename T> vector<T> vec_slice(const vector<T>&& a, int l, int r) { vector<T> rev; rep(i, l, r) rev.push_back(a[i]); return rev; };
template<typename T> T sum(vector<T>& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; };
template<typename T> T sum(vector<T>&& a, T zero = T(0)) { T rev = zero; rep(i, sz(a)) rev += a[i]; return rev; };


template <class T> inline vector<T>& operator--(vector<T>& v) { repe(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repe(x, v) ++x; return v; }

ll powll(ll a, ll n) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = (res * a);
        if (n > 1) a = (a * a);
        n >>= 1;
    }
    return res;
}
ll powm32(ll a, ll n, int mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = (res * a) % mod;
        if (n > 1) a = (a * a) % mod;
        n >>= 1;
    }
    return res % mod;
}
ll powm64(i128 a,i128 n,ll mod){
    i128 res = 1;
    while (n > 0) {
        if (n & 1) res = (res * a) % mod;
        if (n > 1) a = (a * a) % mod;
        n >>= 1;
    }
    return res % mod;
}
ll sqrtll(ll x) {
    assert(x >= 0);
    ll rev = sqrt(x);
    while(rev * rev > x) --rev;
    while((rev+1) * (rev+1)<=x) ++rev;
    return rev;
}

template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; }
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; }

template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p);
template <class T> inline istream& operator>>(istream& is, vector<T>& v);
template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p);
template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v);
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp);
template <typename T> ostream &operator<<(ostream &os, const set<T> &st);
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st);
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st);
template <typename T> ostream &operator<<(ostream &os, deque<T> q);
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq);

template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repe(x, v) is >> x; return is; }
template <class T, class U> inline ostream& operator<<(ostream& os, const pair<T, U>& p) { os << p.first << " " << p.second; return os; }
template <class T> inline ostream& operator<<(ostream& os, const vector<T>& v) { rep(i, sz(v)) { os << v.at(i); if (i != sz(v) - 1) os << " "; } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T> &st) { ll cnt = 0; for (auto &e : st) { os << e << (++cnt != (int)st.size() ? " " : ""); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front(); q.pop_front(); if (q.size()) os << " "; } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { while (pq.size()) { os << pq.top() << " "; pq.pop(); } return os; }
#define dout(x) cout << fixed << setprecision(10) << x << endl

#define read1(a) cin >> a;
#define read2(a, b) cin >> a >> b;
#define read3(a, b, c) cin >> a >> b >> c;
#define read4(a, b, c, d) cin >> a >> b >> c >> d;
#define read5(a, b, c, d, e) cin >> a >> b >> c >> d >> e;
#define read6(a, b, c, d, e, f) cin >> a >> b >> c >> d >> e >> f;
#define read7(a, b, c, d, e, f, g) cin >> a >> b >> c >> d >> e >> f >> g;
#define read8(a, b, c, d, e, f, g, h) cin >> a >> b >> c >> d >> e >> f >> g >> h;

#define overload_read(a, b, c, d, e, f, g, h, i, ...) i
#define read(...) overload_read(__VA_ARGS__,read8,read7,read6,read5,read4,read3,read2,read1)(__VA_ARGS__)

#ifdef LOCAL_TEST
#define inner_output1(a) cout << a << endl;cerr << "[OUTPUT #" << __LINE__ << "] " << a << endl;
#define inner_output2(a, b) cout << a << " " << b << endl;cerr << "[OUTPUT #" << __LINE__ << "] " << a << " " <<b << endl;
#define inner_output3(a, b, c) cout << a << " " << b << " " << c << endl;cerr << "[OUTPUT #" << __LINE__ << "] " << a << " " << b << " " << c << endl;
#define inner_output4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl;cerr << "[OUTPUT #" << __LINE__ << "] " << a << " " << b << " " << c << " " << d << endl;
#define inner_output5(a, b, c, d, e) cout << a << " " << b << " " << c << " " << d << " " << e << endl;cerr << "[OUTPUT #" << __LINE__ << "] " << a << " " << b << " " << c << " " << d << " " << e << endl;
#define inner_output6(a, b, c, d, e, f) cout << a << " " << b << " " << c << " " << d << " " << e << " " << f << endl;cerr << "[OUTPUT #" << __LINE__ << "] " << a << " " << b << " " << c << " " << d << " " << e << " " << f << endl;
#define inner_output7(a, b, c, d, e, f, g) cout << a << " " << b << " " << c << " " << d << " " << e << " " << f << " " << g << endl;cerr << "[OUTPUT #" << __LINE__ << "] " << a << " " << b << " " << c << " " << d << " " << e << " " << f << " " << g << endl;
#define inner_output8(a, b, c, d, e, f, g, h) cout << a << " " << b << " " << c << " " << d << " " << e << " " << f << " " << g << " " << h << endl;cerr << "[OUTPUT #" << __LINE__ << "] " << a << " " << b << " " << c << " " << d << " " << e << " " << f << " " << g << " " << h << endl;

#else

#define inner_output1(a) cout << a << endl;
#define inner_output2(a, b) cout << a << " " << b << endl;
#define inner_output3(a, b, c) cout << a << " " << b << " " << c << endl;
#define inner_output4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl;
#define inner_output5(a, b, c, d, e) cout << a << " " << b << " " << c << " " << d << " " << e << endl;
#define inner_output6(a, b, c, d, e, f) cout << a << " " << b << " " << c << " " << d << " " << e << " " << f << endl;
#define inner_output7(a, b, c, d, e, f, g) cout << a << " " << b << " " << c << " " << d << " " << e << " " << f << " " << g << endl;
#define inner_output8(a, b, c, d, e, f, g, h) cout << a << " " << b << " " << c << " " << d << " " << e << " " << f << " " << g << " " << h << endl;

#endif
#define overload_inner_output(a, b, c, d, e, f, g, h, i, ...) i
#define out(...) overload_inner_output(__VA_ARGS__,inner_output8,inner_output7,inner_output6,inner_output5,inner_output4,inner_output3,inner_output2,inner_output1)(__VA_ARGS__)

#define ii(...) ll __VA_ARGS__; read(__VA_ARGS__)
#define si(...) string __VA_ARGS__; read(__VA_ARGS__)
#define ci(...) char __VA_ARGS__; read(__VA_ARGS__)
#define di(...) double __VA_ARGS__; read(__VA_ARGS__)
#define li(name,size); vector<ll> name(size); read(name)
#define lli(name,H,W); vector name(H,vector<ll>(W));rep(i,H) cin >> name[i];


#ifdef LOCAL_TEST
#define inner_debug1(a) cerr << "[DEBUG#" << __LINE__ << "] " << #a << " = " << a << endl;
#define inner_debug2(a, b) cerr << "[DEBUG#" << __LINE__ << "] "<< #a << " = " << a << ", " << #b << " = " << b << endl;
#define inner_debug3(a, b, c) cerr << "[DEBUG#" << __LINE__ << "] "<< #a << " = " << a << ", " << #b << " = " << b << ", " << #c << " = " << c << endl;
#define inner_debug4(a, b, c, d) cerr << "[DEBUG#" << __LINE__ << "] "<< #a << " = " << a << ", " << #b << " = " << b << ", " << #c << " = " << c << ", " << #d << " = " << d << endl;
#define inner_debug5(a, b, c, d, e) cerr << "[DEBUG#" << __LINE__ << "] "<< #a << " = " << a << ", " << #b << " = " << b << ", " << #c << " = " << c << ", " << #d << " = " << d << ", " << #e << " = " << e << endl;
#define inner_debug6(a, b, c, d, e, f) cerr << "[DEBUG#" << __LINE__ << "] "<< #a << " = " << a << ", " << #b << " = " << b << ", " << #c << " = " << c << ", " << #d << " = " << d << ", " << #e << " = " << e << ", " << #f << " = " << f << endl;
#define inner_debug7(a, b, c, d, e, f, g) cerr << "[DEBUG#" << __LINE__ << "] "<< #a << " = " << a << ", " << #b << " = " << b << ", " << #c << " = " << c << ", " << #d << " = " << d << ", " << #e << " = " << e << ", " << #f << " = " << f << ", " << #g << " = " << g << endl;
#define inner_debug8(a, b, c, d, e, f, g, h) cerr << "[DEBUG#" << __LINE__ << "] "<< #a << " = " << a << ", " << #b << " = " << b << ", " << #c << " = " << c << ", " << #d << " = " << d << ", " << #e << " = " << e << ", " << #f << " = " << f << ", " << #g << " = " << g << ", " << #h << " = " << h << endl;

#define overload_inner_debug(a, b, c, d, e, f, g, h, i, ...) i
#define debug(...) overload_inner_debug(__VA_ARGS__,inner_debug8,inner_debug7,inner_debug6,inner_debug5,inner_debug4,inner_debug3,inner_debug2,inner_debug1)(__VA_ARGS__)

#else
#define debug(...);
#endif // LOCAL_TEST


inline ll ctz(ll x) { return __builtin_ctzll(x);}
inline ll clz(ll x) { return __builtin_clzll(x);}
inline ll popcount(ll x) { return __builtin_popcountll(x);}
inline bool inrange(ll x, ll a, ll b) { return a <= x && x < b; }
template <typename T> inline ll findll(vector<T>& v, T x) { auto tmp = find(all(v), x);if(tmp == v.end()){return -1;}else{return distance(v.begin(),tmp); }}
inline ll findll(string& s, char x) { auto tmp = find(all(s), x);if(tmp == s.end()){return -1;}else{return distance(s.begin(),tmp); }}
inline ll ceildiv(ll x,ll y){return (x+y-1)/y;}


#define allit(a,pred) [&]{repc(it,a){if(!(pred)) return false;}return true;}()
#define anyit(a,pred) [&]{repc(it,a){if((pred)) return true;}return false;}()

#define mapit(a, pred) ([&]() { \
    decltype(a)::value_type it; \
    vector<decltype(pred)> result_mapit(a.size()); \
    rep(idx,a.size()){\
        decltype(a)::value_type& it = a[idx];\
        result_mapit[idx] = pred;\
    }\
    return result_mapit; \
})()

#define filterit(a, pred) ([&]() { \
    decltype(a) result_filterit; \
    rep(idx,a.size()){\
        decltype(a)::value_type& it = a[idx];\
        if(pred){\
            result_filterit.push_back(it);\
        }\
    }\
    return result_filterit; \
})()

#define applyit(a, pred) { \
    rep(idx,a.size()){\
        decltype(a)::value_type& it = a[idx];\
        a[idx] = pred;\
    }\
}

#define countit(a, pred) ([&]() { \
    ll result_countit = 0; \
    rep(idx,a.size()){\
        decltype(a)::value_type& it = a[idx];\
        if(pred){\
            result_countit++;\
        }\
    }\
    return result_countit; \
})()

#define sortByIt(a,pred) {\
    sort(all(a),[&](const decltype(a)::value_type& left_value, const decltype(a)::value_type& right_value){auto it = left_value;auto x_value = pred;it = right_value;auto y_value = pred;return x_value<y_value;});\
}

ll minIndex(vector<ll>& a) {
    ll minIndex = 0;
    rep(i, 1, sz(a)) {
        if (a[i] < a[minIndex]) {
            minIndex = i;
        }
    }
    return minIndex;
}

ll maxIndex(vector<ll>& a) {
    ll maxIndex = 0;
    rep(i, 1, sz(a)) {
        if (a[i] > a[maxIndex]) {
            maxIndex = i;
        }
    }
    return maxIndex;
}

template<typename T> vector<T> sorted(vector<T> X){
    sort(all(X));
    return X;
}

vector<string> split(const string& s,char c){
    vector<string> res;
    res.push_back("");
    repc(a,s){
        if(a==c){
            res.push_back("");
        }else{
            res.back() += a;
        }
    }
    return res;
}

#include <algorithm>
#include <cassert>
#include <functional>
#include <vector>


#ifdef _MSC_VER
#include <intrin.h>
#endif

#if __cplusplus >= 202002L
#include <bit>
#endif

namespace atcoder {

namespace internal {

#if __cplusplus >= 202002L

using std::bit_ceil;

#else

unsigned int bit_ceil(unsigned int n) {
    unsigned int x = 1;
    while (x < (unsigned int)(n)) x *= 2;
    return x;
}

#endif

int countr_zero(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}

constexpr int countr_zero_constexpr(unsigned int n) {
    int x = 0;
    while (!(n & (1 << x))) x++;
    return x;
}

}  // namespace internal

}  // namespace atcoder


namespace atcoder {

#if __cplusplus >= 201703L

template <class S,
          auto op,
          auto e,
          class F,
          auto mapping,
          auto composition,
          auto id>
struct lazy_segtree {
    static_assert(std::is_convertible_v<decltype(op), std::function<S(S, S)>>,
                  "op must work as S(S, S)");
    static_assert(std::is_convertible_v<decltype(e), std::function<S()>>,
                  "e must work as S()");
    static_assert(
        std::is_convertible_v<decltype(mapping), std::function<S(F, S)>>,
        "mapping must work as S(F, S)");
    static_assert(
        std::is_convertible_v<decltype(composition), std::function<F(F, F)>>,
        "composition must work as F(F, F)");
    static_assert(std::is_convertible_v<decltype(id), std::function<F()>>,
                  "id must work as F()");

#else

template <class S,
          S (*op)(S, S),
          S (*e)(),
          class F,
          S (*mapping)(F, S),
          F (*composition)(F, F),
          F (*id)()>
struct lazy_segtree {

#endif

  public:
    lazy_segtree() : lazy_segtree(0) {}
    explicit lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
    explicit lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {
        size = (int)internal::bit_ceil((unsigned int)(_n));
        log = internal::countr_zero((unsigned int)size);
        d = std::vector<S>(2 * size, e());
        lz = std::vector<F>(size, id());
        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;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        return d[p];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return e();

        l += size;
        r += size;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        S sml = e(), smr = e();
        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]; }

    void apply(int p, F f) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = mapping(f, d[p]);
        for (int i = 1; i <= log; i++) update(p >> i);
    }
    void apply(int l, int r, F f) {
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return;

        l += size;
        r += size;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        {
            int l2 = l, r2 = r;
            while (l < r) {
                if (l & 1) all_apply(l++, f);
                if (r & 1) all_apply(--r, f);
                l >>= 1;
                r >>= 1;
            }
            l = l2;
            r = r2;
        }

        for (int i = 1; i <= log; i++) {
            if (((l >> i) << i) != l) update(l >> i);
            if (((r >> i) << i) != r) update((r - 1) >> i);
        }
    }

    template <bool (*g)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return g(x); });
    }
    template <class G> int max_right(int l, G g) {
        assert(0 <= l && l <= _n);
        assert(g(e()));
        if (l == _n) return _n;
        l += size;
        for (int i = log; i >= 1; i--) push(l >> i);
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!g(op(sm, d[l]))) {
                while (l < size) {
                    push(l);
                    l = (2 * l);
                    if (g(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 (*g)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return g(x); });
    }
    template <class G> int min_left(int r, G g) {
        assert(0 <= r && r <= _n);
        assert(g(e()));
        if (r == 0) return 0;
        r += size;
        for (int i = log; i >= 1; i--) push((r - 1) >> i);
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!g(op(d[r], sm))) {
                while (r < size) {
                    push(r);
                    r = (2 * r + 1);
                    if (g(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;
    std::vector<F> lz;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
    void all_apply(int k, F f) {
        d[k] = mapping(f, d[k]);
        if (k < size) lz[k] = composition(f, lz[k]);
    }
    void push(int k) {
        all_apply(2 * k, lz[k]);
        all_apply(2 * k + 1, lz[k]);
        lz[k] = id();
    }
};

}  // namespace atcoder


struct S{
    ll zero;
    ll one;
    ll sz;
};

S op(S a,S b){
    return S{a.zero&b.zero,(a.one&b.zero)|(a.zero&b.one),a.sz+b.sz};
}

S e(){
    return S{LLONG_MAX,LLONG_MAX,0};
}

S mapping(ll f,S x){
    if(x.sz == 1) return S{x.zero&f,LLONG_MAX,1};
    return S{x.zero&f,x.one&f,x.sz};
}

ll composition(ll f,ll g){
    return f&g;
}

ll id(){
    return LLONG_MAX;
}

int MsbIndex(unsigned long long x) noexcept {
    return 63 - __builtin_clzll(x);
}

int main(){
    ii(N,Q);
    li(A,N);
    vector<S> tmp(N);
    rep(i,N){
        tmp[i] = S{A[i],LLONG_MAX,1};
    }
    atcoder::lazy_segtree<S,op,e,ll,mapping,composition,id> seg(tmp);
    debug(seg.get(0).zero);
    debug(seg.prod(0,3).zero);

    rep(Q){
        ii(T);
        if(T == 1){
            ii(L,R,X);
            seg.apply(L-1,R,X);
        }else if(T == 2){
            ii(s,x);
            seg.set(s-1,S{x,LLONG_MAX,1});
        }else{
            ii(L,R);
            debug(L-1,R);
            S tmp = seg.prod(L-1,R);
            debug(tmp.one,tmp.zero);
            
            if(tmp.one == 0){
                out(0);
            }else if(tmp.one == tmp.zero){
                out(tmp.zero);
            }else{
                ll B = 1LL<<MsbIndex(tmp.zero^tmp.one);
                debug(B);
                ll idx = seg.max_right(L-1,[B](S x){return ((x.zero&B) != 0);});
                ll result = LLONG_MAX;
                if(idx != L-1){
                    debug(L-1,idx);
                    result = result & (seg.prod(L-1,idx).zero);
                }
                if(idx+1 != R){
                    debug(idx+1,R);
                    result = result & (seg.prod(idx+1,R).zero);
                }
                out(result);
            }

        }
    }

}

Source code, Language: C++23

这程序好像有点Bug，我给组数据试试？

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3624kb

input:

output:

result:

ok 6 lines

Test #2:

score: 0

Accepted

time: 0ms

memory: 3808kb

input:

10 10
6760061359215711796 1568091718842717482 1568091718842717482 1568091718842717482 5232472783634052627 8795942500783873690 1568091718842717482 1568091718842717482 1568091718842717482 1568091718842717482
1 3 5 7587422031989082829
3 6 10
1 7 8 5197616143400216932
2 4 2518604563805514908
2 2 4533959...

output:

1568091718842717482
35184908959744
176025477579040
8795942500783873690

result:

ok 4 lines

Test #3:

score: 0

Accepted

time: 1ms

memory: 3880kb

input:

100 100
4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 625967318191814868 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072360993 4263579105072...

output:

576531121047601152
1
576460752303423488
4263579105072360993
1306043896232411137
4263579105072360993
576531121047601152
633397148123136
0
1153488865559840256
1152922054496880128
1730020640668059136
3533641810948498945
67108864
1730020640668059136
0
633397148123136
1729382296723653632
0
17300206406680...

result:

ok 78 lines

Test #4:

score: 0

Accepted

time: 0ms

memory: 3904kb

input:

1000 1000
3368486440884437410 3368486440884437410 3368486440884437410 3368486440884437410 3368486440884437410 3368486440884437410 3368486440884437410 3368486440884437410 3368486440884437410 3368486440884437410 3368486440884437410 3639580211161047627 3368486440884437410 3368486440884437410 3368486440...

output:

3368486440884437410
3368486440884437410
3368486440884437410
2251799981457408
0
0
3368486440884437410
0
3326828075601101216
592509842556584322
0
0
0
0
0
0
37154696925806592
0
0
0
3368486440884437410
0
0
3368486440884437410
0
578998425140330496
0
0
134217728
0
3368486440884437410
2306405959167115264
0...

result:

ok 732 lines

Test #5:

score: 0

Accepted

time: 63ms

memory: 13648kb

input:

100000 100000
4364025563773184234 7745126251050571359 5111681002836044963 7745126251050571359 7745126251050571359 7745126251050571359 7745126251050571359 7745126251050571359 7745126251050571359 7745126251050571359 7745126251050571359 7745126251050571359 7222555899134537718 7745126251050571359 686495...

output:

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
4613942216556019776
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

result:

ok 75105 lines

Test #6:

score: 0

Accepted

time: 870ms

memory: 92096kb

input:

1000000 1000000
5485203341817263234 5485203341817263234 5485203341817263234 5485203341817263234 5485203341817263234 5485203341817263234 5485203341817263234 5485203341817263234 5485203341817263234 5485203341817263234 5485203341817263234 5485203341817263234 5485203341817263234 5485203341817263234 5485...

output:

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
8796093022208
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
576460754450907136
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0...

result:

ok 749866 lines

Test #7:

score: 0

Accepted

time: 800ms

memory: 91808kb

input:

1000000 1000000
6478641409915854014 6478641409915854014 6478641409915854014 6478641409915854014 6478641409915854014 6478641409915854014 6478641409915854014 6478641409915854014 6478641409915854014 6478641409915854014 6478641409915854014 815888006180307319 6478641409915854014 6478641409915854014 37784...

output:

result:

ok 749822 lines

Test #8:

score: 0

Accepted

time: 817ms

memory: 91828kb

input:

1000000 1000000
8129239286682760854 3981028880940170401 2535635990161413927 8316479514668652599 5147316903112543089 4630570098268037408 8505388156841465368 2203883581249948495 581610100009626881 5079268521394939 1476469952815397946 4914699404295060276 4440084747042452220 2702894635900623841 90540586...

output:

result:

ok 749812 lines

Test #9:

score: 0

Accepted

time: 832ms

memory: 91824kb

input:

1000000 1000000
7320373167365396487 7320373167365396487 937526916087788458 7320373167365396487 7320373167365396487 7320373167365396487 6758767667984378025 7320373167365396487 7320373167365396487 7320373167365396487 5687396935769483606 1467370155631201061 3556475128226340387 2212274051825085385 77978...

output:

result:

ok 748638 lines

Test #10:

score: 0

Accepted

time: 0ms

memory: 3608kb

input:

2 2
3937866409909043622 2873041425983999763
2 2 3645842096674595914
2 1 5018240021376355677

output:

result:

ok 0 lines

Test #11:

score: 0

Accepted

time: 774ms

memory: 91640kb

input:

1000000 1000000
4900813446099088166 4900813446099088166 4900813446099088166 4900813446099088166 4900813446099088166 4900813446099088166 4900813446099088166 4900813446099088166 4900813446099088166 4900813446099088166 4900813446099088166 4900813446099088166 4900813446099088166 4900813446099088166 4900...

output:

4900813446099088166
4899930503817200418
4900813446099088166
4899916948900413730
4899916948900413730
4899930503817200418
4899930503817200418
4899930503817200418
4899930503817200418
4900813446099088166
288230380446679040
288230380446679040
4899930503817200418
4899930503817200418
0
768
768
288230724044...

result:

ok 748697 lines

Test #12:

score: 0

Accepted

time: 784ms

memory: 91904kb

input:

1000000 1000000
4896682234503638342 4896682234503638342 4896682234503638342 4896682234503638342 4896682234503638342 4896682234503638342 4896682234503638342 4896682234503638342 4896682234503638342 4896682234503638342 4896682234503638342 4896682234503638342 4896682234503638342 4896682234503638342 4896...

output:

4896682234503638342
4896682234503638342
4896682234503638342
82333682484117506
4896682234503638342
82333682484117506
9150188513918978
9150188513918978
4896682234503638342
4896682234503638342
9150188513918978
4896682234503638342
9150188513918978
4896682234503638342
4896682234503638342
9150188513918978...

result:

ok 748737 lines

Test #13:

score: 0

Accepted

time: 828ms

memory: 91816kb

input:

1000000 1000000
5828086749355423563 5828086749355423563 5828086749355423563 5828086749355423563 5828086749355423563 5828086749355423563 5828086749355423563 5828086749355423563 5828086749355423563 5828086749355423563 5828086749355423563 5828086749355423563 5828086749355423563 5828086749355423563 5828...

output:

5828086749355423563
8192
0
0
1152921504793493761
0
0
0
134217728
5828086749355423563
4647719230811407937
0
0
0
0
4647719230811407937
4611686018427396096
0
0
4415226380288
0
0
0
0
4665729214006427657
0
0
4665729213955833856
0
4665733612138661120
0
0
4611686018429485056
4666015104295802624
0
0
0
0
0
4...

result:

ok 749804 lines

Test #14:

score: 0

Accepted

time: 868ms

memory: 91748kb

input:

1000000 1000000
1970703737173261435 1970703737173261435 1970703737173261435 1970703737173261435 1970703737173261435 1970703737173261435 1970703737173261435 1970703737173261435 1970703737173261435 1970703737173261435 1970703737173261435 1970703737173261435 1970703737173261435 1970703737173261435 1970...

output:

18014398510006272
1970703737173261435
1970703737173261435
18014398510006272
1170935903116331008
1170935903116331008
1242993501449496576
72057598332903424
72127962782629888
72057594037927936
72057598333165568
70405251923968
0
0
0
0
0
0
0
673367418922088530
72127962782892032
18014398509481984
0
704052...

result:

ok 749806 lines

Test #15:

score: 0

Accepted

time: 794ms

memory: 91676kb

input:

1000000 1000000
1268538845505400998 1268538845505400998 1268538845505400998 1268538845505400998 1268538845505400998 1268538845505400998 1268538845505400998 1268538845505400998 1268538845505400998 1268538845505400998 1268538845505400998 1268538845505400998 1268538845505400998 1268538845505400998 1268...

output:

1191203210145169410
0
0
0
0
0
0
0
8589934592
705069918064678
704786953404416
0
0
1268538845505400998
1268538845505400998
4503633987117056
8589934592
0
633318697730048
2251804108783616
0
0
0
0
4503599627374592
0
0
0
0
704791248371712
1099511627776
0
0
0
1268538845505400998
0
0
633318731153408
1268538...

result:

ok 749818 lines

Test #16:

score: 0

Accepted

time: 950ms

memory: 91816kb

input:

1000000 1000000
8796374617094329340 8796374617094329340 8796374617094329340 8796374617094329340 8796374617094329340 8796374617094329340 8796374617094329340 8796374617094329340 8796374617094329340 8796374617094329340 8796374617094329340 8796374617094329340 8796374617094329340 8796374617094329340 8796...

output:

0
0
0
0
0
0
0
0
0
0
4612249037637189632
0
0
0
0
0
0
144115189706063880
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
8219350795484238412
0
0
0
536870912
0
0
0
0
0
0
8214847195317895748
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
144115188092633600
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

result:

ok 749921 lines

Test #17:

score: 0

Accepted

time: 828ms

memory: 91912kb

input:

1000000 1000000
1639525139600828208 1639525139600828208 1639525139600828208 1639525139600828208 1639525139600828208 1639525139600828208 1639525139600828208 1639525139600828208 1639525139600828208 1639525139600828208 1639525139600828208 1639525139600828208 1639525139600828208 1639525139600828208 1639...

output:

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
324259173170675712
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
288231492843216896
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
144115188075864064
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0...

result:

ok 749798 lines

Test #18:

score: 0

Accepted

time: 768ms

memory: 91760kb

input:

1000000 1000000
504297928904866451 504297928904866451 504297928904866451 504297928904866451 504297928904866451 504297928904866451 504297928904866451 504297928904866451 504297928904866451 504297928904866451 504297928904866451 504297928904866451 504297928904866451 504297928904866451 504297928904866451...

output:

504297928904866451
504297928904866451
504297928904866451
504297928904866451
504297928904866451
504297928904866451
504297928904866451
504297928904866451
504297928904866451
504297928904866451
292733989738811392
504297928904866451
504297928904866451
504297928904866451
504297928904866451
504297928904866...

result:

ok 332866 lines

Test #19:

score: 0

Accepted

time: 813ms

memory: 91704kb

input:

1000000 1000000
2984855923226151208 2984855923226151208 2984855923226151208 2984855923226151208 2984855923226151208 2984855923226151208 2984855923226151208 2984855923226151208 2984855923226151208 2984855923226151208 2984855923226151208 2984855923226151208 2984855923226151208 2984855923226151208 2984...

output:

2984855923226151208

result:

ok single line: '2984855923226151208'

Test #20:

score: 0

Accepted

time: 506ms

memory: 91672kb

input:

1000000 1000000
2067242734448201478 2067242734448201478 2067242734448201478 2067242734448201478 2067242734448201478 2067242734448201478 2067242734448201478 2067242734448201478 2067242734448201478 2067242734448201478 2067242734448201478 2067242734448201478 2067242734448201478 2067242734448201478 2067...

output:

result:

ok single line: '0'

Test #21:

score: 0

Accepted

time: 900ms

memory: 91748kb

input:

1000000 1000000
4549453206535718492 4549453206535718492 4549453206535718492 4549453206535718492 4549453206535718492 4549453206535718492 4549453206535718492 4549453206535718492 4549453206535718492 4549453206535718492 4549453206535718492 4549453206535718492 4549453206535718492 4549453206535718492 4549...

output:

4549453206535718492
4549453206535718492
4549453206535718492
4549453206535718492
4549453206535718492
4549453206535718492
4549453206535718492
4549453206535718492
4549453206535718492
4549453206535718492
4549453206535718492
4549453206535718492
4549453206535718492
4549453206535718492
4549453206535718492
...

result:

ok 1000000 lines

Test #22:

score: 0

Accepted

time: 803ms

memory: 91752kb

input:

1000000 1000000
508429140500316275 508429140500316275 508429140500316275 508429140500316275 508429140500316275 508429140500316275 508429140500316275 508429140500316275 508429140500316275 508429140500316275 508429140500316275 508429140500316275 508429140500316275 508429140500316275 508429140500316275...

output:

508429140500316275
508429140500316275
508429140500316275
508429140500316275
508429140500316275
508429140500316275
508429140500316275
508429140500316275
508429140500316275
508429140500316275
508429140500316275
508429140500316275
508429140500316275
508429140500316275
508429140500316275
508429140500316...

result:

ok 749894 lines

Test #23:

score: 0

Accepted

time: 733ms

memory: 91936kb

input:

1000000 1000000
6184554809109693663 6184554809109693663 6184554809109693663 6184554809109693663 6184554809109693663 6184554809109693663 6184554809109693663 6184554809109693663 6184554809109693663 6184554809109693663 6184554809109693663 6184554809109693663 6184554809109693663 6184554809109693663 6184...

output:

72057594037927936
108438303632146450
5819200270512603152
396527890631622850
4683745811488571528
6184554809109693663
0
72057594037927936
108438303632146450
6184554809109693663
6184554809109693663
72059793061183624
36099165763141632
4683745811488571528
6184554809109693663
6184554809109693663
720575940...

result:

ok 332716 lines

Test #24:

score: 0

Accepted

time: 771ms

memory: 91756kb

input:

1000000 1000000
8665112799136011124 8665112799136011124 8665112799136011124 8665112799136011124 8665112799136011124 8665112799136011124 8665112799136011124 8665112799136011124 8665112799136011124 8665112799136011124 8665112799136011124 8665112799136011124 8665112799136011124 8665112799136011124 8665...

output:

8665112799136011124

result:

ok single line: '8665112799136011124'

Test #25:

score: 0

Accepted

time: 523ms

memory: 91920kb

input:

1000000 1000000
7747499610358061394 7747499610358061394 7747499610358061394 7747499610358061394 7747499610358061394 7747499610358061394 7747499610358061394 7747499610358061394 7747499610358061394 7747499610358061394 7747499610358061394 7747499610358061394 7747499610358061394 7747499610358061394 7747...

output:

result:

ok single line: '0'

Test #26:

score: 0

Accepted

time: 1986ms

memory: 91832kb

input:

1000000 1000000
1006338049885769895 1006338049885769895 1006338049885769895 1006338049885769895 1006338049885769895 1006338049885769895 1006338049885769895 1006338049885769895 1006338049885769895 1006338049885769895 1006338049885769895 1006338049885769895 1006338049885769895 1006338049885769895 1006...

output:

1006338049885769895
1006338049885769895
865598272308383749
1006338049885769895
586620239750365190
1006338049885769895
1006338049885769895
577586652210266114
613615520096321538
1006338049885769895
1006338049885769895
1006338049885769895
1006338049885769895
1006338049885769895
1125899906842624
1006338...

result:

ok 1000000 lines

Test #27:

score: 0

Accepted

time: 852ms

memory: 91832kb

input:

1000000 1000000
6188686016410176191 6188686016410176191 6188686016410176191 6188686016410176191 6188686016410176191 6188686016410176191 6188686016410176191 6188686016410176191 6188686016410176191 6188686016410176191 6188686016410176191 6188686016410176191 6188686016410176191 6188686016410176191 6188...

output:

6188686016410176191
0
0
6188686016410176191
4612248968380942372
6188686016410176191
6188686016410176191
6188686016410176191
6188686016410176191
1234022721638778909
0
6188686016410176191
0
6188686016410176191
6188686016410176191
6188686016410176191
6188686016410176191
4738491614543890493
540431955284...

result:

ok 748681 lines

Test #28:

score: 0

Accepted

time: 704ms

memory: 91932kb

input:

1000000 1000000
7177992877208284442 7177992877208284442 7177992877208284442 7177992877208284442 7177992877208284442 7177992877208284442 7177992877208284442 7177992877208284442 7177992877208284442 7177992877208284442 7177992877208284442 7177992877208284442 7177992877208284442 7177992877208284442 7177...

output:

7177992877208284442
0
0
0
0
0
0
0
2216739995648
2451084097464860672
7177992877208284442
2309291391953440018
0
0
67108864
0
0
0
0
0
0
7177992877208284442
0
0
0
0
0
0
0
7177992877208284442
0
0
7177992877208284442
0
0
0
536870912
0
0
0
0
0
0
0
7177992877208284442
0
7177992877208284442
0
0
0
0
0
0
0
0
0...

result:

ok 333960 lines

Test #29:

score: 0

Accepted

time: 784ms

memory: 91812kb

input:

1000000 1000000
435178830379826095 435178830379826095 435178830379826095 435178830379826095 435178830379826095 435178830379826095 435178830379826095 435178830379826095 435178830379826095 435178830379826095 435178830379826095 435178830379826095 435178830379826095 435178830379826095 435178830379826095...

output:

result:

ok single line: '0'

Test #30:

score: 0

Accepted

time: 499ms

memory: 91736kb

input:

1000000 1000000
8740937678456652174 8740937678456652174 8740937678456652174 8740937678456652174 8740937678456652174 8740937678456652174 8740937678456652174 8740937678456652174 8740937678456652174 8740937678456652174 8740937678456652174 8740937678456652174 8740937678456652174 8740937678456652174 8740...

output:

result:

ok single line: '0'

Test #31:

score: 0

Accepted

time: 1129ms

memory: 91964kb

input:

1000000 1000000
1999776117984360675 1999776117984360675 1999776117984360675 1999776117984360675 1999776117984360675 1999776117984360675 1999776117984360675 1999776117984360675 1999776117984360675 1999776117984360675 1999776117984360675 1999776117984360675 1999776117984360675 1999776117984360675 1999...

output:

0
0
36028797018963968
576601489892724738
0
0
0
36028797018963968
0
0
8388608
0
0
0
144115188075855872
1999776117984360675
0
0
0
720575940450582530
0
0
0
1783427379079682112
0
0
1999776117984360675
67108864
0
0
1999776117984360675
0
0
0
0
0
0
180145668722001922
0
0
1999776117984360675
0
0
57646075237...

result:

ok 1000000 lines

Test #32:

score: 0

Accepted

time: 860ms

memory: 91756kb

input:

1000000 1000000
7182124084508766970 7182124084508766970 7182124084508766970 7182124084508766970 7182124084508766970 7182124084508766970 7182124084508766970 7182124084508766970 7182124084508766970 7182124084508766970 7182124084508766970 7182124084508766970 7182124084508766970 7182124084508766970 7182...

output:

0
0
1140850688
34359738368
0
7182124084508766970
0
7182124084508766970
0
2558050962170446072
0
0
108088316276768776
0
0
0
72057594037928000
0
7182124084508766970
7182124084508766970
0
0
0
144115462970540032
0
0
4613942220590940160
0
4611690416473899008
7182124084508766970
0
536875008
0
0
0
461168601...

result:

ok 748671 lines

Test #33:

score: 0

Accepted

time: 948ms

memory: 91916kb

input:

1000000 1000000
1942977031860337769 1942977031860337769 1942977031860337769 1942977031860337769 1942977031860337769 1942977031860337769 1942977031860337769 1942977031860337769 1942977031860337769 1942977031860337769 1942977031860337769 1942977031860337769 1942977031860337769 1942977031860337769 1942...

output:

result:

ok 333672 lines

Test #34:

score: 0

Accepted

time: 794ms

memory: 91984kb

input:

1000000 1000000
4423535017591687934 4423535017591687934 4423535017591687934 4423535017591687934 4423535017591687934 4423535017591687934 4423535017591687934 4423535017591687934 4423535017591687934 4423535017591687934 4423535017591687934 4423535017591687934 4423535017591687934 4423535017591687934 4423...

output:

result:

ok single line: '0'

Test #35:

score: 0

Accepted

time: 507ms

memory: 91744kb

input:

1000000 1000000
3505921828813738205 3505921828813738205 3505921828813738205 3505921828813738205 3505921828813738205 3505921828813738205 3505921828813738205 3505921828813738205 3505921828813738205 3505921828813738205 3505921828813738205 3505921828813738205 3505921828813738205 3505921828813738205 3505...

output:

result:

ok single line: '0'

Test #36:

score: 0

Accepted

time: 895ms

memory: 91912kb

input:

1000000 1000000
5988132305196222514 5988132305196222514 5988132305196222514 5988132305196222514 5988132305196222514 5988132305196222514 5988132305196222514 5988132305196222514 5988132305196222514 5988132305196222514 5988132305196222514 5988132305196222514 5988132305196222514 5988132305196222514 5988...

output:

result:

ok 1000000 lines

Test #37:

score: 0

Accepted

time: 828ms

memory: 91704kb

input:

1000000 1000000
1947108239160820297 1947108239160820297 1947108239160820297 1947108239160820297 1947108239160820297 1947108239160820297 1947108239160820297 1947108239160820297 1947108239160820297 1947108239160820297 1947108239160820297 1947108239160820297 1947108239160820297 1947108239160820297 1947...

output:

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
72057594037927936
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
...

result:

ok 749802 lines

Test #38:

score: 0

Accepted

time: 796ms

memory: 91828kb

input:

1000000 1000000
7317107235147368050 7317107235147368050 7317107235147368050 4600578496744841855 7317107235147368050 7317107235147368050 7317107235147368050 7317107235147368050 7317107235147368050 7317107235147368050 7317107235147368050 7317107235147368050 7317107235147368050 7317107235147368050 7317...

output:

result:

ok 333436 lines

Test #39:

score: 0

Accepted

time: 751ms

memory: 91932kb

input:

1000000 1000000
574293188318909704 4944707468177635433 574293188318909704 574293188318909704 574293188318909704 574293188318909704 574293188318909704 574293188318909704 574293188318909704 574293188318909704 574293188318909704 574293188318909704 574293188318909704 574293188318909704 57429318831890970...

output:

result:

ok single line: '0'

Test #40:

score: 0

Accepted

time: 513ms

memory: 91748kb

input:

1000000 1000000
8880052036395735782 3370270453805280236 8880052036395735782 8880052036395735782 8880052036395735782 1658134037767948557 8880052036395735782 8880052036395735782 8880052036395735782 8880052036395735782 8880052036395735782 8880052036395735782 8880052036395735782 8880052036395735782 8880...

output:

result:

ok single line: '0'

Test #41:

score: 0

Accepted

time: 929ms

memory: 91816kb

input:

1000000 1000000
2138890471628476987 2138890471628476987 2138890471628476987 2138890471628476987 2701792061270764955 2138890471628476987 2138890471628476987 2138890471628476987 2138890471628476987 2138890471628476987 2138890471628476987 2138890471628476987 2138890471628476987 2138890471628476987 2138...

output:

result:

ok 1000000 lines

Test #42:

score: 0

Accepted

time: 899ms

memory: 91976kb

input:

1000000 1000000
7321238446742817875 7321238446742817875 7321238446742817875 7321238446742817875 7321238446742817875 7321238446742817875 7321238446742817875 7321238446742817875 7321238446742817875 7820924246120346674 7321238446742817875 7321238446742817875 5438336241901164245 7321238446742817875 7321...

output:

result:

ok 749867 lines

Test #43:

score: 0

Accepted

time: 809ms

memory: 91684kb

input:

1000000 1000000
3054479303901583481 8542634789265589102 8763189460173490994 347954343321867304 5222257548302493370 712096612126303857 2867956275070561479 6768117976397374494 974347337482414457 4846917705740109840 1173714437444948014 7689180196230725026 1870065106406661228 5713656305935716013 8838370...

output:

result:

ok 332080 lines

Test #44:

score: 0

Accepted

time: 800ms

memory: 91848kb

input:

1000000 1000000
3876614458574008376 4741853542709157004 4113796830973601145 2046436256465908709 3055342624729765891 1192232949927567332 3617135185251329161 4244429430125165045 9008946355953563209 7538283737575629071 3124585565884909456 7802900471543569769 7325524157133848371 8097641637928408187 8181...

output:

result:

ok single line: '0'

Test #45:

score: 0

Accepted

time: 514ms

memory: 91916kb

input:

1000000 1000000
2204224844440371035 4706225475966106828 7590764880989545789 968258618815192087 4871801479478214208 8334168953004088852 5815686574630432208 9044047138872679740 352877046176358731 7058547126911457861 8927495754168168077 4858322205252282008 4007046136625129447 7641555299477879625 795068...

output:

result:

ok single line: '0'

Test #46:

score: 0

Accepted

time: 939ms

memory: 91708kb

input:

1000000 1000000
8572456815015360828 9065175774525643199 8907194210947259255 5840576792698844521 4768429288789849247 1083881102283466146 5337575929083902441 4896724651392637579 1795095553483724716 2215948131189145110 4899679426885149279 8573239497676519612 5378303725044348237 8120677465899761982 1446...

output:

result:

ok 1000000 lines

Test #47:

score: 0

Accepted

time: 891ms

memory: 91804kb

input:

1000000 1000000
6350775739666562514 2830574490951496717 5055429467350151491 2114122379229172904 5612631682420972581 4063544390268497051 3854023556991475654 6003873803436605896 3086602084692080112 2112115579992567114 6444273330101427721 566510939575940430 7661840119654565299 1795465237863212561 48804...

output:

result:

ok 749892 lines

Extra Test:

score: 0

Extra Test Passed