oj.uz

Submission #977545

# Submission time Handle Problem Language Result Execution time Memory
977545 2024-05-08T06:36:43 Z gaga999 Street Lamps (APIO19_street_lamps) C++17
100 / 100
 3141 ms 187216 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 pair<llt, int> pli;
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 = 3e5 + 5;
char s[N];
set<int> st;
int rt[N], ct;
struct TR
{
    int sum, ln, rn;
} tr[N << 7];

signed main()
{
    int n, q, x, y;
    char op[10];
    scanf("%d%d%s", &n, &q, s + 1);
    for (int i = 1; i <= n; i++)
        if (!(s[i] -= '0'))
            st.insert(i);
    st.insert(0), st.insert(++n);
    auto cg2 = [&](auto &cg2, int l, int r, int &id, int p, int v) -> void
    {
        if (!id)
            id = ++ct;
        tr[id].sum += v;
        if (l != r)
        {
            int m = (l + r) >> 1;
            if (p <= m)
                cg2(cg2, l, m, tr[id].ln, p, v);
            else
                cg2(cg2, m + 1, r, tr[id].rn, p, v);
        }
    };
    auto cg1 = [&](int p1, int p2, int v) -> void
    {
        for (; p1 <= n; p1 += lowbit(p1))
            cg2(cg2, 1, n, rt[p1], p2, v);
    };
    auto qy2 = [&](auto &qy2, int l, int r, int id, int p) -> int
    {
        if (!id)
            return 0;
        if (r <= p)
            return tr[id].sum;
        int m = (l + r) >> 1, re = qy2(qy2, l, m, tr[id].ln, p);
        if (p > m)
            re += qy2(qy2, m + 1, r, tr[id].rn, p);
        return re;
    };
    auto qy1 = [&](int p1, int p2) -> int
    {
        int re = 0;
        for (; p1; p1 -= lowbit(p1))
            re += qy2(qy2, 1, n, rt[p1], p2);
        return re;
    };
    auto mod = [&](int a, int b, int v) -> void
    {
        a++;
        cg1(a, a, v);
        cg1(b, b, v);
        cg1(a, b, -v);
        cg1(b, a, -v);
    };
    for (int i = 1; i <= q; i++)
    {
        scanf("%s", op);
        if (op[0] == 't')
        {
            scanf("%d", &x);
            if (s[x])
            {
                auto it = st.insert(x).F;
                int l = *prev(it), r = *next(it);
                mod(l, r, i), mod(l, x, -i), mod(x, r, -i);
            }
            else
            {
                auto it = st.lower_bound(x);
                int l = *prev(it), r = *next(it);
                mod(l, r, -i), mod(l, x, i), mod(x, r, i);
                st.erase(it);
            }
            s[x] ^= 1;
        }
        else
        {
            scanf("%d%d", &x, &y), y--;
            int ans = *st.lower_bound(x) <= y ? 0 : i;
            printf("%d\n", ans + qy1(x, y));
        }
    }
}

Compilation message

street_lamps.cpp: In function 'int main()':
street_lamps.cpp:94:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |     scanf("%d%d%s", &n, &q, s + 1);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
street_lamps.cpp:146:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  146 |         scanf("%s", op);
      |         ~~~~~^~~~~~~~~~
street_lamps.cpp:149:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  149 |             scanf("%d", &x);
      |             ~~~~~^~~~~~~~~~
street_lamps.cpp:167:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  167 |             scanf("%d%d", &x, &y), y--;
      |             ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 1360 KB Output is correct
2 Correct 404 ms 3572 KB Output is correct
3 Correct 737 ms 5696 KB Output is correct
4 Correct 1735 ms 130940 KB Output is correct
5 Correct 1597 ms 147248 KB Output is correct
6 Correct 2071 ms 144232 KB Output is correct
7 Correct 299 ms 21260 KB Output is correct
8 Correct 98 ms 8532 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2648 KB Output is correct
2 Correct 3 ms 2652 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 3141 ms 187216 KB Output is correct
6 Correct 2267 ms 178844 KB Output is correct
7 Correct 1429 ms 146772 KB Output is correct
8 Correct 99 ms 8528 KB Output is correct
9 Correct 71 ms 3924 KB Output is correct
10 Correct 84 ms 4224 KB Output is correct
11 Correct 78 ms 4640 KB Output is correct
12 Correct 232 ms 21116 KB Output is correct
13 Correct 96 ms 8532 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 3 ms 2652 KB Output is correct
5 Correct 275 ms 17912 KB Output is correct
6 Correct 1099 ms 107344 KB Output is correct
7 Correct 1883 ms 139760 KB Output is correct
8 Correct 2924 ms 158896 KB Output is correct
9 Correct 497 ms 5968 KB Output is correct
10 Correct 373 ms 3444 KB Output is correct
11 Correct 529 ms 6104 KB Output is correct
12 Correct 391 ms 3312 KB Output is correct
13 Correct 509 ms 6108 KB Output is correct
14 Correct 369 ms 3344 KB Output is correct
15 Correct 265 ms 21328 KB Output is correct
16 Correct 96 ms 8568 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 263 ms 1360 KB Output is correct
9 Correct 404 ms 3572 KB Output is correct
10 Correct 737 ms 5696 KB Output is correct
11 Correct 1735 ms 130940 KB Output is correct
12 Correct 1597 ms 147248 KB Output is correct
13 Correct 2071 ms 144232 KB Output is correct
14 Correct 299 ms 21260 KB Output is correct
15 Correct 98 ms 8532 KB Output is correct
16 Correct 4 ms 2648 KB Output is correct
17 Correct 3 ms 2652 KB Output is correct
18 Correct 2 ms 2652 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 3141 ms 187216 KB Output is correct
21 Correct 2267 ms 178844 KB Output is correct
22 Correct 1429 ms 146772 KB Output is correct
23 Correct 99 ms 8528 KB Output is correct
24 Correct 71 ms 3924 KB Output is correct
25 Correct 84 ms 4224 KB Output is correct
26 Correct 78 ms 4640 KB Output is correct
27 Correct 232 ms 21116 KB Output is correct
28 Correct 96 ms 8532 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 3 ms 2652 KB Output is correct
32 Correct 3 ms 2652 KB Output is correct
33 Correct 275 ms 17912 KB Output is correct
34 Correct 1099 ms 107344 KB Output is correct
35 Correct 1883 ms 139760 KB Output is correct
36 Correct 2924 ms 158896 KB Output is correct
37 Correct 497 ms 5968 KB Output is correct
38 Correct 373 ms 3444 KB Output is correct
39 Correct 529 ms 6104 KB Output is correct
40 Correct 391 ms 3312 KB Output is correct
41 Correct 509 ms 6108 KB Output is correct
42 Correct 369 ms 3344 KB Output is correct
43 Correct 265 ms 21328 KB Output is correct
44 Correct 96 ms 8568 KB Output is correct
45 Correct 84 ms 2668 KB Output is correct
46 Correct 167 ms 2724 KB Output is correct
47 Correct 837 ms 51752 KB Output is correct
48 Correct 1689 ms 135976 KB Output is correct
49 Correct 92 ms 4436 KB Output is correct
50 Correct 85 ms 4448 KB Output is correct
51 Correct 92 ms 4948 KB Output is correct
52 Correct 82 ms 4948 KB Output is correct
53 Correct 82 ms 5016 KB Output is correct
54 Correct 81 ms 4928 KB Output is correct