oj.uz

Submission #977543

# Submission time Handle Problem Language Result Execution time Memory
977543 2024-05-08T06:36:09 Z gaga999 Street Lamps (APIO19_street_lamps) C++17
20 / 100
 1581 ms 262776 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 << 5];

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 0 ms 348 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 348 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 261 ms 3412 KB Output is correct
2 Correct 382 ms 7220 KB Output is correct
3 Correct 707 ms 9680 KB Output is correct
4 Runtime error 1581 ms 251236 KB Execution killed with signal 11
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2652 KB Output is correct
2 Correct 3 ms 2652 KB Output is correct
3 Correct 3 ms 2652 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Runtime error 1491 ms 262776 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 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 251 ms 23632 KB Output is correct
6 Correct 1115 ms 112760 KB Output is correct
7 Runtime error 1511 ms 248752 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 348 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 261 ms 3412 KB Output is correct
9 Correct 382 ms 7220 KB Output is correct
10 Correct 707 ms 9680 KB Output is correct
11 Runtime error 1581 ms 251236 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -