oj.uz

Submission #977649

# Submission time Handle Problem Language Result Execution time Memory
977649 2024-05-08T08:40:19 Z gaga999 Street Lamps (APIO19_street_lamps) C++17
100 / 100
 506 ms 48148 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);
}
typedef array<int, 4> ar4;
const int N = 3e5 + 15;
char s[N];
set<int> st;
ar4 ar[N << 2];
int ln, an[N], bs[N], n, q;

inline void cg(int p, int v)
{
    for (; p < N; p += lowbit(p))
        bs[p] += v;
}

inline int qy(int p)
{
    int v = 0;
    for (; p; p -= lowbit(p))
        v += bs[p];
    return v;
}

void slv(int l, int r)
{
    if (l >= r - 1)
        return;
    int m = (l + r + 1) >> 1, p = l;
    slv(l, m), slv(m, r);
    for (int i = m; i < r; i++)
    {
        if (ar[i][2])
            continue;
        while (p < m && ar[p][1] > ar[i][1])
            cg(ar[p][3], ar[p][2]), p++;
        an[ar[i][3]] += qy(ar[i][3]);
    }
    for (int i = l; i < p; i++)
        cg(ar[i][3], -ar[i][2]);
    inplace_merge(ar + l, ar + m, ar + r, [&](const ar4 &a, const ar4 &b)
                  { return a[1] > b[1]; });
}

signed main()
{
    int 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 + 1);
    init(an, -1);
    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);
                ar[ln++] = {l, r, i, i};
                ar[ln++] = {l, x, -i, i};
                ar[ln++] = {x, r, -i, i};
            }
            else
            {
                auto it = st.lower_bound(x);
                int l = *prev(it), r = *next(it);
                ar[ln++] = {l, r, -i, i};
                ar[ln++] = {l, x, i, i};
                ar[ln++] = {x, r, i, i};
                st.erase(it);
            }
            s[x] ^= 1;
        }
        else
        {
            scanf("%d%d", &x, &y), y--;
            an[i] = *st.lower_bound(x) <= y ? 0 : i;
            ar[ln++] = {x, y, 0, i};
        }
    }
    sort(ar, ar + ln), slv(0, ln);
    for (int i = 1; i <= q; i++)
        if (~an[i])
            printf("%d\n", an[i]);
}

Compilation message

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

Subtask #1
20.0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 243 ms 23592 KB Output is correct
2 Correct 239 ms 22964 KB Output is correct
3 Correct 258 ms 24392 KB Output is correct
4 Correct 334 ms 33616 KB Output is correct
5 Correct 367 ms 30028 KB Output is correct
6 Correct 363 ms 34500 KB Output is correct
7 Correct 358 ms 31532 KB Output is correct
8 Correct 168 ms 17608 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 410 ms 48148 KB Output is correct
6 Correct 387 ms 40892 KB Output is correct
7 Correct 386 ms 32524 KB Output is correct
8 Correct 302 ms 17936 KB Output is correct
9 Correct 158 ms 13364 KB Output is correct
10 Correct 156 ms 14616 KB Output is correct
11 Correct 168 ms 16272 KB Output is correct
12 Correct 506 ms 32728 KB Output is correct
13 Correct 312 ms 17580 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4444 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 2 ms 4444 KB Output is correct
4 Correct 2 ms 4444 KB Output is correct
5 Correct 413 ms 25168 KB Output is correct
6 Correct 381 ms 30188 KB Output is correct
7 Correct 385 ms 35980 KB Output is correct
8 Correct 357 ms 39416 KB Output is correct
9 Correct 282 ms 27524 KB Output is correct
10 Correct 280 ms 30024 KB Output is correct
11 Correct 294 ms 28176 KB Output is correct
12 Correct 314 ms 30352 KB Output is correct
13 Correct 281 ms 28468 KB Output is correct
14 Correct 276 ms 31324 KB Output is correct
15 Correct 450 ms 32972 KB Output is correct
16 Correct 322 ms 18220 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4544 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 243 ms 23592 KB Output is correct
9 Correct 239 ms 22964 KB Output is correct
10 Correct 258 ms 24392 KB Output is correct
11 Correct 334 ms 33616 KB Output is correct
12 Correct 367 ms 30028 KB Output is correct
13 Correct 363 ms 34500 KB Output is correct
14 Correct 358 ms 31532 KB Output is correct
15 Correct 168 ms 17608 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 2 ms 4444 KB Output is correct
18 Correct 2 ms 4444 KB Output is correct
19 Correct 2 ms 4444 KB Output is correct
20 Correct 410 ms 48148 KB Output is correct
21 Correct 387 ms 40892 KB Output is correct
22 Correct 386 ms 32524 KB Output is correct
23 Correct 302 ms 17936 KB Output is correct
24 Correct 158 ms 13364 KB Output is correct
25 Correct 156 ms 14616 KB Output is correct
26 Correct 168 ms 16272 KB Output is correct
27 Correct 506 ms 32728 KB Output is correct
28 Correct 312 ms 17580 KB Output is correct
29 Correct 2 ms 4444 KB Output is correct
30 Correct 2 ms 4444 KB Output is correct
31 Correct 2 ms 4444 KB Output is correct
32 Correct 2 ms 4444 KB Output is correct
33 Correct 413 ms 25168 KB Output is correct
34 Correct 381 ms 30188 KB Output is correct
35 Correct 385 ms 35980 KB Output is correct
36 Correct 357 ms 39416 KB Output is correct
37 Correct 282 ms 27524 KB Output is correct
38 Correct 280 ms 30024 KB Output is correct
39 Correct 294 ms 28176 KB Output is correct
40 Correct 314 ms 30352 KB Output is correct
41 Correct 281 ms 28468 KB Output is correct
42 Correct 276 ms 31324 KB Output is correct
43 Correct 450 ms 32972 KB Output is correct
44 Correct 322 ms 18220 KB Output is correct
45 Correct 164 ms 18076 KB Output is correct
46 Correct 168 ms 18500 KB Output is correct
47 Correct 221 ms 22040 KB Output is correct
48 Correct 384 ms 33416 KB Output is correct
49 Correct 196 ms 17192 KB Output is correct
50 Correct 182 ms 15376 KB Output is correct
51 Correct 200 ms 16424 KB Output is correct
52 Correct 210 ms 15912 KB Output is correct
53 Correct 215 ms 16972 KB Output is correct
54 Correct 213 ms 15876 KB Output is correct