This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <time.h>
#include <cstdlib>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <map>
#include <set>
#include <iterator>
#include <deque>
#include <queue>
#include <sstream>
#include <array>
#include <string>
#include <tuple>
#include <chrono>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <list>
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <bitset>
using namespace std;
int tt = 1, n;
string s;
int k[1001][1001];
int main(){
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
cin >> n >> tt;
cin >> s;
// if(n <= 100 && tt <= 100){
while(tt--){
string type;
cin >> type;
// cout << s << "\n";
for(int i = 1; i <= n; i++){
for(int j = 2; j <= n + 1; j++){
if(s[j - 1] == '1') k[i][j]++;
else break;
}
}
if(type[0] == 'q'){
int a, b;
cin >> a >> b;
cout << k[a][b] << "\n";
}
else{
int p;
cin >> p;
if(s[p - 1] == '0') s[p - 1] = '1';
else s[p - 1] = '0';
}
}
// }
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |