제출 #147078

#제출 시각아이디문제언어결과실행 시간메모리
147078Sarah_MokhtarMiners (IOI07_miners)C++14
100 / 100
1455 ms110228 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N=1e5+10,M=2e5+100,OO=0x3f3f3f3f,mod=1e8; int dp[N][4][4][4][4],n; string s; int diff(int x, int y, int z){ set <int> ret = {x, y, z}; while(*ret.rbegin() == 3){ ret.erase(--ret.end()); } return ret.size(); } int id(char c){ if(c=='M') return 0; if(c=='B') return 1; if(c=='F') return 2; } int solve(int i,int pl1,int pl2,int pr1,int pr2){ if(i==n) return 0; int& ret=dp[i][pl1][pl2][pr1][pr2]; if(~ret) return ret; int op1=diff(pl1,pl2,id(s[i]))+solve(i+1,pl2,id(s[i]),pr1,pr2); int op2=diff(id(s[i]),pr1,pr2)+solve(i+1,pl1,pl2,pr2,id(s[i])); return ret=max(op1,op2); } int main(){ cin>>n>>s; memset(dp,-1,sizeof(dp)); cout<<solve(0,3,3,3,3); }

컴파일 시 표준 에러 (stderr) 메시지

miners.cpp: In function 'int id(char)':
miners.cpp:18:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
#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...