oj.uz

Submission #261509

# Submission time Handle Problem Language Result Execution time Memory
261509 2020-08-11T19:55:43 Z Kastanda Street Lamps (APIO19_street_lamps) C++11
100 / 100
 3419 ms 233164 KB 
// M
#include<bits/stdc++.h>
#define lc (id << 1)
#define rc (lc ^ 1)
#define md ((l + r) >> 1)
using namespace std;
const int N = 300005, MXS = N * 4, MXF = N * 19;
int n, q, ts, TP[N], qa[N], qb[N], St[MXS], F[MXF];
char A[N];
set < int > ST;
map < pair < int , int > , int > MP;
vector < int > V[N], VS[MXS], fcl[MXS], fcr[MXS];
inline void AddFen(int i, int val)
{
        for (i ++; i < MXF; i += i & - i)
                F[i] += val;
}
inline int GetFen(int i)
{
        int rt = 0;
        for (i ++; i; i -= i & - i)
                rt += F[i];
        return rt;
}
inline void AddFen(int l, int r, int val)
{
        AddFen(l, val);
        AddFen(r, -val);
}
void Build(int id = 1, int l = 1, int r = n + 2)
{
        if (r - l < 2)
        {
                VS[id] = V[l];
                St[id] = ts;
                ts += (int)VS[id].size();
                return ;
        }
        Build(lc, l, md);
        Build(rc, md, r);
        merge(VS[lc].begin(), VS[lc].end(), VS[rc].begin(), VS[rc].end(), back_inserter(VS[id]));
        VS[id].resize(unique(VS[id].begin(), VS[id].end()) - VS[id].begin());
        int le = 0, ri = 0;
        for (int a : VS[id])
        {
                while (le < (int)VS[lc].size() && VS[lc][le] < a)
                        le ++;
                while (ri < (int)VS[rc].size() && VS[rc][ri] < a)
                        ri ++;
                fcl[id].push_back(le);
                fcr[id].push_back(ri);
        }
        fcl[id].push_back((int)VS[lc].size());
        fcr[id].push_back((int)VS[rc].size());
        St[id] = ts;
        ts += (int)VS[id].size();
}
void AddSeg(int le, int ri, int val, int lq, int rq, int id = 1, int l = 1, int r = n + 2)
{
        if (ri <= l || r <= le || rq <= lq)
                return ;
        if (le <= l && r <= ri)
                return void(AddFen(St[id] + lq, St[id] + rq, val));
        AddSeg(le, ri, val, fcl[id][lq], fcl[id][rq], lc, l, md);
        AddSeg(le, ri, val, fcr[id][lq], fcr[id][rq], rc, md, r);
}
int GetSeg(int i, int b, int id = 1, int l = 1, int r = n + 2)
{
        int rt = GetFen(St[id] + b);
        if (r - l < 2)
                return rt;
        if (i < md)
                return GetSeg(i, fcl[id][b], lc, l, md) + rt;
        return GetSeg(i, fcr[id][b], rc, md, r) + rt;
}
inline void Add(int l, int r, int val)
{
        r ++; // Changing segments to points
        if (!val) return ;
        int lq = lower_bound(VS[1].begin(), VS[1].end(), l) - VS[1].begin();
        int rq = lower_bound(VS[1].begin(), VS[1].end(), r) - VS[1].begin();
        AddSeg(l, r, val, lq, rq);
}
inline int Get(int a, int b)
{
        b = lower_bound(VS[1].begin(), VS[1].end(), b) - VS[1].begin();
        return GetSeg(a, b);
}
inline void TurnOff(int i, int tnw)
{
        assert(A[i]); A[i] = 0;
        auto it = ST.lower_bound(i);
        int ri = * it; it --;
        int le = * it;
        le ++; ri --;
        ST.insert(i);

        Add(le, ri + 1, tnw - MP[{le, ri}]);
        MP[{le, ri}] = -1;

        if (le < i)
                MP[{le, i - 1}] = tnw;
        if (i < ri)
                MP[{i + 1, ri}] = tnw;
}
inline void TurnOn(int i, int tnw)
{
        assert(!A[i]); A[i] = 1;
        ST.erase(i);
        auto it = ST.lower_bound(i);
        int ri = * it; it --;
        int le = * it;
        le ++; ri --;

        if (le < i)
                Add(le, i, tnw - MP[{le, i - 1}]);
        if (i < ri)
                Add(i + 1, ri + 1, tnw - MP[{i + 1, ri}]);

        MP[{le, ri}] = tnw;
}
int main()
{
        scanf("%d%d%s", &n, &q, &A[1]);
        for (int i = 1; i <= q; i ++)
        {
                char ss[10];
                scanf("%s%d", ss, &qa[i]);
                if (ss[0] == 'q')
                        scanf("%d", &qb[i]), TP[i] = 1, V[qa[i]].push_back(qb[i]);
                else
                        TP[i] = 2;
        }
        for (int i = 1; i <= n + 1; i ++)
                sort(V[i].begin(), V[i].end());
        Build();
        for (int i = 1; i <= n; i ++)
                A[i] -= '0';
        ST.insert(0);
        ST.insert(n + 1);
        for (int i = 1; i <= n; i ++)
                if (!A[i])
                        ST.insert(i);
        for (int i = 1; i <= n; i ++)
                if (A[i] && !A[i - 1])
                {
                        int r = i;
                        while (r <= n && A[r])
                                r ++;
                        MP[{i, r - 1}] = 0;
                }
        for (int i = 1; i <= q; i ++)
        {
                if (TP[i] == 2)
                {
                        if (A[qa[i]])
                                TurnOff(qa[i], i);
                        else
                                TurnOn(qa[i], i);
                        continue;
                }
                int a = qa[i], b = qb[i];
                if (A[a])
                        TurnOff(a, i), TurnOn(a, i);
                printf("%d\n", Get(a, b));
        }
        return 0;
}

