Submission #1096472

#TimeUsernameProblemLanguageResultExecution timeMemory
1096472AbitoModern Machine (JOI23_ho_t5)C++17
3 / 100
3011 ms532 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #define F first #define S second #define pb push_back #define ppb pop_back #define ep insert #define endl '\n' #define elif else if #define pow pwr #define sqrt sqrtt #define int long long #define ll long long typedef unsigned long long ull; using namespace std; const int N=7005; int n,m,q,a[N]; bool b[N]; int32_t main(){ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL); cin>>n>>m; for (int i=1;i<=n;i++){ char c;cin>>c; if (c=='R') b[i]=1; } for (int i=1;i<=m;i++) cin>>a[i]; cin>>q; while (q--){ int l,r; cin>>l>>r; for (int i=l;i<=r;i++){ int j=a[i];b[j]=1; while (j && j<=n){ if (b[j]) b[j]=0,j++; else b[j]=1,j--; } /*for (int k=1;k<=n;k++){ if (b[k]) cout<<'R'; else cout<<'B'; }cout<<endl;*/ }int ans=0; for (int i=1;i<=n;i++) ans+=b[i]; cout<<ans<<endl; } return 0; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...