oj.uz

Submission #903705

# Submission time Handle Problem Language Result Execution time Memory
903705 2024-01-11T10:48:28 Z Tenis0206 Street Lamps (APIO19_street_lamps) C++11
100 / 100
 1647 ms 99012 KB 
#include <bits/stdc++.h>

using namespace std;

const int nmax = 3e5;
const int oo = INT_MAX;

int n,q;

int v[nmax + 5];

int t[nmax + 5];
pair<int,int> qry[nmax + 5];

int rez[nmax + 5];

set<pair<pair<int,int>,int>> s_st;
set<pair<pair<int,int>,int>, greater<pair<pair<int,int>,int>>> s_dr;

vector<pair<pair<int,int>,int>> upd[nmax + 5];

int ai[4 * nmax + 5];
int lazy[4 * nmax + 5];

void propag(int nod)
{
    if(lazy[nod] == 0)
    {
        return;
    }
    ai[nod * 2] = ai[nod * 2 + 1] = lazy[nod];
    lazy[nod * 2] = lazy[nod * 2 + 1] = lazy[nod];
    lazy[nod] = 0;
}

void update(int ua, int ub, int val, int nod, int a, int b)
{
    if(ua <= a && ub>=b)
    {
        ai[nod] = val;
        lazy[nod] = val;
        return;
    }
    propag(nod);
    int mij = (a + b) >> 1;
    if(ua <= mij)
    {
        update(ua,ub,val,nod*2,a,mij);
    }
    if(ub > mij)
    {
        update(ua,ub,val,nod*2+1,mij+1,b);
    }
    ai[nod] = max(ai[nod * 2], ai[nod * 2 + 1]);
}

int query(int qa, int qb, int nod, int a, int b)
{
    if(qa <= a && qb >= b)
    {
        return ai[nod];
    }
    propag(nod);
    int mij = (a + b) >> 1;
    if(qa<=mij && qb>mij)
    {
        return max(query(qa,qb,nod*2,a,mij), query(qa,qb,nod*2+1,mij+1,b));
    }
    if(qa<=mij)
    {
        return query(qa,qb,nod*2,a,mij);
    }
    return query(qa,qb,nod*2+1,mij+1,b);
}

vector<int> aib[nmax + 5], aib_lst[nmax + 5];

int ub(int x)
{
    return (x & (-x));
}

void simulate_update(int poz_st, int poz_dr)
{
    for(int i=poz_st;i<=n;i+=ub(i))
    {
        aib_lst[i].push_back(poz_dr);
    }
}

void update_aib(int poz_st, int poz_dr, int val)
{
    for(int i=poz_st; i<=n; i+=ub(i))
    {
        int st = 1;
        int dr = aib_lst[i].size() - 1;
        int poz = 0;
        while(st<=dr)
        {
            int mij = (st + dr) >> 1;
            if(aib_lst[i][mij] <= poz_dr)
            {
                poz = mij;
                st = mij + 1;
            }
            else
            {
                dr = mij - 1;
            }
        }
        for(int j=poz; j<=aib_lst[i].size()-1; j+=ub(j))
        {
            aib[i][j] += val;
        }
    }
}

int query_aib(int poz_st, int poz_dr)
{
    int rez = 0;
    for(int i=poz_st;i>=1;i-=ub(i))
    {
        int st = 1;
        int dr = aib_lst[i].size() - 1;
        int poz = 0;
        while(st<=dr)
        {
            int mij = (st + dr) >> 1;
            if(aib_lst[i][mij] < poz_dr)
            {
                poz = mij;
                st = mij + 1;
            }
            else
            {
                dr = mij - 1;
            }
        }
        for(int j=aib_lst[i].size()-1;j>=1;j-=ub(j))
        {
            rez += aib[i][j];
        }
        for(int j=poz;j>=1;j-=ub(j))
        {
            rez -= aib[i][j];
        }
    }
    return rez;
}

void Remove_segment(int st, int dr, int i)
{
    auto it_st = s_st.lower_bound({{st,dr}, 0});
    auto it_dr = s_dr.lower_bound({{st,dr}, oo});
    int nr = it_st -> second;
    upd[i].push_back({{st,dr}, i - nr});
    s_st.erase(it_st);
    s_dr.erase(it_dr);
}

void Add(int poz, int i)
{
    update(poz,poz,i,1,1,n);
    int st = poz, dr = poz;
    auto it_dr = s_dr.lower_bound({{poz, oo}, 0});
    if(it_dr != s_dr.end() && it_dr->first.second == poz - 1)
    {
        st = it_dr->first.first;
        update(it_dr->first.first, it_dr->first.second, i, 1,1,n);
        Remove_segment(it_dr->first.first, it_dr->first.second, i);
    }
    auto it_st = s_st.lower_bound({{poz, 0}, 0});
    if(it_st != s_st.end() && it_st->first.first == poz + 1)
    {
        dr = it_st->first.second;
        update(it_st->first.first, it_st->first.second, i, 1,1,n);
        Remove_segment(it_st->first.first, it_st->first.second, i);
    }
    s_st.insert({{st,dr},i});
    s_dr.insert({{st,dr},i});
}

