Submission #977863

#TimeUsernameProblemLanguageResultExecution timeMemory
977863De3b0oStreet Lamps (APIO19_street_lamps)C++14
20 / 100
106 ms9560 KiB
#include<bits/stdc++.h> #define ll long long #define F first #define S second #define in insert #define pb push_back #define ppb pop_back() #define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0); #define cans cout << ans << "\n"; #define yes cout << "Yes" << "\n"; #define no cout << "No" << "\n"; #define pll pair<ll,ll> #define lin cout << "\n"; #define sqr 340 #define mod 1000000007 #define mid ((l+r)/2) #define lc (2*n) #define rc (2*n+1) using namespace std; ll fp(ll x , ll y) { if(y==0) return 1; ll z = fp(x,y/2); if(y&1) return z*z%mod*x%mod; else return z*z%mod; } int sqrot(ll x) { int l = 0 , r = INT_MAX; while(l<=r) { if(mid*mid>=x) r=mid-1; else l=mid+1; } return r+1; } ll cel(ll x , ll y) { return x/y + bool(x%y); } bool s[300009]; ll ans[300009]; ll ti[300009]; int main() { d3 ll n , q; cin >> n >> q; string s1; cin >> s1; for(int i = 0 ; n>i ; i++) { if(s1[i]=='0') s[i+1]=0; else s[i+1]=1; } for(int h = 1 ; q>=h ; h++) { string t; cin >> t; if(t[0]=='q') { ll a , b; cin >> a >> b; ll x = ans[a]; if(s[a]==1) x+=h-ti[a]; cout << x << "\n"; } else { ll x; cin >> x; if(s[x]==1) { ans[x]+=h-ti[x]; s[x]=0; } else { ti[x]=h; s[x]=1; } } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...