Submission #964105

#	Time	Username	Problem	Language	Result	Execution time	Memory
964105		gaga999	Reconstruction Project (JOI22_reconstruction)	C++17	0 / 100	5 ms	6240 KiB

reconstruction

// #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 int N = 1e5 + 5;
int pw2[N], iv2[N];
struct dat
{
    int v1, v2, tg, sum;
    inline void c1() { tml(v1, iv2[1]), tml(v2, iv2[1]); }
    inline void add(int v) { tad(tg, v), v2 = ml(ad(v2, mi(pw2[v], 1)), iv2[v]); }
    inline void c2() { tmi(sum, v1), v1 = ml(ad(v1, v2), iv2[1]), tad(sum, v1); }
    inline void c3() { tmi(sum, v1), v1 = ml(iv2[1], ad(v1, 1)), add(1), tad(sum, v1); }
} tr[N << 2];
int ql, qr;

inline void ph(int id)
{
    if (tr[id].tg)
    {
        tr[ls(id)].add(tr[id].tg);
        tr[rs(id)].add(tr[id].tg);
        tr[id].tg = 0;
    }
}

#define pul(x) tr[x].sum = ad(tr[x].v1, ad(tr[ls(x)].sum, tr[rs(x)].sum))
#define L l, m, ls(id)
#define R m + 1, r, rs(id)

void cg(int l, int r, int id)
{
    if (ql <= l && r <= qr)
    {
        tr[id].c3();
        return;
    }
    ph(id);
    tr[id].c1();
    int m = (l + r) >> 1;
    if (ql <= m && qr > m)
        cg(L), cg(R);
    else if (ql <= m)
        cg(L), tr[rs(id)].c2();
    else
        cg(R), tr[ls(id)].c2();
    pul(id);
}

signed main()
{
    pw2[0] = iv2[0] = 1;
    pw2[1] = 2, iv2[1] = 499122177;
    for (int i = 2; i < N; i++)
        pw2[i] = ml(pw2[i - 1], pw2[1]), iv2[i] = ml(iv2[i - 1], iv2[1]);
    int n, q, op, k = 0;
    rd(n, q);
    while (q--)
    {
        rd(op);
        if (op == 1)
            rd(ql, qr), cg(1, n, 1), k++;
        else
            prt(ml(tr[1].sum, pw2[k])), putchar('\n');
    }
}

• Subtask 1: 0 / 3
• Subtask 2: 0 / 4
• Subtask 3: 0 / 7
• Subtask 4: 0 / 28
• Subtask 5: 0 / 35
• Subtask 6: 0 / 23