QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#768651#9727. Barkley IIIi_wish_a_girl_friendTL 1216ms96708kbC++236.8kb2024-11-21 13:20:262024-11-21 13:20:26

Judging History

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

  • [2025-01-13 03:55:43]
  • hack成功,自动添加数据
  • (/hack/1447)
  • [2024-11-21 13:20:26]
  • 评测
  • 测评结果:TL
  • 用时:1216ms
  • 内存:96708kb
  • [2024-11-21 13:20:26]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
// #define max(a, b) ((a) > (b) ? (a) : (b))
// #define min(a, b) ((a) < (b) ? (a) : (b))
#define pb push_back
#define LNF 1e18
#define INF 0x7fffffff
#define int long long
#define lowbit(x) ((x) & (-x))
#define abs(x) llabs(x)
#define endl '\n'
#define Y() cout << "Yes" << endl
#define N() cout << "No" << endl
const db eps = 1e-9;
const int mod = 9223372036854775807;
const int MAXN = 2e6 + 5;

int val[1000006];
struct node
{
    int num, is, lazy, siz, sum;
} tr[MAXN << 2];
inline void push_down(int p)
{
    if (tr[p].lazy ^ mod)
    {
        tr[p << 1].lazy &= tr[p].lazy;
        tr[p << 1 | 1].lazy &= tr[p].lazy;
        if (tr[p << 1].siz == 1)
        {
            tr[p << 1].sum &= tr[p].lazy;
            tr[p << 1].num |= (mod ^ tr[p].lazy);
        }
        else
        {
            tr[p << 1].sum &= tr[p].lazy;
            tr[p << 1].is |= (mod ^ tr[p].lazy);
            tr[p << 1].num &= (tr[p].lazy);
        }
        if (tr[p << 1 | 1].siz == 1)
        {
            tr[p << 1 | 1].sum &= tr[p].lazy;
            tr[p << 1 | 1].num |= (mod ^ tr[p].lazy);
        }
        else
        {
            tr[p << 1 | 1].sum &= tr[p].lazy;
            tr[p << 1 | 1].is |= (mod ^ tr[p].lazy);
            tr[p << 1 | 1].num &= (tr[p].lazy);
        }
        tr[p].lazy = mod;
    }
}
inline void push_up(int p)
{
    tr[p].sum = tr[p << 1].sum & tr[p << 1 | 1].sum;
    tr[p].is = (tr[p << 1].num & tr[p << 1 | 1].num) | tr[p << 1].is | tr[p << 1 | 1].is;
    tr[p].num = (tr[p << 1].num ^ tr[p << 1 | 1].num) & (mod ^ tr[p].is);
}
inline void merge(node &a, node b)
{

    a.sum = a.sum & b.sum;
    a.is = (a.num & b.num) | a.is | b.is;
    a.num = (a.num ^ b.num) & (mod ^ a.is);
    // cout << a.num << " " << b.num << endl;
}
void build(int p, int l, int r)
{
    tr[p].siz = r - l + 1;
    tr[p].lazy = mod;
    if (l == r)
    {
        tr[p].num = (mod ^ val[l]);
        tr[p].sum = val[l];
        return;
    }
    int mid = l + r >> 1;
    build(p << 1, l, mid);
    build(p << 1 | 1, mid + 1, r);
    push_up(p);
    // if (l == 6 && r == 9)
    // {
    //     cout << "!" << tr[p].num << endl;
    // }
}
void modify(int p, int l, int r, int pos, int nu)
{
    if (l == r)
    {
        tr[p].sum = nu;
        tr[p].num = (mod ^ nu);
        return;
    }
    push_down(p);
    int mid = l + r >> 1;
    if (pos <= mid)
        modify(p << 1, l, mid, pos, nu);
    else
        modify(p << 1 | 1, mid + 1, r, pos, nu);
    push_up(p);
}
void modify_and(int p, int l, int r, int ql, int qr, int nu)
{
    if (l >= ql && r <= qr)
    {
        if (tr[p].siz == 1)
        {
            tr[p].sum &= nu;
            tr[p].num |= (mod ^ nu);
        }
        else
        {
            tr[p].sum &= nu;
            tr[p].lazy &= nu;
            tr[p].num &= nu;
            tr[p].is |= (mod ^ nu);
        }
        return;
    }
    push_down(p);
    int mid = l + r >> 1;
    if (ql <= mid)
        modify_and(p << 1, l, mid, ql, qr, nu);
    if (qr > mid)
        modify_and(p << 1 | 1, mid + 1, r, ql, qr, nu);
    push_up(p);
}

