oj.uz

Submission #251367

# Submission time Handle Problem Language Result Execution time Memory
251367 2020-07-21T04:20:37 Z jeqcho Street Lamps (APIO19_street_lamps) C++17
20 / 100
 217 ms 4600 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pair<int,int>> vpi;

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

#define pb push_back
#define rsz resize
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
#define f first
#define s second

int const N=101;
int ans[N][N];
int n,q;
string S;

void update()
{
    F0R(i,n+1)
    {
        FOR(j,i+1,n+1)
        {
            if(S[j-1]=='1')
            {
                ++ans[i][j];
            }
            else break;
        }
    }
}

int query(int a,int b, int t)
{
    return ans[a][b];
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>q;
    F0R(i,n+1)fill(ans[i],ans[i]+n+1,0);
    cin>>S;
    string typ;
    int i,a,b;
    int t=1;
    while(q--)
    {
        cin>>typ;
        update();
        if(typ=="toggle")
        {
            cin>>i;
            --i;
            if(S[i]=='1')S[i]='0';
            else S[i]='1';
        }
        else
        {
            cin>>a>>b;
            --a; --b;
            cout<<query(a,b,t)<<'\n';
        }
        ++t;
    }
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 217 ms 4600 KB Output is correct
2 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 217 ms 4600 KB Output is correct
9 Runtime error 1 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Halted 0 ms 0 KB -