| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1361666 | MunkhturErdenebat | Street Lamps (APIO19_street_lamps) | C++20 | 138 ms | 1368 KiB |
#include<bits/stdc++.h>
#include<string.h>
#include <algorithm>
#include <iterator>
#include <set>
#include <stdlib.h>
#define ll long long
#define fr first
#define sc second
#define pb push_back
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define endl "\n"
using namespace std;
ll a,b,c,d,e,f,m,i,j,n,h,g,mid,l,r,ka,dp[200005],q[200005];
map<ll,ll> mee,see;
map<ll,ll> mii,maa;
vector<ll> vas,ves;
string x,y,z,te,to;
pair<ll,ll> wefe,t[205005],k[200105];
stack<ll> munkh;
multiset<ll> mul;
int main(){
cin>>a>>b;
cin>>x;
for(i=0 ; i<a; i++){
if(x[i]=='0'){
k[i].fr=0;
k[i].sc=-2;
}
else{
k[i].fr=0;
k[i].sc=-1;
}
}
for(i=0 ; i<b ; i++){
cin>>y;
if(y[0]=='q'){
cin>>l>>r;
if(k[l-1].sc==-2){
cout<<k[l-1].fr<<endl;
}
else{
cout<<i-k[l-1].sc+k[l-1].fr<<endl;
}
}
else{
cin>>l;
if(k[l-1].sc==-2){
k[l-1].sc=i;
}
else{
k[l-1].fr+=i-k[l-1].sc;
k[l-1].fr=-1;
}
}
}
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
