|
马上注册,结交更多好友,享用更多功能^_^
您需要 登录 才可以下载或查看,没有账号?立即注册
x
- #include<bits/stdc++.h>
- using namespace std;
- typedef long long ll;
- vector<int> a, b;
- int n, m;
- int mod(vector<int> &a, int n) {
- int sum = 1;
- for (int i = 0; i < n; i++) {
- b[i] = a[i] % m;
- }
- for (int i = 0; i < n; i++) {
- sum *= b[i];
- }
- return sum%m;
- }
- void solve() {
- int n, m;
- cin >> n >> m;
- a.resize(n);
- b.resize(n); // 初始化 b 向量的大小
- for (int i = 0; i < n; i++) cin >> a[i];
- string s;
- cin >> s;
- cout << mod(a, n) << " ";
- for (int i = 0; i < n; i++) {
- if (s[i] == 'L') {
- a.erase(a.begin(),a.begin());
- cout << mod(a, a.size()) << " ";
- } else {
- a.erase(a.end()-1,a.end()-1);
- cout << mod(a, a.size()) << " ";
- }
- }
- cout << "\n";
- }
- int main() {
- int t;
- cin >> t;
- while (t--) {
- solve();
- }
- }
复制代码
样例:
1
4 6
3 1 4 2
LRRL |
|