代码如下
#include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;
int r, c, n;
char mapp[40][40];
int main(){
ios::sync_with_stdio(false);
cin.tie(0);
ios::sync_with_stdio(0);
cin.tie(0);
cin >> r >> c;
for(int i = 1; i <= r; i++){
for(int j = 1; j <= c; j++){
cin >> mapp[i][j];
}
}
cin >> n;
while(n--){
int lie, hang = 1;
cin >> lie;
if(mapp[hang][lie] == 'X' || mapp[hang][lie] == 'O')
continue;
while(hang != r){
if(mapp[hang + 1][lie] == '.') hang++;
else if(mapp[hang + 1][lie] == 'X') break;
else if(lie != 1 && mapp[hang][lie - 1] == '.'
&& mapp[hang + 1][lie - 1] == '.'){
hang++;
lie--;
}
else if(lie != c && mapp[hang][lie + 1] == '.'
&& mapp[hang + 1][lie + 1] == '.'){
hang++;
lie++;
}
else break;
}
mapp[hang][lie] = 'O';
}
for(int i = 1; i <= r; i++){
for(int j = 1; j <= c; j++){
cout << mapp[i][j];
}
cout << '\n';
}
return 0;
}
样例对了,但RE 。ToT 。
悬如冠
艾薇谁敢嬷./aaa