oj.uz

Submission #958880

# Submission time Handle Problem Language Result Execution time Memory
958880 2024-04-07T02:18:01 Z gaga999 Fish 2 (JOI22_fish2) C++17
100 / 100
 1405 ms 81336 KB 
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define size(x) (int)x.size()
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef __int128_t lll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}
const llt MX = 1ll << 60;
const int N = 1e5 + 5;

struct P
{
    llt sum;
    int ans;
    vector<llt> lsm, rsm, lnd, rnd;
    vector<int> lnb, rnb;
    inline void ini(int v)
    {
        sum = v, ans = 1;
        lsm = rsm = vector<llt>(1, 0);
        lnd = rnd = vector<llt>(1, v);
        lnb = rnb = vector<int>(1, 0);
    }
} tr[N << 1];

P operator+(P &l, P &r)
{
    P p;
    int slr = size(l.rnd), srl = size(r.lnd);
    p.sum = l.sum + r.sum, p.ans = 0;
    p.lsm = l.lsm, p.rsm = r.rsm;
    p.lnd = l.lnd, p.rnd = r.rnd;
    p.lnb = l.lnb, p.rnb = r.rnb;
    for (int i = 0; i < srl; i++)
        if (r.lnd[i] > l.sum)
            p.lnd.pb(r.lnd[i] - l.sum), p.lsm.pb(r.lsm[i] + l.sum);
    p.lnb.resize(size(p.lnd), 0);
    if (size(p.lnd) > size(l.lnd))
        p.lnb[size(l.lnd)] = l.ans;
    else
        p.ans += l.ans;
    for (int i = 0; i < slr; i++)
        if (l.rnd[i] > r.sum)
            p.rnd.pb(l.rnd[i] - r.sum), p.rsm.pb(l.rsm[i] + r.sum);
    p.rnb.resize(size(p.rnd), 0);
    if (size(p.rnd) > size(r.rnd))
        p.rnb[size(r.rnd)] = r.ans;
    else
        p.ans += r.ans;
    l.rnb.pb(0), l.rnd.pb(MX), l.rsm.pb(l.sum);
    r.lnb.pb(0), r.lnd.pb(MX), r.lsm.pb(r.sum);
    auto move = [&](int p1, int p2, int num) -> void
    {
        // db(p1, p2, num);
        bool ok = 1;
        while (ok)
        {
            ok = 0;
            while (l.rnd[p1] <= r.lsm[p2])
                p1++, ok = 1;
            while (r.lnd[p2] <= l.rsm[p1])
                p2++, ok = 1;
        }
        if (p1 == slr && p2 == srl)
            p.ans += num;
        else if (p1 == slr)
        {
            int i = 0;
            while (p.lsm[i] < l.sum + r.lsm[p2])
                i++;
            assert(p.lsm[i] == l.sum + r.lsm[p2]);
            p.lnb[i] += num;
        }
        else if (p2 == srl)
        {
            int i = 0;
            while (p.rsm[i] < r.sum + l.rsm[p1])
                i++;
            assert(p.rsm[i] == r.sum + l.rsm[p1]);
            p.rnb[i] += num;
        }
    };
    for (int i = 0; i < slr; i++)
        if (l.rnb[i])
            move(i, 0, l.rnb[i]);
    for (int i = 0; i < srl; i++)
        if (r.lnb[i])
            move(0, i, r.lnb[i]);
    l.rnb.pop_back(), l.rnd.pop_back(), l.rsm.pop_back();
    r.lnb.pop_back(), r.lnd.pop_back(), r.lsm.pop_back();
    return p;
}

