oj.uz

Submission #977854

# Submission time Handle Problem Language Result Execution time Memory
977854 2024-05-08T11:54:52 Z De3b0o Street Lamps (APIO19_street_lamps) C++14
20 / 100
 269 ms 1540 KB 
#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];
ll ans[109][109];

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
            s[i+1]=1;
    }
    while(q--)
    {
        for(int i = 1 ; n>=i ; i++)
        {
            for(int j = i ; n>=j ; j++)
            {
                if(s[j]==0)
                    break;
                ans[i][j+1]++;
            }
        }
        string t;
        cin >> t;
        if(t[0]=='q')
        {
            ll a , b;
            cin >> a >> b;
            cout << ans[a][b] << "\n";
        }
        else
        {
            ll x;
            cin >> x;
            s[x]=1-s[x];
        }
    }
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 133 ms 1420 KB Output is correct
2 Incorrect 269 ms 1428 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 760 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 1540 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 133 ms 1420 KB Output is correct
9 Incorrect 269 ms 1428 KB Output isn't correct
10 Halted 0 ms 0 KB -