Compilation message

street_lamps.cpp: In function 'int main()':
street_lamps.cpp:124:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%s", &n, &q, &A[1]);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
street_lamps.cpp:128:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                 scanf("%s%d", ss, &qa[i]);
                 ~~~~~^~~~~~~~~~~~~~~~~~~~
street_lamps.cpp:130:55: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
                         scanf("%d", &qb[i]), TP[i] = 1, V[qa[i]].push_back(qb[i]);
                         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 92024 KB Output is correct
2 Correct 63 ms 92024 KB Output is correct
3 Correct 63 ms 92024 KB Output is correct
4 Correct 63 ms 91896 KB Output is correct
5 Correct 63 ms 92024 KB Output is correct
6 Correct 63 ms 91896 KB Output is correct
7 Correct 65 ms 92024 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 421 ms 101480 KB Output is correct
2 Correct 505 ms 101624 KB Output is correct
3 Correct 778 ms 105464 KB Output is correct
4 Correct 2598 ms 188524 KB Output is correct
5 Correct 3419 ms 204504 KB Output is correct
6 Correct 2487 ms 183112 KB Output is correct
7 Correct 2036 ms 199148 KB Output is correct
8 Correct 2848 ms 210268 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 92152 KB Output is correct
2 Correct 67 ms 92280 KB Output is correct
3 Correct 67 ms 92280 KB Output is correct
4 Correct 74 ms 92356 KB Output is correct
5 Correct 1144 ms 143648 KB Output is correct
6 Correct 1944 ms 178412 KB Output is correct
7 Correct 2748 ms 208872 KB Output is correct
8 Correct 2881 ms 233000 KB Output is correct
9 Correct 367 ms 101880 KB Output is correct
10 Correct 375 ms 102520 KB Output is correct
11 Correct 421 ms 102520 KB Output is correct
12 Correct 2158 ms 224424 KB Output is correct
13 Correct 2909 ms 233024 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 92408 KB Output is correct
2 Correct 67 ms 92348 KB Output is correct
3 Correct 71 ms 92280 KB Output is correct
4 Correct 67 ms 92152 KB Output is correct
5 Correct 2936 ms 227080 KB Output is correct
6 Correct 2427 ms 206208 KB Output is correct
7 Correct 1937 ms 182720 KB Output is correct
8 Correct 1111 ms 147320 KB Output is correct
9 Correct 504 ms 100672 KB Output is correct
10 Correct 382 ms 96888 KB Output is correct
11 Correct 500 ms 100600 KB Output is correct
12 Correct 372 ms 96888 KB Output is correct
13 Correct 462 ms 100580 KB Output is correct
14 Correct 381 ms 97040 KB Output is correct
15 Correct 2167 ms 224196 KB Output is correct
16 Correct 2970 ms 233164 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 65 ms 92024 KB Output is correct
2 Correct 63 ms 92024 KB Output is correct
3 Correct 63 ms 92024 KB Output is correct
4 Correct 63 ms 91896 KB Output is correct
5 Correct 63 ms 92024 KB Output is correct
6 Correct 63 ms 91896 KB Output is correct
7 Correct 65 ms 92024 KB Output is correct
8 Correct 421 ms 101480 KB Output is correct
9 Correct 505 ms 101624 KB Output is correct
10 Correct 778 ms 105464 KB Output is correct
11 Correct 2598 ms 188524 KB Output is correct
12 Correct 3419 ms 204504 KB Output is correct
13 Correct 2487 ms 183112 KB Output is correct
14 Correct 2036 ms 199148 KB Output is correct
15 Correct 2848 ms 210268 KB Output is correct
16 Correct 66 ms 92152 KB Output is correct
17 Correct 67 ms 92280 KB Output is correct
18 Correct 67 ms 92280 KB Output is correct
19 Correct 74 ms 92356 KB Output is correct
20 Correct 1144 ms 143648 KB Output is correct
21 Correct 1944 ms 178412 KB Output is correct
22 Correct 2748 ms 208872 KB Output is correct
23 Correct 2881 ms 233000 KB Output is correct
24 Correct 367 ms 101880 KB Output is correct
25 Correct 375 ms 102520 KB Output is correct
26 Correct 421 ms 102520 KB Output is correct
27 Correct 2158 ms 224424 KB Output is correct
28 Correct 2909 ms 233024 KB Output is correct
29 Correct 68 ms 92408 KB Output is correct
30 Correct 67 ms 92348 KB Output is correct
31 Correct 71 ms 92280 KB Output is correct
32 Correct 67 ms 92152 KB Output is correct
33 Correct 2936 ms 227080 KB Output is correct
34 Correct 2427 ms 206208 KB Output is correct
35 Correct 1937 ms 182720 KB Output is correct
36 Correct 1111 ms 147320 KB Output is correct
37 Correct 504 ms 100672 KB Output is correct
38 Correct 382 ms 96888 KB Output is correct
39 Correct 500 ms 100600 KB Output is correct
40 Correct 372 ms 96888 KB Output is correct
41 Correct 462 ms 100580 KB Output is correct
42 Correct 381 ms 97040 KB Output is correct
43 Correct 2167 ms 224196 KB Output is correct
44 Correct 2970 ms 233164 KB Output is correct
45 Correct 217 ms 98420 KB Output is correct
46 Correct 309 ms 98832 KB Output is correct
47 Correct 1165 ms 142444 KB Output is correct
48 Correct 2151 ms 191492 KB Output is correct
49 Correct 328 ms 103164 KB Output is correct
50 Correct 317 ms 103160 KB Output is correct
51 Correct 369 ms 103416 KB Output is correct
52 Correct 381 ms 106360 KB Output is correct
53 Correct 343 ms 106100 KB Output is correct
54 Correct 417 ms 106404 KB Output is correct