oj.uz

Submission #978970

# Submission time Handle Problem Language Result Execution time Memory
978970 2024-05-10T05:09:11 Z De3b0o Street Lamps (APIO19_street_lamps) C++17
0 / 100
 5000 ms 466580 KB 
#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define in insert
#define pb push_back
#define ppb pop_back()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007
#define mid ((l+r)/2)
#define lc (2*n)
#define rc (2*n+1)
 
using namespace std;
 
ll fp(ll x , ll y)
{
    if(y==0)
        return 1;
    ll z = fp(x,y/2);
    if(y&1)
        return z*z%mod*x%mod;
    else
        return z*z%mod;
}
 
int sqrot(ll x)
{
    int l = 0 , r = INT_MAX;
    while(l<=r)
    {
        if(mid*mid>=x)
            r=mid-1;
        else
            l=mid+1;
    }
    return r+1;
}
 
ll cel(ll x , ll y)
{
    return x/y + bool(x%y);
}
 
bool s[300009];
set<pll> seg[2000009];
ll sum[2000009];
 
void se(ll n , ll l , ll r , ll idx , ll val1 , ll val2)
{
    if(l>idx||r<idx)
        return;
    seg[n].in({val1,val2});
    if(l!=r)
    {
        se(lc,l,mid,idx,val1,val2);
        se(rc,mid+1,r,idx,val1,val2);
    }
}
 
ll sg(ll n , ll l , ll r , ll l1 , ll r1 , ll idx)
{
    if(l>r1||r<l1)
        return 1e10;
    if(l>=l1&&r<=r1)
    {
        auto it = seg[n].lower_bound({idx,0});
        ll x = 1e10;
        if(it!=seg[n].end())
            x=it->S;
        return x;
    }
    return min(sg(lc,l,mid,l1,r1,idx),sg(rc,mid+1,r,l1,r1,idx));
}
 
void sume(ll n , ll l , ll r , ll idx , ll val)
{
    if(l>idx||r<idx)
        return;
    if(l==r)
    {
        sum[n]=val;
        return;
    }
    sume(lc,l,mid,idx,val);
    sume(rc,mid+1,r,idx,val);
    sum[n]=sum[lc]+sum[rc];
}
 
ll sumg(ll n , ll l , ll r , ll l1 , ll r1)
{
    if(l>r1||r<l1)
        return 0;
    if(l>=l1&&r<=r1)
        return sum[n];
    return sumg(lc,l,mid,l1,r1)+sumg(rc,mid+1,r,l1,r1);
}
 
int main()
{
    d3
    ll n , q;
    cin >> n >> q;
    string s1;
    cin >> s1;
    for(int i = 0 ; n>i ; i++)
    {
        if(s1[i]=='0')
            s[i+1]=0;
        else
        {
            sume(1,1,n,i+1,1);
            s[i+1]=1;
        }
    }
    for(int i = 1 ; n>=i ; i++)
    {
        if(s[i]==1)
        {
            ll j = i;
            for(;n>=j;j++)
            {
                if(s[j]==0)
                    break;
            }
            se(1,1,n+1,i,j,0);
            i=j;
        }
    }
    for(int h = 1 ; q>=h ; h++)
    {
        string t;
        cin >> t;
        if(t[0]=='q')
        {
            ll a , b;
            cin >> a >> b;
            ll e = sg(1,1,n+1,1,a,b);
            ll ans = h-e;
            if(ans<0)
                ans=0;
            cans
        }
        else
        {
            ll x;
            cin >> x;
            s[x]=1;
            sume(1,1,n,x,1);
            ll l1 = x , r1 = x+1;
            ll l = 1 , r = x-1;
            while(l<=r)
            {
                ll e = sumg(1,1,n,mid,x-1);
                if(e==x-1-mid+1)
                {
                    l1=mid;
                    r=mid-1;
                }
                else
                    l=mid+1;
            }
            l = x+1 , r = n+1;
            while(l<=r)
            {
                ll e = sumg(1,1,n,x+1,mid);
                if(e==mid-(x+1)+1)
                {
                    r1=mid+1;
                    l=mid+1;
                }
                else
                    r=mid-1;
            }
            se(1,1,n+1,l1,r1,h);
        }
    }
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 95324 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 574 ms 174380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 96088 KB Output is correct
2 Correct 25 ms 96092 KB Output is correct
3 Correct 24 ms 96000 KB Output is correct
4 Correct 24 ms 95324 KB Output is correct
5 Execution timed out 5054 ms 466580 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 95580 KB Output is correct
2 Incorrect 23 ms 95836 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 22 ms 95324 KB Output isn't correct
2 Halted 0 ms 0 KB -