| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 404953 | A_D | Street Lamps (APIO19_street_lamps) | C++14 | 476 ms | 3636 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 ii pair<int,int>
#define F first
#define S second
#define du long double
using namespace std;
const int N=3e5+100;
int a[N];
int ans[N];
void solve()
{
int n,q;
cin>>n>>q;
string s;
cin>>s;
int cnt=0;
for(auto x:s){
cnt++;
if(x=='1'){
a[cnt]=0;
}
else{
a[cnt]=-1;
}
}
for(int i=1;i<=q;i++){
string s;
cin>>s;
if(s=="query"){
int b;
scanf("%lld",&b);
scanf("%lld",&b);
b--;
int u=ans[b];
if(a[b]!=-1){
u+=i-a[b];
}
printf("%lld\n",u);
}
else{
int b;
scanf("%lld",&b);
if(a[b]==-1){
a[b]=i;
}
else{
ans[i]+=i-a[b];
a[b]=-1;
}
}
}
}
main()
{
int t=1;
//cin>>t;
while(t--)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... | ||||
