# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
982984 | vjudge1 | Street Lamps (APIO19_street_lamps) | C++17 | 52 ms | 4552 KiB |
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<bits/stdc++.h>
#define sz size()
#define ll long long
using namespace std;
ll cnt[205][205];
void solve()
{
ll n, q, i, j, k;
cin >> n >> q;
string s;
cin >> s;
ll a[n + 1], sum[n + 1], lst[n + 1] = {};
for(i = 1; i <= n; ++i)
a[i] = s[i - 1] - '0',
sum[i] = a[i];
if(n <= 200 && q <= 200)
{
for(i = 1; i <= n; ++i)
for(j = i; j <= n; ++j)
{
if(!a[j]) break;
++cnt[i][j];
}
while(q--)
{
cin >> s;
ll l, r;
if(s == "toggle")
cin >> l,
a[l] ^= 1;
else
cin >> l >> r,
cout << cnt[l][r - 1] << '\n';
for(i = 1; i <= n; ++i)
for(j = i; j <= n; ++j)
{
if(!a[j]) break;
++cnt[i][j];
}
}
}
for(i = 1; i <= q; ++i)
{
cin >> s;
ll l, r;
if(s == "toggle")
{
cin >> l;
sum[l] += (i - lst[l]) * a[l];
a[l] ^= 1;
lst[l] = i;
continue;
}
cin >> l >> r;
cout << sum[l] + (i - lst[l]) * a[l] << '\n';
}
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
solve();
}
Compilation message (stderr)
# | 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... |