Submission #742636

#TimeUsernameProblemLanguageResultExecution timeMemory
742636speedyArdaStreet Lamps (APIO19_street_lamps)C++14
20 / 100
147 ms21460 KiB
#include "bits/stdc++.h" using namespace std; const int MAXN = 3e5+5; vector< pair<string, pair<int, int> > > queries(MAXN); string stats[MAXN]; int main() { int n, q; cin >> n >> q; string in; cin >> in; in = " " + in; stats[0] = in; for(int i = 1; i <= q; i++) { cin >> queries[i].first; if(queries[i].first == "toggle") { cin >> queries[i].second.first; } else { cin >> queries[i].second.first >> queries[i].second.second; } } if(max(n, q) <= 100) // Subtask 1 { for(int i = 1; i <= q; i++) { if(queries[i].first == "toggle") { in[queries[i].second.first] = (in[queries[i].second.first] == '1' ? '0' : '1'); stats[i] = in; } else { stats[i] = in; int pos = 0; for(int ava = 0; ava < i; ava++) { string temp = stats[ava]; int beg = queries[i].second.first; int end = queries[i].second.second; while(beg < end) { if(temp[beg] == '1') beg++; else break; } if(beg == end) pos++; } cout << pos << "\n"; } } } else { } }
#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...