Submission #721715

#TimeUsernameProblemLanguageResultExecution timeMemory
721715victor_gaoStreet Lamps (APIO19_street_lamps)C++17
20 / 100
1 ms596 KiB
//#pragma GCC optimize("Ofast,unroll-loops,O3") //#pragma GCC optimize("avx,avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,fma,tune=native") #include<bits/stdc++.h> //#include<bits/extc++.h> //#pragma pack(1) #define fast ios::sync_with_stdio(0); cin.tie(0); #define int long long #define pii pair<int,int> #define x first #define y second using namespace std; //using namespace __gnu_pbds; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); //typedef tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> order_multiset; //typedef tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> order_set; int s[105][105],n,q; bool arr[105]; signed main(){ fast cin>>n>>q; for (int i=1;i<=n;i++){ char c; cin>>c; arr[i]=c-'0'; s[1][i]=arr[i]+s[1][i-1]; } for (int t=2;t<=q+1;t++){ string str; cin>>str; if (str=="toggle"){ int p; cin>>p; arr[p]^=1; } else { int ans=0,l,r; cin>>l>>r; for (int i=1;i<t;i++){ if (s[i][r-1]-s[i][l-1]==r-l) ans++; } cout<<ans<<'\n'; } for (int i=1;i<=n;i++) s[t][i]=arr[i]+s[t][i-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...