| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 548787 | ala2 | Street Lamps (APIO19_street_lamps) | C++14 | 0 ms | 0 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 int long long
#define pb push_back
using namespace std;
//int a[1001000];
string s;
int n,T;
vector<pair<int,int>>anss;
vector<int>v[100100];
vector<int>von[100100];
vector<int>vtype[101000];
int bit(int i)
{
return s[i]=='1'&&s[i+1]=='1';
}
char f(char x)
{
if(x=='1')
{
return '0';
}
else return '1';
}
signed main()
{
cin>>n>>T;
cin>>s;
// A 1 B 2
s+='1';
for(int i=0;i<n;i++)
{
v[i].pb(0);
vtype[i].pb(1);
if(s[i]=='1'&&s[i+1]=='1')
{
von[i].pb(1);
}
else von[i].pb(0);
}
for(int q=1;q<=T;q++)
{
string c;
cin>>c;
if(c[0]=='q')
c='B';
else c='A';
if(c=="A")
{
int i;
cin>>i;
i--;
int old=bit(i);
s[i]=f(s[i]);
int nw=bit(i);
v[i].pb(q);
vtype[i].pb(1);
/* if(nw>old)
{
von[i].pb(1);
}
else if(old>nw) von[i].pb(0);
else
{
int x=von[i].size();
von[i].pb(von[i][x-1]);
}
*/
von[i]=nw;
continue;
}
int a,b;
cin>>a>>b;
a--;
b--;
int i=a;
v[i].pb(q);
int x=von[i].size();
von[i].pb(von[i][x-1]);
vtype[i].pb(2);
}
for(int i=0;i<=n;i++)
{
int g=0;
for(int j=1;j<v[i].size();j++)
{ // cout<<" "<<i<<endl;
if(von[i][j-1]==1&&von[i][j])
g+=v[i][j]-v[i][j-1];
if(vtype[i][j]==2)
{
int x=g;
anss.pb({v[i][j],x});
}
}
}
sort(anss.begin(),anss.end());
for(auto i:anss)
{
cout<<i.second<<endl;
}
}
// 2 6 11 q 1 2 t 1 q 1 2 q 1 2 t 1 q 1 2