signed main()
{
    int n, q, x, a, b;
    rd(n);
    auto pul = [&](int i) -> void
    {
        tr[i] = tr[ls(i)] + tr[rs(i)];
    };
    auto cg = [&](int p, int v) -> void
    {
        p += n - 1, tr[p].ini(v);
        for (p >>= 1; p; p >>= 1)
            pul(p);
    };
    auto qy = [&](int l, int r) -> int
    {
        l += n - 1, r += n - 1;
        if (l == r)
            return tr[l].ans;
        // P pp = tr[l++];
        // for (; l <= r; l++)
        //     pp = pp + tr[l];
        // return pp.ans;
        P p1 = tr[l++], p2 = tr[r--];
        for (; l <= r; l >>= 1, r >>= 1)
        {
            if (l & 1)
                p1 = p1 + tr[l++];
            if (~r & 1)
                p2 = tr[r--] + p2;
        }
        return (p1 + p2).ans;
    };
    // for (int i = 1; i < n; i++)
    // {
    //     tr[i] = tr[i - 1] + tr[i], db(tr[i].ans, tr[i].sum);
    //     for (int p : tr[i].rnb)
    //         cerr << p << ' ';
    //     cerr << '\n';
    //     for (int p : tr[i].rsm)
    //         cerr << p << ' ';
    //     cerr << '\n';
    // }
    for (int i = 0; i < n; i++)
        rd(x), tr[i + n].ini(x);
    for (int i = n - 1; i > 0; i--)
        pul(i);
    rd(q);
    while (q--)
    {
        rd(x, a, b);
        if (x == 1)
            cg(a, b);
        else
            prt(qy(a, b)), putchar('\n');
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31580 KB Output is correct
2 Correct 8 ms 31580 KB Output is correct
3 Correct 7 ms 31576 KB Output is correct
4 Correct 8 ms 31580 KB Output is correct
5 Correct 9 ms 31888 KB Output is correct
6 Correct 10 ms 31832 KB Output is correct
7 Correct 10 ms 31836 KB Output is correct
8 Correct 12 ms 31836 KB Output is correct
9 Correct 11 ms 31832 KB Output is correct
10 Correct 11 ms 32088 KB Output is correct
11 Correct 11 ms 31832 KB Output is correct
12 Correct 10 ms 31832 KB Output is correct
13 Correct 9 ms 31836 KB Output is correct
14 Correct 10 ms 32008 KB Output is correct
15 Correct 10 ms 31860 KB Output is correct
16 Correct 9 ms 31836 KB Output is correct
17 Correct 9 ms 31832 KB Output is correct
18 Correct 9 ms 31836 KB Output is correct
19 Correct 9 ms 31884 KB Output is correct
20 Correct 9 ms 31836 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 31580 KB Output is correct
2 Correct 129 ms 78160 KB Output is correct
3 Correct 122 ms 76084 KB Output is correct
4 Correct 134 ms 77904 KB Output is correct
5 Correct 142 ms 76116 KB Output is correct
6 Correct 112 ms 71248 KB Output is correct
7 Correct 108 ms 71224 KB Output is correct
8 Correct 110 ms 71248 KB Output is correct
9 Correct 112 ms 71248 KB Output is correct
10 Correct 122 ms 78676 KB Output is correct
11 Correct 111 ms 74624 KB Output is correct
12 Correct 122 ms 71000 KB Output is correct
13 Correct 102 ms 71000 KB Output is correct
14 Correct 120 ms 71888 KB Output is correct
15 Correct 117 ms 72056 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31580 KB Output is correct
2 Correct 8 ms 31580 KB Output is correct
3 Correct 7 ms 31576 KB Output is correct
4 Correct 8 ms 31580 KB Output is correct
5 Correct 9 ms 31888 KB Output is correct
6 Correct 10 ms 31832 KB Output is correct
7 Correct 10 ms 31836 KB Output is correct
8 Correct 12 ms 31836 KB Output is correct
9 Correct 11 ms 31832 KB Output is correct
10 Correct 11 ms 32088 KB Output is correct
11 Correct 11 ms 31832 KB Output is correct
12 Correct 10 ms 31832 KB Output is correct
13 Correct 9 ms 31836 KB Output is correct
14 Correct 10 ms 32008 KB Output is correct
15 Correct 10 ms 31860 KB Output is correct
16 Correct 9 ms 31836 KB Output is correct
17 Correct 9 ms 31832 KB Output is correct
18 Correct 9 ms 31836 KB Output is correct
19 Correct 9 ms 31884 KB Output is correct
20 Correct 9 ms 31836 KB Output is correct
21 Correct 8 ms 31580 KB Output is correct
22 Correct 129 ms 78160 KB Output is correct
23 Correct 122 ms 76084 KB Output is correct
24 Correct 134 ms 77904 KB Output is correct
25 Correct 142 ms 76116 KB Output is correct
26 Correct 112 ms 71248 KB Output is correct
27 Correct 108 ms 71224 KB Output is correct
28 Correct 110 ms 71248 KB Output is correct
29 Correct 112 ms 71248 KB Output is correct
30 Correct 122 ms 78676 KB Output is correct
31 Correct 111 ms 74624 KB Output is correct
32 Correct 122 ms 71000 KB Output is correct
33 Correct 102 ms 71000 KB Output is correct
34 Correct 120 ms 71888 KB Output is correct
35 Correct 117 ms 72056 KB Output is correct
36 Correct 130 ms 78352 KB Output is correct
37 Correct 122 ms 76368 KB Output is correct
38 Correct 126 ms 76312 KB Output is correct
39 Correct 165 ms 78828 KB Output is correct
40 Correct 164 ms 76476 KB Output is correct
41 Correct 117 ms 72060 KB Output is correct
42 Correct 116 ms 72264 KB Output is correct
43 Correct 135 ms 71584 KB Output is correct
44 Correct 138 ms 71596 KB Output is correct
45 Correct 174 ms 79184 KB Output is correct
46 Correct 137 ms 79128 KB Output is correct
47 Correct 125 ms 74464 KB Output is correct
48 Correct 130 ms 71484 KB Output is correct
49 Correct 124 ms 71356 KB Output is correct
50 Correct 137 ms 72492 KB Output is correct
51 Correct 124 ms 72680 KB Output is correct
52 Correct 119 ms 72496 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 31580 KB Output is correct
2 Correct 129 ms 78160 KB Output is correct
3 Correct 122 ms 76084 KB Output is correct
4 Correct 134 ms 77904 KB Output is correct
5 Correct 142 ms 76116 KB Output is correct
6 Correct 112 ms 71248 KB Output is correct
7 Correct 108 ms 71224 KB Output is correct
8 Correct 110 ms 71248 KB Output is correct
9 Correct 112 ms 71248 KB Output is correct
10 Correct 122 ms 78676 KB Output is correct
11 Correct 111 ms 74624 KB Output is correct
12 Correct 122 ms 71000 KB Output is correct
13 Correct 102 ms 71000 KB Output is correct
14 Correct 120 ms 71888 KB Output is correct
15 Correct 117 ms 72056 KB Output is correct
16 Correct 7 ms 31580 KB Output is correct
17 Correct 1109 ms 78108 KB Output is correct
18 Correct 1089 ms 80908 KB Output is correct
19 Correct 1088 ms 78120 KB Output is correct
20 Correct 1109 ms 78164 KB Output is correct
21 Correct 1068 ms 78540 KB Output is correct
22 Correct 1146 ms 80236 KB Output is correct
23 Correct 1078 ms 78056 KB Output is correct
24 Correct 1250 ms 78196 KB Output is correct
25 Correct 1058 ms 78256 KB Output is correct
26 Correct 1184 ms 78116 KB Output is correct
27 Correct 824 ms 74152 KB Output is correct
28 Correct 803 ms 74380 KB Output is correct
29 Correct 828 ms 73944 KB Output is correct
30 Correct 1018 ms 73012 KB Output is correct
31 Correct 943 ms 73020 KB Output is correct
32 Correct 1290 ms 76272 KB Output is correct
33 Correct 1294 ms 81336 KB Output is correct
34 Correct 1300 ms 76332 KB Output is correct
35 Correct 1237 ms 75800 KB Output is correct
36 Correct 1249 ms 81324 KB Output is correct
37 Correct 733 ms 72792 KB Output is correct
38 Correct 688 ms 72960 KB Output is correct
39 Correct 892 ms 74420 KB Output is correct
40 Correct 762 ms 74440 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 31580 KB Output is correct
2 Correct 129 ms 78160 KB Output is correct
3 Correct 122 ms 76084 KB Output is correct
4 Correct 134 ms 77904 KB Output is correct
5 Correct 142 ms 76116 KB Output is correct
6 Correct 112 ms 71248 KB Output is correct
7 Correct 108 ms 71224 KB Output is correct
8 Correct 110 ms 71248 KB Output is correct
9 Correct 112 ms 71248 KB Output is correct
10 Correct 122 ms 78676 KB Output is correct
11 Correct 111 ms 74624 KB Output is correct
12 Correct 122 ms 71000 KB Output is correct
13 Correct 102 ms 71000 KB Output is correct
14 Correct 120 ms 71888 KB Output is correct
15 Correct 117 ms 72056 KB Output is correct
16 Correct 6 ms 31580 KB Output is correct
17 Correct 1205 ms 79324 KB Output is correct
18 Correct 1194 ms 78348 KB Output is correct
19 Correct 1054 ms 77760 KB Output is correct
20 Correct 1123 ms 78412 KB Output is correct
21 Correct 1160 ms 80036 KB Output is correct
22 Correct 1188 ms 78584 KB Output is correct
23 Correct 1024 ms 77652 KB Output is correct
24 Correct 1209 ms 78436 KB Output is correct
25 Correct 1035 ms 77700 KB Output is correct
26 Correct 972 ms 73968 KB Output is correct
27 Correct 1018 ms 73924 KB Output is correct
28 Correct 1081 ms 74840 KB Output is correct
29 Correct 1002 ms 74128 KB Output is correct
30 Correct 1045 ms 73832 KB Output is correct
31 Correct 1134 ms 74836 KB Output is correct
32 Correct 1214 ms 76788 KB Output is correct
33 Correct 1085 ms 76424 KB Output is correct
34 Correct 1249 ms 80988 KB Output is correct
35 Correct 1152 ms 80660 KB Output is correct
36 Correct 1231 ms 76624 KB Output is correct
37 Correct 1153 ms 75104 KB Output is correct
38 Correct 955 ms 74804 KB Output is correct
39 Correct 1010 ms 74532 KB Output is correct
40 Correct 833 ms 74552 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 31580 KB Output is correct
2 Correct 8 ms 31580 KB Output is correct
3 Correct 7 ms 31576 KB Output is correct
4 Correct 8 ms 31580 KB Output is correct
5 Correct 9 ms 31888 KB Output is correct
6 Correct 10 ms 31832 KB Output is correct
7 Correct 10 ms 31836 KB Output is correct
8 Correct 12 ms 31836 KB Output is correct
9 Correct 11 ms 31832 KB Output is correct
10 Correct 11 ms 32088 KB Output is correct
11 Correct 11 ms 31832 KB Output is correct
12 Correct 10 ms 31832 KB Output is correct
13 Correct 9 ms 31836 KB Output is correct
14 Correct 10 ms 32008 KB Output is correct
15 Correct 10 ms 31860 KB Output is correct
16 Correct 9 ms 31836 KB Output is correct
17 Correct 9 ms 31832 KB Output is correct
18 Correct 9 ms 31836 KB Output is correct
19 Correct 9 ms 31884 KB Output is correct
20 Correct 9 ms 31836 KB Output is correct
21 Correct 8 ms 31580 KB Output is correct
22 Correct 129 ms 78160 KB Output is correct
23 Correct 122 ms 76084 KB Output is correct
24 Correct 134 ms 77904 KB Output is correct
25 Correct 142 ms 76116 KB Output is correct
26 Correct 112 ms 71248 KB Output is correct
27 Correct 108 ms 71224 KB Output is correct
28 Correct 110 ms 71248 KB Output is correct
29 Correct 112 ms 71248 KB Output is correct
30 Correct 122 ms 78676 KB Output is correct
31 Correct 111 ms 74624 KB Output is correct
32 Correct 122 ms 71000 KB Output is correct
33 Correct 102 ms 71000 KB Output is correct
34 Correct 120 ms 71888 KB Output is correct
35 Correct 117 ms 72056 KB Output is correct
36 Correct 130 ms 78352 KB Output is correct
37 Correct 122 ms 76368 KB Output is correct
38 Correct 126 ms 76312 KB Output is correct
39 Correct 165 ms 78828 KB Output is correct
40 Correct 164 ms 76476 KB Output is correct
41 Correct 117 ms 72060 KB Output is correct
42 Correct 116 ms 72264 KB Output is correct
43 Correct 135 ms 71584 KB Output is correct
44 Correct 138 ms 71596 KB Output is correct
45 Correct 174 ms 79184 KB Output is correct
46 Correct 137 ms 79128 KB Output is correct
47 Correct 125 ms 74464 KB Output is correct
48 Correct 130 ms 71484 KB Output is correct
49 Correct 124 ms 71356 KB Output is correct
50 Correct 137 ms 72492 KB Output is correct
51 Correct 124 ms 72680 KB Output is correct
52 Correct 119 ms 72496 KB Output is correct
53 Correct 7 ms 31580 KB Output is correct
54 Correct 1109 ms 78108 KB Output is correct
55 Correct 1089 ms 80908 KB Output is correct
56 Correct 1088 ms 78120 KB Output is correct
57 Correct 1109 ms 78164 KB Output is correct
58 Correct 1068 ms 78540 KB Output is correct
59 Correct 1146 ms 80236 KB Output is correct
60 Correct 1078 ms 78056 KB Output is correct
61 Correct 1250 ms 78196 KB Output is correct
62 Correct 1058 ms 78256 KB Output is correct
63 Correct 1184 ms 78116 KB Output is correct
64 Correct 824 ms 74152 KB Output is correct
65 Correct 803 ms 74380 KB Output is correct
66 Correct 828 ms 73944 KB Output is correct
67 Correct 1018 ms 73012 KB Output is correct
68 Correct 943 ms 73020 KB Output is correct
69 Correct 1290 ms 76272 KB Output is correct
70 Correct 1294 ms 81336 KB Output is correct
71 Correct 1300 ms 76332 KB Output is correct
72 Correct 1237 ms 75800 KB Output is correct
73 Correct 1249 ms 81324 KB Output is correct
74 Correct 733 ms 72792 KB Output is correct
75 Correct 688 ms 72960 KB Output is correct
76 Correct 892 ms 74420 KB Output is correct
77 Correct 762 ms 74440 KB Output is correct
78 Correct 6 ms 31580 KB Output is correct
79 Correct 1205 ms 79324 KB Output is correct
80 Correct 1194 ms 78348 KB Output is correct
81 Correct 1054 ms 77760 KB Output is correct
82 Correct 1123 ms 78412 KB Output is correct
83 Correct 1160 ms 80036 KB Output is correct
84 Correct 1188 ms 78584 KB Output is correct
85 Correct 1024 ms 77652 KB Output is correct
86 Correct 1209 ms 78436 KB Output is correct
87 Correct 1035 ms 77700 KB Output is correct
88 Correct 972 ms 73968 KB Output is correct
89 Correct 1018 ms 73924 KB Output is correct
90 Correct 1081 ms 74840 KB Output is correct
91 Correct 1002 ms 74128 KB Output is correct
92 Correct 1045 ms 73832 KB Output is correct
93 Correct 1134 ms 74836 KB Output is correct
94 Correct 1214 ms 76788 KB Output is correct
95 Correct 1085 ms 76424 KB Output is correct
96 Correct 1249 ms 80988 KB Output is correct
97 Correct 1152 ms 80660 KB Output is correct
98 Correct 1231 ms 76624 KB Output is correct
99 Correct 1153 ms 75104 KB Output is correct
100 Correct 955 ms 74804 KB Output is correct
101 Correct 1010 ms 74532 KB Output is correct
102 Correct 833 ms 74552 KB Output is correct
103 Correct 1094 ms 77760 KB Output is correct
104 Correct 1242 ms 80676 KB Output is correct
105 Correct 1159 ms 78340 KB Output is correct
106 Correct 1123 ms 78612 KB Output is correct
107 Correct 1052 ms 77912 KB Output is correct
108 Correct 1255 ms 80256 KB Output is correct
109 Correct 1162 ms 77824 KB Output is correct
110 Correct 1109 ms 78448 KB Output is correct
111 Correct 1143 ms 78460 KB Output is correct
112 Correct 1083 ms 78536 KB Output is correct
113 Correct 1081 ms 74192 KB Output is correct
114 Correct 890 ms 74436 KB Output is correct
115 Correct 1229 ms 75112 KB Output is correct
116 Correct 1183 ms 75256 KB Output is correct
117 Correct 968 ms 74216 KB Output is correct
118 Correct 1278 ms 74608 KB Output is correct
119 Correct 1215 ms 74188 KB Output is correct
120 Correct 1304 ms 75068 KB Output is correct
121 Correct 1183 ms 74896 KB Output is correct
122 Correct 1405 ms 76804 KB Output is correct
123 Correct 1092 ms 76548 KB Output is correct
124 Correct 1129 ms 76040 KB Output is correct
125 Correct 1156 ms 75580 KB Output is correct
126 Correct 1194 ms 75996 KB Output is correct
127 Correct 1175 ms 75580 KB Output is correct
128 Correct 908 ms 74272 KB Output is correct
129 Correct 1135 ms 74312 KB Output is correct
130 Correct 934 ms 74628 KB Output is correct