Submission #966199

#	Time	Username	Problem	Language	Result	Execution time	Memory
966199		steveonalex	Street Lamps (APIO19_street_lamps)	C++17	20 / 100	1 ms	604 KiB

street_lamps

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
 
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n", ostream& out = cout){
        for(auto i: a) out << i << separator;
        out << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 111;

int n, q;
int a[N][N];

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n, q; cin >> n >> q;
    string s; cin >> s;
    for(int i = 1; i<=n; ++i) a[0][i] = (s[i-1] == '1');
    for(int i = 1; i<=q; ++i){
        for(int j = 1; j<=n; ++j) a[i][j] = a[i-1][j] ^ a[i][j];
        string type; cin >> type;
        if (type == "query"){
            int l, r; cin >> l >> r;
            r--;
            int cnt = 0;
            for(int j = 1; j<=i; ++j){
                int cur = 1;
                for(int k = l; k<=r; ++k){
                    cur = cur & a[j][k];
                    if (cur == 0) break;
                }
                cnt += cur;
            }
            cout << cnt << "\n";
        }
        else{
            int j; cin >> j;
            a[i+1][j] ^= 1;
        }
    }
 
    return 0;
}

• Subtask 1: 20 / 20
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 20