QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#854412	#9727. Barkley III	ucup-team2796	AC ✓	1027ms	116560kb	C++17	16.7kb	2025-01-12 00:45:31	2025-01-13 04:18:56

Judging History

你现在查看的是最新测评结果

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

测评结果：AC
用时：1027ms
内存：116560kb

查看

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

[2025-01-12 00:45:31]
评测

测评结果：100
用时：1273ms
内存：116532kb

查看

[2025-01-12 00:45:31]
提交

answer

#line 1 "library/Template/template.hpp"
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())

using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;

template <typename T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}
template <typename T, typename U> T ceil(T x, U y) {
    assert(y != 0);
    if (y < 0)
        x = -x, y = -y;
    return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U> T floor(T x, U y) {
    assert(y != 0);
    if (y < 0)
        x = -x, y = -y;
    return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T> int popcnt(T x) {
    return __builtin_popcountll(x);
}
template <typename T> int topbit(T x) {
    return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <typename T> int lowbit(T x) {
    return (x == 0 ? -1 : __builtin_ctzll(x));
}

template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << "P(" << p.first << ", " << p.second << ")";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
    os << "{";
    for (int i = 0; i < vec.size(); i++) {
        os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
    }
    os << "}";
    return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    os << "{";
    for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {
        os << "(" << itr->first << ", " << itr->second << ")";
        itr++;
        if (itr != map_var.end())
            os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {
    os << "{";
    for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {
        os << *itr;
        ++itr;
        if (itr != set_var.end())
            os << ", ";
        itr--;
    }
    os << "}";
    return os;
}
#ifdef LOCAL
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define show(...) true
#endif
template <typename T> void _show(int i, T name) {
    cerr << '\n';
}
template <typename T1, typename T2, typename... T3>
void _show(int i, const T1 &a, const T2 &b, const T3 &...c) {
    for (; a[i] != ',' && a[i] != '\0'; i++)
        cerr << a[i];
    cerr << ":" << b << " ";
    _show(i + 1, a, c...);
}
#line 2 "library/Utility/fastio.hpp"
#include <unistd.h>
namespace fastio {
static constexpr uint32_t SZ = 1 << 17;
char ibuf[SZ];
char obuf[SZ];
char out[100];
// pointer of ibuf, obuf

uint32_t pil = 0, pir = 0, por = 0;

struct Pre {
    char num[10000][4];
    constexpr Pre() : num() {
        for (int i = 0; i < 10000; i++) {
            int n = i;
            for (int j = 3; j >= 0; j--) {
                num[i][j] = n % 10 | '0';
                n /= 10;
            }
        }
    }
} constexpr pre;

inline void load() {
    memmove(ibuf, ibuf + pil, pir - pil);
    pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);
    pil = 0;
    if (pir < SZ)
        ibuf[pir++] = '\n';
}

inline void flush() {
    fwrite(obuf, 1, por, stdout);
    por = 0;
}

void rd(char &c) {
    do {
        if (pil + 1 > pir)
            load();
        c = ibuf[pil++];
    } while (isspace(c));
}

void rd(string &x) {
    x.clear();
    char c;
    do {
        if (pil + 1 > pir)
            load();
        c = ibuf[pil++];
    } while (isspace(c));
    do {
        x += c;
        if (pil == pir)
            load();
        c = ibuf[pil++];
    } while (!isspace(c));
}

template <typename T> void rd_real(T &x) {
    string s;
    rd(s);
    x = stod(s);
}

template <typename T> void rd_integer(T &x) {
    if (pil + 100 > pir)
        load();
    char c;
    do
        c = ibuf[pil++];
    while (c < '-');
    bool minus = 0;
    if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
        if (c == '-') {
            minus = 1, c = ibuf[pil++];
        }
    }
    x = 0;
    while ('0' <= c) {
        x = x * 10 + (c & 15), c = ibuf[pil++];
    }
    if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
        if (minus)
            x = -x;
    }
}

void rd(int &x) {
    rd_integer(x);
}
void rd(ll &x) {
    rd_integer(x);
}
void rd(i128 &x) {
    rd_integer(x);
}
void rd(uint &x) {
    rd_integer(x);
}
void rd(ull &x) {
    rd_integer(x);
}
void rd(u128 &x) {
    rd_integer(x);
}
void rd(double &x) {
    rd_real(x);
}
void rd(long double &x) {
    rd_real(x);
}

template <class T, class U> void rd(pair<T, U> &p) {
    return rd(p.first), rd(p.second);
}
template <size_t N = 0, typename T> void rd_tuple(T &t) {
    if constexpr (N < std::tuple_size<T>::value) {
        auto &x = std::get<N>(t);
        rd(x);
        rd_tuple<N + 1>(t);
    }
}
template <class... T> void rd(tuple<T...> &tpl) {
    rd_tuple(tpl);
}

template <size_t N = 0, typename T> void rd(array<T, N> &x) {
    for (auto &d : x)
        rd(d);
}
template <class T> void rd(vector<T> &x) {
    for (auto &d : x)
        rd(d);
}

void read() {}
template <class H, class... T> void read(H &h, T &...t) {
    rd(h), read(t...);
}

void wt(const char c) {
    if (por == SZ)
        flush();
    obuf[por++] = c;
}
void wt(const string s) {
    for (char c : s)
        wt(c);
}
void wt(const char *s) {
    size_t len = strlen(s);
    for (size_t i = 0; i < len; i++)
        wt(s[i]);
}

template <typename T> void wt_integer(T x) {
    if (por > SZ - 100)
        flush();
    if (x < 0) {
        obuf[por++] = '-', x = -x;
    }
    int outi;
    for (outi = 96; x >= 10000; outi -= 4) {
        memcpy(out + outi, pre.num[x % 10000], 4);
        x /= 10000;
    }
    if (x >= 1000) {
        memcpy(obuf + por, pre.num[x], 4);
        por += 4;
    } else if (x >= 100) {
        memcpy(obuf + por, pre.num[x] + 1, 3);
        por += 3;
    } else if (x >= 10) {
        int q = (x * 103) >> 10;
        obuf[por] = q | '0';
        obuf[por + 1] = (x - q * 10) | '0';
        por += 2;
    } else
        obuf[por++] = x | '0';
    memcpy(obuf + por, out + outi + 4, 96 - outi);
    por += 96 - outi;
}

template <typename T> void wt_real(T x) {
    ostringstream oss;
    oss << fixed << setprecision(15) << double(x);
    string s = oss.str();
    wt(s);
}

void wt(int x) {
    wt_integer(x);
}
void wt(ll x) {
    wt_integer(x);
}
void wt(i128 x) {
    wt_integer(x);
}
void wt(uint x) {
    wt_integer(x);
}
void wt(ull x) {
    wt_integer(x);
}
void wt(u128 x) {
    wt_integer(x);
}
void wt(double x) {
    wt_real(x);
}
void wt(long double x) {
    wt_real(x);
}

template <class T, class U> void wt(const pair<T, U> val) {
    wt(val.first);
    wt(' ');
    wt(val.second);
}
template <size_t N = 0, typename T> void wt_tuple(const T t) {
    if constexpr (N < std::tuple_size<T>::value) {
        if constexpr (N > 0) {
            wt(' ');
        }
        const auto x = std::get<N>(t);
        wt(x);
        wt_tuple<N + 1>(t);
    }
}
template <class... T> void wt(tuple<T...> tpl) {
    wt_tuple(tpl);
}
template <class T, size_t S> void wt(const array<T, S> val) {
    auto n = val.size();
    for (size_t i = 0; i < n; i++) {
        if (i)
            wt(' ');
        wt(val[i]);
    }
}
template <class T> void wt(const vector<T> val) {
    auto n = val.size();
    for (size_t i = 0; i < n; i++) {
        if (i)
            wt(' ');
        wt(val[i]);
    }
}

void print() {
    wt('\n');
}
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
    wt(head);
    if (sizeof...(Tail))
        wt(' ');
    print(forward<Tail>(tail)...);
}
void __attribute__((destructor)) _d() {
    flush();
}
} // namespace fastio

using fastio::flush;
using fastio::print;
using fastio::read;

inline void first(bool i = true) {
    print(i ? "first" : "second");
}
inline void Alice(bool i = true) {
    print(i ? "Alice" : "Bob");
}
inline void Takahashi(bool i = true) {
    print(i ? "Takahashi" : "Aoki");
}
inline void yes(bool i = true) {
    print(i ? "yes" : "no");
}
inline void Yes(bool i = true) {
    print(i ? "Yes" : "No");
}
inline void No() {
    print("No");
}
inline void YES(bool i = true) {
    print(i ? "YES" : "NO");
}
inline void NO() {
    print("NO");
}
inline void Yay(bool i = true) {
    print(i ? "Yay!" : ":(");
}
inline void Possible(bool i = true) {
    print(i ? "Possible" : "Impossible");
}
inline void POSSIBLE(bool i = true) {
    print(i ? "POSSIBLE" : "IMPOSSIBLE");
}

/**
 * @brief Fast IO
 */
#line 3 "sol.cpp"

#line 2 "library/DataStructure/fastset.hpp"

struct FastSet{
    static constexpr int B=64;
    int n,lg;
    vector<vector<ull>> seg;
    FastSet(int m):n(m){
        do{
            seg.push_back(vector<ull>((m+B-1)/B));
            m=(m+B-1)/B;
        }while(m>1);
        lg=seg.size();
    }
    bool operator[](int i)const{
        return (seg[0][i/B]>>(i%B)&1);
    }
    void insert(int i){
        rep(h,0,lg){
            seg[h][i/B]|=1ull<<(i%B);
            i/=B;
        }
    }
    void erase(int i){
        rep(h,0,lg){
            seg[h][i/B]&=~(1ull<<(i%B));
            if(seg[h][i/B])break;
            i/=B;
        }
    }
    int next(int i){ // smallest >= i
        rep(h,0,lg){
            if(i/B==seg[h].size())break;
            ull d=seg[h][i/B]>>(i%B);
            if(!d){
                i=i/B+1;
                continue;
            }
            i+=lowbit(d);
            for(int g=h-1;g>=0;g--){
                i*=B;
                i+=lowbit(seg[g][i/B]);
            }
            return i;
        }
        return -1;
    }
    int prev(int i){ // largest <= i
        rep(h,0,lg){
            if(i==-1)break;
            ull d=seg[h][i/B]<<(63-i%64);
            if(!d){
                i=i/B-1;
                continue;
            }
            i+=topbit(d)-(B-1);
            for(int g=h-1;g>=0;g--){
                i*=B;
                i+=topbit(seg[g][i/B]);
            }
            return i;
        }
        return -1;
    }
};