void Rem(int poz, int i)
{
    update(poz,poz,oo,1,1,n);
    auto it = s_dr.lower_bound({{poz, oo}, 0});
    int st = it->first.first;
    int dr = it->first.second;
    if(st < poz)
    {
        update(st,poz - 1,i,1,1,n);
    }
    if(dr > poz)
    {
        update(poz+1, dr,i,1,1,n);
    }
    Remove_segment(st, dr, i);
    if(st != poz)
    {
        s_st.insert({{st, poz - 1}, i});
        s_dr.insert({{st, poz - 1}, i});
    }
    if(dr != poz)
    {
        s_st.insert({{poz + 1, dr}, i});
        s_dr.insert({{poz + 1, dr}, i});
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    #ifdef home
    freopen("nr.in","r",stdin);
    freopen("nr.out","w",stdout);
    #endif // home
    cin>>n>>q;
    for(int i=1; i<=n; i++)
    {
        char ch;
        cin>>ch;
        v[i] = ch - '0';
    }
    int st = 1, dr = 0;
    for(int i=1; i<=n; i++)
    {
        if(v[i] == 1)
        {
            dr = i;
        }
        else
        {
            if(st <= dr)
            {
                s_st.insert({{st,dr}, 0});
                s_dr.insert({{st,dr}, 0});
            }
            st = i + 1;
        }
    }
    if(st <= dr)
    {
        s_st.insert({{st,dr}, 0});
        s_dr.insert({{st,dr}, 0});
    }
    for(int i=1; i<=n; i++)
    {
        if(v[i] == 1)
        {
            update(i,i, 0, 1,1,n);
        }
        else
        {
            update(i,i, oo, 1,1,n);
        }
    }
    for(int i=1; i<=q; i++)
    {
        string tip;
        cin>>tip;
        if(tip == "query")
        {
            t[i] = 0;
            cin>>qry[i].first>>qry[i].second;
            --qry[i].second;
            int a = qry[i].first, b = qry[i].second;
            int last = query(a,b,1,1,n);
            if(last != oo)
            {
                rez[i] += i - last;
            }
        }
        else
        {
            t[i] = 1;
            cin>>qry[i].first;
            int poz = qry[i].first;
            if(v[poz] == 0)
            {
                v[poz] = 1;
                Add(poz,i);
            }
            else
            {
                v[poz] = 0;
                Rem(poz,i);
            }
        }
    }
    for(int i=1; i<=q; i++)
    {
        for(auto it : upd[i])
        {
            int st = it.first.first;
            int dr = it.first.second;
            int val = it.second;
            simulate_update(st,dr);
        }
    }
    for(int i=1; i<=n; i++)
    {
        aib_lst[i].push_back(0);
        aib[i].resize(aib_lst[i].size());
        sort(aib_lst[i].begin(),aib_lst[i].end());
    }
    for(int i=1; i<=q; i++)
    {
        if(t[i] == 0)
        {
            int st = qry[i].first, dr = qry[i].second;
            rez[i] += query_aib(st, dr);
            cout<<rez[i]<<'\n';
        }
        else
        {
            for(auto it : upd[i])
            {
                int st = it.first.first;
                int dr = it.first.second;
                int val = it.second;
                update_aib(st,dr,val);
            }
        }
    }
    return 0;
}

Compilation message

street_lamps.cpp: In function 'void update_aib(int, int, int)':
street_lamps.cpp:111:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  111 |         for(int j=poz; j<=aib_lst[i].size()-1; j+=ub(j))
      |                        ~^~~~~~~~~~~~~~~~~~~~~
street_lamps.cpp: In function 'int main()':
street_lamps.cpp:297:17: warning: unused variable 'val' [-Wunused-variable]
  297 |             int val = it.second;
      |                 ^~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29276 KB Output is correct
2 Correct 6 ms 29344 KB Output is correct
3 Correct 6 ms 29272 KB Output is correct
4 Correct 6 ms 29368 KB Output is correct
5 Correct 6 ms 29364 KB Output is correct
6 Correct 7 ms 29280 KB Output is correct
7 Correct 6 ms 29276 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 237 ms 39240 KB Output is correct
2 Correct 309 ms 43932 KB Output is correct
3 Correct 455 ms 47256 KB Output is correct
4 Correct 1085 ms 85608 KB Output is correct
5 Correct 1164 ms 79632 KB Output is correct
6 Correct 1058 ms 88844 KB Output is correct
7 Correct 208 ms 61524 KB Output is correct
8 Correct 204 ms 62856 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 29276 KB Output is correct
2 Correct 7 ms 29476 KB Output is correct
3 Correct 7 ms 29276 KB Output is correct
4 Correct 6 ms 29432 KB Output is correct
5 Correct 1572 ms 84308 KB Output is correct
6 Correct 1474 ms 80272 KB Output is correct
7 Correct 1121 ms 74120 KB Output is correct
8 Correct 276 ms 56812 KB Output is correct
9 Correct 98 ms 30144 KB Output is correct
10 Correct 96 ms 30032 KB Output is correct
11 Correct 85 ms 30388 KB Output is correct
12 Correct 278 ms 55588 KB Output is correct
13 Correct 275 ms 57232 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 29272 KB Output is correct
2 Correct 8 ms 29276 KB Output is correct
3 Correct 7 ms 29276 KB Output is correct
4 Correct 8 ms 29276 KB Output is correct
5 Correct 351 ms 71736 KB Output is correct
6 Correct 705 ms 79540 KB Output is correct
7 Correct 1085 ms 88708 KB Output is correct
8 Correct 1647 ms 99012 KB Output is correct
9 Correct 386 ms 48956 KB Output is correct
10 Correct 331 ms 49980 KB Output is correct
11 Correct 374 ms 49140 KB Output is correct
12 Correct 341 ms 50364 KB Output is correct
13 Correct 388 ms 49120 KB Output is correct
14 Correct 337 ms 50168 KB Output is correct
15 Correct 250 ms 61544 KB Output is correct
16 Correct 274 ms 62968 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29276 KB Output is correct
2 Correct 6 ms 29344 KB Output is correct
3 Correct 6 ms 29272 KB Output is correct
4 Correct 6 ms 29368 KB Output is correct
5 Correct 6 ms 29364 KB Output is correct
6 Correct 7 ms 29280 KB Output is correct
7 Correct 6 ms 29276 KB Output is correct
8 Correct 237 ms 39240 KB Output is correct
9 Correct 309 ms 43932 KB Output is correct
10 Correct 455 ms 47256 KB Output is correct
11 Correct 1085 ms 85608 KB Output is correct
12 Correct 1164 ms 79632 KB Output is correct
13 Correct 1058 ms 88844 KB Output is correct
14 Correct 208 ms 61524 KB Output is correct
15 Correct 204 ms 62856 KB Output is correct
16 Correct 7 ms 29276 KB Output is correct
17 Correct 7 ms 29476 KB Output is correct
18 Correct 7 ms 29276 KB Output is correct
19 Correct 6 ms 29432 KB Output is correct
20 Correct 1572 ms 84308 KB Output is correct
21 Correct 1474 ms 80272 KB Output is correct
22 Correct 1121 ms 74120 KB Output is correct
23 Correct 276 ms 56812 KB Output is correct
24 Correct 98 ms 30144 KB Output is correct
25 Correct 96 ms 30032 KB Output is correct
26 Correct 85 ms 30388 KB Output is correct
27 Correct 278 ms 55588 KB Output is correct
28 Correct 275 ms 57232 KB Output is correct
29 Correct 7 ms 29272 KB Output is correct
30 Correct 8 ms 29276 KB Output is correct
31 Correct 7 ms 29276 KB Output is correct
32 Correct 8 ms 29276 KB Output is correct
33 Correct 351 ms 71736 KB Output is correct
34 Correct 705 ms 79540 KB Output is correct
35 Correct 1085 ms 88708 KB Output is correct
36 Correct 1647 ms 99012 KB Output is correct
37 Correct 386 ms 48956 KB Output is correct
38 Correct 331 ms 49980 KB Output is correct
39 Correct 374 ms 49140 KB Output is correct
40 Correct 341 ms 50364 KB Output is correct
41 Correct 388 ms 49120 KB Output is correct
42 Correct 337 ms 50168 KB Output is correct
43 Correct 250 ms 61544 KB Output is correct
44 Correct 274 ms 62968 KB Output is correct
45 Correct 104 ms 36392 KB Output is correct
46 Correct 188 ms 37504 KB Output is correct
47 Correct 435 ms 53572 KB Output is correct
48 Correct 1038 ms 85264 KB Output is correct
49 Correct 94 ms 33428 KB Output is correct
50 Correct 90 ms 33616 KB Output is correct
51 Correct 138 ms 33568 KB Output is correct
52 Correct 97 ms 34084 KB Output is correct
53 Correct 134 ms 34076 KB Output is correct
54 Correct 99 ms 34132 KB Output is correct