| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1361655 | MunkhturErdenebat | Street Lamps (APIO19_street_lamps) | C++20 | 1460 ms | 589824 KiB |
#include<bits/stdc++.h>
#include<string.h>
#include <algorithm>
#include <iterator>
#include <set>
#include <stdlib.h>
#define ll long long
#define fr first
#define sc second
#define pb push_back
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define endl "\n"
using namespace std;
ll a,b,c,d,e,f,m,i,j,n,h,g,mid,l,r,ka,dp[200005],q[200005],k[200105];
map<ll,ll> mee,see;
map<ll,ll> mii,maa;
vector<ll> vas,ves;
string x[20005],y[200005],z,te,to;
pair<ll,ll> wefe,t[205005];
stack<ll> munkh;
multiset<ll> mul;
int main(){
cin>>a>>b;
cin>>x[0];
for(i=1 ; i<=b ; i++){
x[i]=x[i-1];
cin>>y[i];
if(y[i][0]=='q'){
cin>>q[i]>>k[i];
r=0;
for(j=0 ; j<i ; j++){
l=0;
for(f=q[i]-1 ; f<k[i]-1 ; f++){
if(x[j][f]=='1'){
l++;
}
}
if(l==k[i]-q[i]){
r++;
}
}
cout<<r<<endl;
}
else{
cin>>q[i];
x[i][q[i]-1]='1'+'0'-x[i-1][q[i]-1];
}
}
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