/**
 * @brief Fast Set
 */
#line 2 "library/DataStructure/lazysegtree.hpp"

template <typename M, typename N, M (*f)(M, M), M (*g)(M, N), N (*h)(N, N),
          M (*m1)(), N (*n1)()>
class LazySegmentTree {
    int n, sz, height;
    vector<M> data;
    vector<N> lazy;
    void update(int k) {
        data[k] = f(data[k * 2], data[k * 2 + 1]);
    }
    void apply(int k, N x) {
        data[k] = g(data[k], x);
        if (k < sz)
            lazy[k] = h(lazy[k], x);
    }
    void down(int k) {
        apply(k * 2, lazy[k]);
        apply(k * 2 + 1, lazy[k]);
        lazy[k] = n1();
    }

  public:
    LazySegmentTree(int n = 0) : LazySegmentTree(vector<M>(n, m1())) {}
    LazySegmentTree(const vector<M> &a) : n(SZ(a)) {
        sz = 1, height = 0;
        while (sz < (int)a.size())
            sz <<= 1, height++;
        data.assign(2 * sz, m1());
        lazy.assign(sz, n1());
        rep(i, 0, a.size()) data[sz + i] = a[i];
        for (int i = sz - 1; i; i--)
            update(i);
    }
    M operator[](int k) const {
        k += sz;
        rrep(i, 1, height + 1) down(k >> i);
        return data[k];
    }
    vector<M> get() {
        rep(k, 1, sz) down(k);
        return {data.begin() + sz, data.begin() + sz + n};
    }
    void set(int k, M x) {
        k += sz;
        for (int i = height; i; i--)
            down(k >> i);
        data[k] = x;
        for (int i = 1; i <= height; i++)
            update(k >> i);
    }
    void update(int L, int R, N x) {
        if (L >= R)
            return;
        L += sz, R += sz;
        for (int i = height; i; i--) {
            if (((L >> i) << i) != L)
                down(L >> i);
            if (((R >> i) << i) != R)
                down((R - 1) >> i);
        }
        int lb = L, rb = R;
        while (L < R) {
            if (L & 1)
                apply(L++, x);
            if (R & 1)
                apply(--R, x);
            L >>= 1;
            R >>= 1;
        }
        L = lb, R = rb;
        for (int i = 1; i <= height; i++) {
            if (((L >> i) << i) != L)
                update(L >> i);
            if (((R >> i) << i) != R)
                update((R - 1) >> i);
        }
    }
    M query(int L, int R) {
        if (L >= R)
            return m1();
        L += sz, R += sz;
        for (int i = height; i; i--) {
            if (((L >> i) << i) != L)
                down(L >> i);
            if (((R >> i) << i) != R)
                down((R - 1) >> i);
        }
        M lb = m1(), rb = m1();
        while (L < R) {
            if (L & 1)
                lb = f(lb, data[L++]);
            if (R & 1)
                rb = f(data[--R], rb);
            L >>= 1;
            R >>= 1;
        }
        return f(lb, rb);
    }
    template <class F> int max_right(int L, F ch) {
        if (L == n)
            return n;
        L += sz;
        rrep(i, 1, height + 1) down(L >> i);
        M sum = m1();
        do {
            while (L % 2 == 0)
                L >>= 1;
            if (!ch(f(sum, data[L]))) {
                while (L < sz) {
                    down(L);
                    L <<= 1;
                    if (ch(f(sum, data[L])))
                        sum = f(sum, data[L++]);
                }
                return L - sz;
            }
            sum = f(sum, data[L++]);
        } while ((L & -L) != L);
        return n;
    }
    template <class F> int min_left(int R, F ch) {
        if (R == 0)
            return 0;
        R += sz;
        rrep(i, 1, height + 1) down((R - 1) >> i);
        M sum = m1();
        do {
            R--;
            while (R > 1 and (R & 1))
                R >>= 1;
            if (!ch(f(data[R], sum))) {
                while (R < sz) {
                    down(R);
                    R = (R * 2 + 1);
                    if (ch(f(data[R], sum))) {
                        sum = f(data[R--], sum);
                    }
                }
                return R + 1 - sz;
            }
            sum = f(data[R], sum);
        } while ((R & -R) != R);
        return 0;
    }
};

