이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <vector>
#define lgm cin.tie(0)->sync_with_stdio(0);
using namespace std;
#define int long long
signed main() {
lgm;
int n;
cin >> n;
string c;
cin >> c;
auto dfs = [&] (auto dfs,int p,vector<char> a,vector<char> b)->int {
vector<char> ua=a,ub=b;
int sa=0,sb=0;
bool hm=0,hb=0,hf=0;
ua[0]=ua[1];
ua[1]=ua[2];
ua[2]=c[p];
ub[0]=ub[1];
ub[1]=ub[2];
ub[2]=c[p];
for (int i=0;i<3;i++) {
if (ua[i] == 'M') {
sa+=1-hm;
hm=1;
} else if (ua[i] == 'B') {
sa+=1-hb;
hb=1;
} else if (ua[i] == 'F') {
sa+=1-hf;
hf=1;
}
}
hm=0; hb=0; hf=0;
for (int i=0;i<3;i++) {
if (ub[i] == 'M') {
sb+=1-hm;
hm=1;
} else if (ub[i] == 'B') {
sb+=1-hb;
hb=1;
} else if (ub[i] == 'F') {
sb+=1-hf;
hf=1;
}
}
if (p == n-1) {
return max(sa,sb);
}
return max(sa+dfs(dfs,p+1,ua,b),sb+dfs(dfs,p+1,a,ub));
};
cout << dfs(dfs,0,{' ',' ',' '},{' ',' ',' '});
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |