# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
143061 | JovanK26 | Street Lamps (APIO19_street_lamps) | C++14 | 78 ms | 73996 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>
using namespace std;
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,q;
cin >> n >> q;
if(n<=100 && q<=100)
{
string s;
cin >> s;
int a[n][q];
for(int i=0;i<n;i++)
{
a[i][0]=s[i]-'0';
}
string qry;
int l,r;
int t;
for(int i=1;i<=q;i++)
{
cin >> qry;
if(qry=="toggle")
{
cin >> t;
for(int j=0;j<n;j++)
{
a[j][i]=a[j][i-1];
}
a[t-1][i]^=1;
}
else
{
cin >> l >> r;
long long rez=0;
for(int time=0;time<i;time++)
{
bool check=0;
for(int j=l-1;j<r-1;j++)
{
if(!a[j][time])
{
check=1;
break;
}
}
if(!check)rez++;
}
for(int j=0;j<n;j++)
{
a[j][i]=a[j][i-1];
}
cout << rez <<'\n';
}
}
}
else
{
bitset<300001> bs1[n];
bitset<300001> bs2[q];
cin >> bs2[0];
string qry;
int l,r;
int p;
for(int i=0;i<q;i++)
{
cin >> qry;
if(qry=="toggle")
{
cin >> p;
bitset<300001> tmp;
tmp[p]=1;
bs2[i+1]=bs2[i]^tmp;
}
else
{
cin >> l >> r;
int rez=0;
for(int j=0;j<=i;j++)
{
rez+=bs2[i][l-1];
}
bitset<300001> tmp;
bs2[i+1]=bs2[i]^tmp;
cout << rez <<'\n';
}
}
}
return 0;
}
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... |