이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define ep insert
#define endl '\n'
#define elif else if
#define pow pwr
#define sqrt sqrtt
//#define int long long
#define ll long long
typedef unsigned long long ull;
using namespace std;
const int N=105+5;
int n,q;
bool a[N][N];
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
cin>>n>>q;
for (int i=1;i<=n;i++){
char c;cin>>c;
if (c=='1') a[0][i]=1;
}
for (int i=1;i<=q;i++){
for (int j=1;j<=n;j++) a[i][j]=a[i-1][j];
string s;
cin>>s;
if (s=="toggle"){
int x;cin>>x;
a[i][x]=!a[i][x];
continue;
}
int l,r,ans=0;cin>>l>>r;
for (int j=0;j<i;j++){
bool ok=true;
for (int k=l;k<r;k++) ok&=a[j][k];
ans+=ok;
}
cout<<ans<<endl;
}
return 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... |