node query_bit(int p, int l, int r, int ql, int qr)
{
    if (l >= ql && r <= qr)
    {
        return tr[p];
    }
    push_down(p);
    int mid = l + r >> 1;
    node ans = {0, 0, 0, 0, mod};
    if (ql <= mid)
        merge(ans, query_bit(p << 1, l, mid, ql, qr));
    if (qr > mid)
        merge(ans, query_bit(p << 1 | 1, mid + 1, r, ql, qr));
    push_up(p);
    return ans;
}
int query_pos(int p, int l, int r, int ql, int qr, int nu)
{ // 已经被提取的最高位
    if (l == r)
    {
        if (!(tr[p].is & nu) && !(tr[p].sum & nu))
            return l;
        else
            return 0;
    }
    push_down(p);
    int mid = l + r >> 1;
    int ans = 0;
    if (l >= ql && r <= qr)
    {
        if (!(tr[p << 1].is & nu) && !(tr[p << 1].sum & nu))
        {
            ans |= query_pos(p << 1, l, mid, ql, qr, nu);
        }
        if (!(tr[p << 1 | 1].is & nu) && !(tr[p << 1 | 1].sum & nu))
        {
            ans |= query_pos(p << 1 | 1, mid + 1, r, ql, qr, nu);
        }
    }
    else
    {
        if (ql <= mid)
            ans |= query_pos(p << 1, l, mid, ql, qr, nu);
        if (qr > mid)
            ans |= query_pos(p << 1 | 1, mid + 1, r, ql, qr, nu);
    }
    push_up(p);
    return ans;
}
int query_val(int p, int l, int r, int ql, int qr)
{
    if (l >= ql && r <= qr)
    {
        return tr[p].sum;
    }
    push_down(p);
    int mid = l + r >> 1;
    int ans = mod;
    if (ql <= mid)
        ans &= query_val(p << 1, l, mid, ql, qr);
    if (qr > mid)
        ans &= query_val(p << 1 | 1, mid + 1, r, ql, qr);
    push_up(p);
    return ans;
}
void solve()
{
    int n, q;
    cin >> n >> q;
    for (int i = 1; i <= n; i++)
        cin >> val[i];
    build(1, 1, n);
    while (q--)
    {
        int op;
        cin >> op;
        if (op == 1)
        {
            int l, r, x;
            cin >> l >> r >> x;
            modify_and(1, 1, n, l, r, x);
        }
        else if (op == 2)
        {
            int s, x;
            cin >> s >> x;
            modify(1, 1, n, s, x);
        }
        else
        {
            int l, r;
            cin >> l >> r;
            if (l == r)
            {
                cout << 0 << endl;
                continue;
            }
            node nu = query_bit(1, 1, n, l, r);
            // cout << nu.sum << endl;
            // cout << nu.num << endl;
            // cout << nu.is << endl;
            int res = ((nu.is | nu.sum) ^ mod) & mod;
            // cout << res << endl;
            int ws = -1;
            for (int i = 62; i >= 0; i--)
            {
                if (res & (1ll << i))
                {
                    ws = i;
                    break;
                }
            }
            // cout << ws << endl;

            if (ws == -1)
            {
                cout << nu.sum << endl;
                continue;
            }
            int pos = query_pos(1, 1, n, l, r, (1ll << ws));
            // cout << pos << endl;
            int ans = mod;
            if (pos != l)
            {
                ans &= query_val(1, 1, n, l, pos - 1);
            }
            if (pos != r)
            {
                ans &= query_val(1, 1, n, pos + 1, r);
            }
            cout << ans << endl;
        }
    }
    // cout << -1 << endl;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(0);
    // cout << -1 << endl;
    int T = 1;
    // cout << (!(0)) << endl;
    // cin >> T;
    while (T--)
        solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 5716kb

input:

5 9
7 7 7 6 7
3 1 5
2 1 3
3 1 5
3 1 3
1 1 2 3
3 1 3
2 2 8
3 1 3
3 1 2

output:

7
6
7
3
3
8

result:

ok 6 lines

Test #2:

score: 0
Accepted
time: 0ms
memory: 5704kb

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: 0ms
memory: 5792kb

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

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: 85ms
memory: 20016kb

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: 1190ms
memory: 94608kb

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: 1190ms
memory: 94568kb

input:

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

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
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
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 749822 lines

Test #8:

score: 0
Accepted
time: 1189ms
memory: 94536kb

input:

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

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
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
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 749812 lines

Test #9:

score: 0
Accepted
time: 1186ms
memory: 94588kb

input:

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

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
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
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 748638 lines

Test #10:

score: 0
Accepted
time: 1ms
memory: 5700kb

input:

2 2
3937866409909043622 2873041425983999763
2 2 3645842096674595914
2 1 5018240021376355677

output:


result:

ok 0 lines

Test #11:

score: 0
Accepted
time: 1198ms
memory: 94592kb

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: 1206ms
memory: 96640kb

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: 1216ms
memory: 96636kb

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: 1163ms
memory: 94656kb

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: 1193ms
memory: 94664kb

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: 1195ms
memory: 94660kb

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: 1208ms
memory: 96580kb

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: 1088ms
memory: 96708kb

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: 1178ms
memory: 96700kb

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: 623ms
memory: 96560kb

input:

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

output:

0

result:

ok single line: '0'

Test #21:

score: 0
Accepted
time: 1111ms
memory: 94492kb

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: 1188ms
memory: 94580kb

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: 1088ms
memory: 96664kb

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: 1187ms
memory: 94584kb

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: 633ms
memory: 96636kb

input:

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

output:

0

result:

ok single line: '0'

Test #26:

score: -100
Time Limit Exceeded

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: