记忆化搜索40分求助

#include<bits/stdc++.h>
using namespace std;
int m,s,t,t2=2147483647,dis;
bool yes=false;
map<int,map<int,map<int,bool> > > flag;
void mem_dfs(int m1,int s1,int t1){
	if(t1==0){
		dis=max(dis,s-s1);
	}
	if(t1<0){
		return;
	}
	if(s1<=0){
		t2=min(t2,t-t1);
		yes=1;
	}
	if(m1>=10){
		if(!flag[m1-10][s1-60][t1-1]){
			flag[m1-10][s1-60][t1-1]=1;
			mem_dfs(m1-10,s1-60,t1-1);
		}
		
	}
	if(!flag[m1+4][s1][t1-1]){
		flag[m1+4][s1][t1-1]=1;
		mem_dfs(m1+4,s1,t1-1);
	}
	if(!flag[m1][s1-17][t1-1]){
		flag[m1][s1-17][t1-1]=1;
		mem_dfs(m1,s1-17,t1-1);
	}
	
}
signed main(){
	cin>>m>>s>>t;
	mem_dfs(m,s,t);
	if(yes) cout<<"Yes"<<"\n"<<t2;
	else cout<<"No"<<"\n"<<dis;
	return 0;
}