/**
 * @brief Lazy Segment Tree
 */
#line 6 "sol.cpp"

struct Data {
    ll Len = 0, Val = INT64_MAX, Zero = INT64_MAX, One = 0;
};

Data F(Data a, Data b) {
    return Data{a.Len + b.Len, a.Val & b.Val, a.Zero & b.Zero, (a.One & b.Zero) | (a.Zero & b.One)};
}
Data G(Data a, ll b) {
    if (a.Len == 1) return {a.Len, a.Val & b, a.Zero & b, a.One | (INT64_MAX - b)};
    return Data{a.Len, a.Val & b, a.Zero & b, a.One & b};
}
ll H(ll a, ll b) {
    return a & b;
}
Data n1() {
    return Data{0, INT64_MAX, INT64_MAX, 0};
}
ll n2() {
    return INT64_MAX;
}

int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    ll MAXS = INT64_MAX;
    int n, Q;
    read(n, Q);
    vector<ll> a(n);
    read(a);
    vector<Data> v(n);
    rep(i,0,n) v[i] = Data{1,a[i],a[i],MAXS-a[i]};
    LazySegmentTree<Data, ll, F, G, H, n1, n2> seg(v);
    while (Q--) {
        int type;
        read(type);
        if (type == 1) {
            int L, R;
            ll x;
            read(L, R, x);
            L--;
            seg.update(L,R,x);
        } else if (type == 2) {
            int s;
            ll y;
            read(s, y);
            s--;
            seg.set(s, Data{1,y,y,MAXS-y});
        } else {
            int L, R;
            read(L, R);
            L--;
            auto [len, val, zero, one] = seg.query(L,R);
            if (one == 0) {
                print(val);
                continue;
            }
            int bit = topbit(one);
            int pos = seg.max_right(L, [&](Data d)->bool {return d.Zero & (1LL<<bit);});
            print(seg.query(L,pos).Val & seg.query(pos+1,R).Val);
        }
    }
    return 0;
}

源文件, 语言: C++17

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

詳細信息

Test #1:

score: 100

Accepted

time: 1ms

memory: 3776kb

input:

output:

result:

ok 6 lines

Test #2:

score: 0

Accepted

time: 0ms

memory: 3976kb

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: 4008kb

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: 1ms

memory: 3816kb

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: 36ms

memory: 16856kb

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: 465ms

memory: 116304kb

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: 493ms

memory: 116408kb

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: 461ms

memory: 116404kb

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: 447ms

memory: 116460kb

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: 3692kb

input:

2 2
3937866409909043622 2873041425983999763
2 2 3645842096674595914
2 1 5018240021376355677

output:

result:

ok 0 lines

Test #11:

score: 0

Accepted

time: 437ms

memory: 116344kb

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: 447ms

memory: 116496kb

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: 445ms

memory: 116272kb

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: 436ms

memory: 116420kb

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: 452ms

memory: 116360kb

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: 445ms

memory: 116268kb

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: 449ms

memory: 116408kb

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: 449ms

memory: 116348kb

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: 551ms

memory: 116000kb

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: 294ms

memory: 116156kb

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: 438ms

memory: 116416kb

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: 430ms

memory: 116384kb

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: 440ms

memory: 116424kb

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: 582ms

memory: 116172kb

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: 312ms

memory: 116092kb

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: 1027ms

memory: 116464kb

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: 449ms

memory: 116372kb

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: 430ms

memory: 116412kb

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: 574ms

memory: 116124kb

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: 284ms

memory: 116164kb

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: 644ms

memory: 116460kb

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: 451ms

memory: 116532kb

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: 436ms

memory: 116488kb

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: 569ms

memory: 116092kb

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: 304ms

memory: 116184kb

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: 458ms

memory: 116560kb

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: 448ms

memory: 116356kb

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: 444ms

memory: 116340kb

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: 592ms

memory: 116296kb

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: 297ms

memory: 116196kb

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: 443ms

memory: 116204kb

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: 452ms

memory: 116528kb

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: 449ms

memory: 116276kb

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: 571ms

memory: 116288kb

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: 309ms

memory: 116172kb

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: 454ms

memory: 116436kb

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: 452ms

memory: 116388kb

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