이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define cin(vec) for(auto& i : vec) cin >> i
#define cout(vec) for(auto& i : vec) cout << i << " "; cout << "\n";
#define fast ios::sync_with_stdio(0);cin.tie(0);
#define loop(i,a,b) for (int i = a; i < b; i++)
#define F first
#define S second
#define pb(n) push_back(n)
#define pf(n) push_front(n)
#define dci(d) fixed<<setprecision(d)
#define sp ' '
#define el '\n'
#define all(v) v.begin(),v.end()
#define int long long
int dx[8]= {0,0,1,-1,-1,1,1,-1};
int dy[8]= {-1,1,0,0,-1,1,-1,1};
int const N=1e5+1,M=1e3+1,Mod=1e9+7;
string s;
int n;
int dp[N][4][4][4][4];
int value(int a,int b,int c){
set<int>s;
s.insert(a);
s.insert(b);
s.insert(c);
s.erase(0ll);
return s.size();
}
int trans(char x){
if(x=='M')return 1;
else (x=='F'?2:3);
}
int rec(int idx, int left_a, int left_b, int right_a, int right_b){
if(idx==n)return 0;
int _idx=idx,lefta=left_a,leftb=left_b,righta=right_a,rightb=right_b;
int &ret=dp[idx][left_a][left_b][right_a][right_b];
if(~ret)return ret;
int c=trans(s[idx]);
int c1=rec(idx+1,left_b,c,right_a,right_b)+value(left_a,left_b,c);
int c2=rec(idx+1,left_a,left_b,right_b,c)+value(right_a,right_b,c);
return dp[idx][lefta][leftb][righta][rightb]=max(c1,c2);
}
void testcase(int h){
cin>>n>>s;
memset(dp,-1,sizeof dp);
cout<<rec(0,0,0,0,0);
}
int32_t main()
{
fast
testcase(1);
// int tc;cin>>tc;for(int i=1;i<=tc;i++)testcase(i);
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
miners.cpp: In function 'long long int trans(char)':
miners.cpp:32:20: warning: second operand of conditional expression has no effect [-Wunused-value]
32 | else (x=='F'?2:3);
| ^
miners.cpp:32:20: warning: third operand of conditional expression has no effect [-Wunused-value]
miners.cpp: In function 'long long int rec(long long int, long long int, long long int, long long int, long long int)':
miners.cpp:36:7: warning: unused variable '_idx' [-Wunused-variable]
36 | int _idx=idx,lefta=left_a,leftb=left_b,righta=right_a,rightb=right_b;
| ^~~~
miners.cpp: In function 'long long int trans(char)':
miners.cpp:33:1: warning: control reaches end of non-void function [-Wreturn-type]
33 | }
| ^
# | 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... |