oj.uz

Submission #251383

# Submission time Handle Problem Language Result Execution time Memory
251383 2020-07-21T04:54:59 Z jeqcho Street Lamps (APIO19_street_lamps) C++17
20 / 100
 119 ms 4240 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=3e5;
int base[N];
int tbase[N];
bitset<N> state;
int n,q;
string S;

int query(int a,int b, int t)
{
    return base[a] + state[a] * (t - tbase[a]);
}

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

Subtask #1
0 / 20.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 79 ms 1400 KB Output is correct
2 Correct 76 ms 1276 KB Output is correct
3 Correct 92 ms 1300 KB Output is correct
4 Correct 107 ms 3852 KB Output is correct
5 Correct 118 ms 4240 KB Output is correct
6 Correct 105 ms 3852 KB Output is correct
7 Correct 116 ms 1420 KB Output is correct
8 Correct 119 ms 2828 KB Output is correct

Subtask #3
0 / 20.0

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

Subtask #4
0 / 20.0

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

Subtask #5
0 / 20.0

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