이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define chmax(x, v) x = max(x, v)
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define chmin(x, v) x = min(x, v)
#define sz(x) (int)x.size()
#define int long long
using namespace std;
signed main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int nVals, nReqs; cin >> nVals >> nReqs;
vector<int> vals(nVals);
string chaine; cin >> chaine;
for (int iVal = 0; iVal < nVals; ++iVal)
vals[iVal] = (chaine[iVal] - '0');
vector<vector<int>> etats;
etats.pb(vals);
for (int iReq = 0; iReq < nReqs; ++iReq){
string typeReq; cin >> typeReq;
if (typeReq == "toggle"){
int ind; cin >> ind;
vals[ind - 1] ^= 1;
}
else {
int sum = 0, a, b; cin >> a >> b;
--a; --b;
for (int inst = 0; inst <= iReq; ++inst){
bool ok = true;
for (int ind = a; ind < b; ++ind)
ok &= (etats[inst][ind] == 1);
sum += ok;
}
cout << sum << endl;
}
etats.pb(vals);
}
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... |