제출 #956726

#제출 시각아이디문제언어결과실행 시간메모리
956726DeltaStructMiners (IOI07_miners)C++17
53 / 100
1601 ms604 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n,id=numeric_limits<int>::lowest(); cin >> n; string s; cin >> s; vector dp(4,vector(4,vector(4,vector<int>(4,id)))); string u = "MFB"; dp[3][3][3][3] = 0; for (char a:s){ vector res(5,vector(5,vector(5,vector<int>(5,id)))); int t = find(u.begin(),u.end(),a)-u.begin(); for (int i(0);i < 4;++i) for (int k(0);k < 4;++k) for (int j(0);j < 4;++j) for (int l(0);l < 4;++l){ if (dp[i][k][j][l]!=3){ { set<int> s = {i,k,t}; if (s.find(3)!=s.end()) s.erase(3); res[k][t][j][l] = max(res[k][t][j][l],dp[i][k][j][l]+(int)s.size()); } { set<int> s = {j,l,t}; if (s.find(3)!=s.end()) s.erase(3); res[i][k][l][t] = max(res[i][k][l][t],dp[i][k][j][l]+(int)s.size()); } } } swap(dp,res); } int r = 0; for (int i(0);i < 4;++i) for (int k(0);k < 4;++k) for (int j(0);j < 4;++j) for (int l(0);l < 4;++l){ r = max(r,dp[i][k][j][l]); } cout << r << endl; }
#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...
#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...