Submission #522222

#TimeUsernameProblemLanguageResultExecution timeMemory
522222Aldas25Street Lamps (APIO19_street_lamps)C++14
20 / 100
81 ms1668 KiB
#include <bits/stdc++.h> using namespace std; #define FAST_IO ios_base::sync_with_stdio(0); cin.tie(nullptr) #define FOR(i, a, b) for (int i = (a); i <= (b); i++) #define REP(n) FOR(O, 1, (n)) #define f first #define s second #define pb push_back typedef long long ll; typedef pair<int, int> pii; typedef vector<int> vi; typedef vector<pii> vii; typedef vector<ll> vl; const int MAXN = 500100; int n, q; bool lamp[MAXN]; bool intervals[110][110]; void saveIntervals (int time) { FOR(i, 1, n) intervals[time][i] = lamp[i]; } int query (int a, int b, int time) { int ret = 0; FOR(t, 0, time-1) { bool ok = true; FOR(i, a, b-1) { if (!intervals[t][i]) ok = false; } if (ok) ret++; } return ret; } int main() { FAST_IO; cin >> n >> q; string s; cin >> s; FOR(i, 0, n-1) { lamp[i+1] = (s[i] == '1'); } saveIntervals (0); FOR(i, 1, q) { string t; cin >> t; if (t[0] == 'q') { int a, b; cin >> a >> b; cout << query(a,b, i) << "\n"; } else { int id; cin >> id; lamp[id] = !lamp[id]; } saveIntervals (i); } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...