oj.uz

Submission #958879

# Submission time Handle Problem Language Result Execution time Memory
958879 2024-04-07T02:16:14 Z gaga999 Fish 2 (JOI22_fish2) C++17
13 / 100
 4000 ms 50828 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;
}

P qy(int l, int r)
{
    if (l == r)
        return tr[l];
    P res = tr[l++];
    for (; l <= r; l++)
        res = res + tr[l];
    return res;
    int m = (l + r) >> 1;
    return qy(l, m) + qy(m + 1, r);
}

signed main()
{
    int n, q, x, a, b;
    rd(n);
    for (int i = 1; i <= n; i++)
        rd(x), tr[i].ini(x);
    // for (int i = 2; i <= n; i++)
    // {
    //     tr[i] = tr[i - 1] + tr[i];
    //     for (int p : tr[i].rsm)
    //         cerr << p << ' ';
    //     cerr << '\n';
    //     for (int p : tr[i].rnb)
    //         cerr << p << ' ';
    //     cerr << '\n';
    //     db(tr[i].ans, tr[i].sum);
    // }
    rd(q);
    while (q--)
    {
        rd(x, a, b);
        if (x == 1)
            tr[a].ini(b);
        else
            prt(qy(a, b).ans), 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 31756 KB Output is correct
4 Correct 8 ms 31580 KB Output is correct
5 Correct 19 ms 31836 KB Output is correct
6 Correct 49 ms 31848 KB Output is correct
7 Correct 19 ms 31876 KB Output is correct
8 Correct 44 ms 31836 KB Output is correct
9 Correct 71 ms 31848 KB Output is correct
10 Correct 30 ms 31836 KB Output is correct
11 Correct 61 ms 31836 KB Output is correct
12 Correct 18 ms 31836 KB Output is correct
13 Correct 60 ms 31836 KB Output is correct
14 Correct 23 ms 31836 KB Output is correct
15 Correct 42 ms 31836 KB Output is correct
16 Correct 91 ms 31836 KB Output is correct
17 Correct 26 ms 31832 KB Output is correct
18 Correct 63 ms 31836 KB Output is correct
19 Correct 29 ms 31832 KB Output is correct
20 Correct 134 ms 31832 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 31580 KB Output is correct
2 Correct 96 ms 50596 KB Output is correct
3 Correct 107 ms 50540 KB Output is correct
4 Correct 99 ms 50524 KB Output is correct
5 Correct 111 ms 50524 KB Output is correct
6 Correct 95 ms 50580 KB Output is correct
7 Correct 137 ms 50580 KB Output is correct
8 Correct 94 ms 50524 KB Output is correct
9 Correct 119 ms 50772 KB Output is correct
10 Correct 121 ms 50516 KB Output is correct
11 Correct 128 ms 50588 KB Output is correct
12 Correct 104 ms 50512 KB Output is correct
13 Correct 111 ms 50828 KB Output is correct
14 Correct 118 ms 50520 KB Output is correct
15 Correct 98 ms 50524 KB Output is correct

Subtask #3
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 31756 KB Output is correct
4 Correct 8 ms 31580 KB Output is correct
5 Correct 19 ms 31836 KB Output is correct
6 Correct 49 ms 31848 KB Output is correct
7 Correct 19 ms 31876 KB Output is correct
8 Correct 44 ms 31836 KB Output is correct
9 Correct 71 ms 31848 KB Output is correct
10 Correct 30 ms 31836 KB Output is correct
11 Correct 61 ms 31836 KB Output is correct
12 Correct 18 ms 31836 KB Output is correct
13 Correct 60 ms 31836 KB Output is correct
14 Correct 23 ms 31836 KB Output is correct
15 Correct 42 ms 31836 KB Output is correct
16 Correct 91 ms 31836 KB Output is correct
17 Correct 26 ms 31832 KB Output is correct
18 Correct 63 ms 31836 KB Output is correct
19 Correct 29 ms 31832 KB Output is correct
20 Correct 134 ms 31832 KB Output is correct
21 Correct 7 ms 31580 KB Output is correct
22 Correct 96 ms 50596 KB Output is correct
23 Correct 107 ms 50540 KB Output is correct
24 Correct 99 ms 50524 KB Output is correct
25 Correct 111 ms 50524 KB Output is correct
26 Correct 95 ms 50580 KB Output is correct
27 Correct 137 ms 50580 KB Output is correct
28 Correct 94 ms 50524 KB Output is correct
29 Correct 119 ms 50772 KB Output is correct
30 Correct 121 ms 50516 KB Output is correct
31 Correct 128 ms 50588 KB Output is correct
32 Correct 104 ms 50512 KB Output is correct
33 Correct 111 ms 50828 KB Output is correct
34 Correct 118 ms 50520 KB Output is correct
35 Correct 98 ms 50524 KB Output is correct
36 Execution timed out 4045 ms 50600 KB Time limit exceeded
37 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 31580 KB Output is correct
2 Correct 96 ms 50596 KB Output is correct
3 Correct 107 ms 50540 KB Output is correct
4 Correct 99 ms 50524 KB Output is correct
5 Correct 111 ms 50524 KB Output is correct
6 Correct 95 ms 50580 KB Output is correct
7 Correct 137 ms 50580 KB Output is correct
8 Correct 94 ms 50524 KB Output is correct
9 Correct 119 ms 50772 KB Output is correct
10 Correct 121 ms 50516 KB Output is correct
11 Correct 128 ms 50588 KB Output is correct
12 Correct 104 ms 50512 KB Output is correct
13 Correct 111 ms 50828 KB Output is correct
14 Correct 118 ms 50520 KB Output is correct
15 Correct 98 ms 50524 KB Output is correct
16 Correct 7 ms 31832 KB Output is correct
17 Execution timed out 4040 ms 50596 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 31580 KB Output is correct
2 Correct 96 ms 50596 KB Output is correct
3 Correct 107 ms 50540 KB Output is correct
4 Correct 99 ms 50524 KB Output is correct
5 Correct 111 ms 50524 KB Output is correct
6 Correct 95 ms 50580 KB Output is correct
7 Correct 137 ms 50580 KB Output is correct
8 Correct 94 ms 50524 KB Output is correct
9 Correct 119 ms 50772 KB Output is correct
10 Correct 121 ms 50516 KB Output is correct
11 Correct 128 ms 50588 KB Output is correct
12 Correct 104 ms 50512 KB Output is correct
13 Correct 111 ms 50828 KB Output is correct
14 Correct 118 ms 50520 KB Output is correct
15 Correct 98 ms 50524 KB Output is correct
16 Correct 9 ms 31580 KB Output is correct
17 Execution timed out 4069 ms 50588 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
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 31756 KB Output is correct
4 Correct 8 ms 31580 KB Output is correct
5 Correct 19 ms 31836 KB Output is correct
6 Correct 49 ms 31848 KB Output is correct
7 Correct 19 ms 31876 KB Output is correct
8 Correct 44 ms 31836 KB Output is correct
9 Correct 71 ms 31848 KB Output is correct
10 Correct 30 ms 31836 KB Output is correct
11 Correct 61 ms 31836 KB Output is correct
12 Correct 18 ms 31836 KB Output is correct
13 Correct 60 ms 31836 KB Output is correct
14 Correct 23 ms 31836 KB Output is correct
15 Correct 42 ms 31836 KB Output is correct
16 Correct 91 ms 31836 KB Output is correct
17 Correct 26 ms 31832 KB Output is correct
18 Correct 63 ms 31836 KB Output is correct
19 Correct 29 ms 31832 KB Output is correct
20 Correct 134 ms 31832 KB Output is correct
21 Correct 7 ms 31580 KB Output is correct
22 Correct 96 ms 50596 KB Output is correct
23 Correct 107 ms 50540 KB Output is correct
24 Correct 99 ms 50524 KB Output is correct
25 Correct 111 ms 50524 KB Output is correct
26 Correct 95 ms 50580 KB Output is correct
27 Correct 137 ms 50580 KB Output is correct
28 Correct 94 ms 50524 KB Output is correct
29 Correct 119 ms 50772 KB Output is correct
30 Correct 121 ms 50516 KB Output is correct
31 Correct 128 ms 50588 KB Output is correct
32 Correct 104 ms 50512 KB Output is correct
33 Correct 111 ms 50828 KB Output is correct
34 Correct 118 ms 50520 KB Output is correct
35 Correct 98 ms 50524 KB Output is correct
36 Execution timed out 4045 ms 50600 KB Time limit exceeded
37 Halted 0 ms 0 KB -