#include<bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long ll;
const ll mod=1e9+7;
const int inf=(1<<30);
const int MX=309;
char a[MX][MX];
int n,m,dp[MX][MX][MX];
int DP(int x,int y,int open){
if(y<=0||y>m||open<0)return -inf;
if(x==0){
if(open)return -inf;
return 0;
}
if(a[x][y]=='*'){
if(open)return -inf;
return 0;
}
int &ret=dp[x][y][open];if(ret!=-1)return ret;
pair<char,int>v[3];
v[0]={a[x-1][y-1],y-1};
v[1]={a[x-1][y],y};
v[2]={a[x-1][y+1],y+1};
sort(v,v+3);
for(int i=0;i<3;i++){
pair<char,int>pp=v[i];
int open1=open,add=0;
if(pp.first=='(')open1++;
if(pp.first==')')open1--,add=2;
if((pp.first=='('||pp.first==')'))ret=max(ret,DP(x-1,pp.second,open1)+add);
ret=max(ret,DP(x-1,pp.second,open));
}
return ret;
}
void FDP(int x,int y,int open){
if(y<=0||y>m||open<0)return;
if(x<=0)return;
if(a[x][y]=='*')return;
int &ret=dp[x][y][open];
pair<char,int>v[3];
v[0]={a[x-1][y-1],y-1};
v[1]={a[x-1][y],y};
v[2]={a[x-1][y+1],y+1};
sort(v,v+3);
for(int i=0;i<3;i++){
pair<char,int>pp=v[i];
int open1=open,add=0;
if(pp.first=='(')open1++;
if(pp.first==')')open1--,add=2;
if(pp.first=='('||pp.first==')')if(ret==DP(x-1,pp.second,open1)+add){
printf("%c",pp.first);
FDP(x-1,pp.second,open1);
return;
}
if(ret==DP(x-1,pp.second,open)){
FDP(x-1,pp.second,open);
return;
}
}
}
int main(){
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
for(int j=1;j<=m;j++){
cin>>a[i][j];
}
}
memset(dp,-1,sizeof(dp));
int j;
for(int i=1;i<=m;i++){
if(a[n][i]=='M')j=i;
}
cout<<DP(n,j,0)<<endl;
FDP(n,j,0);
puts("");
}
Compilation message
retro.cpp: In function 'int main()':
retro.cpp:64:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
retro.cpp:75:19: warning: 'j' may be used uninitialized in this function [-Wmaybe-uninitialized]
cout<<DP(n,j,0)<<endl;
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
9 ms |
117360 KB |
Partially correct |
2 |
Correct |
9 ms |
117360 KB |
Output is correct |
3 |
Partially correct |
13 ms |
117360 KB |
Partially correct |
4 |
Partially correct |
0 ms |
117360 KB |
Partially correct |
5 |
Correct |
6 ms |
117360 KB |
Output is correct |
6 |
Partially correct |
19 ms |
117360 KB |
Partially correct |
7 |
Partially correct |
19 ms |
117360 KB |
Partially correct |
8 |
Partially correct |
16 ms |
117360 KB |
Partially correct |
9 |
Correct |
63 ms |
117360 KB |
Output is correct |
10 |
Partially correct |
36 ms |
117360 KB |
Partially correct |
11 |
Execution timed out |
500 ms |
117360 KB |
Execution timed out |
12 |
Execution timed out |
500 ms |
117360 KB |
Execution timed out |
13 |
Partially correct |
253 ms |
117360 KB |
Partially correct |
14 |
Partially correct |
399 ms |
117360 KB |
Partially correct |
15 |
Execution timed out |
500 ms |
117360 KB |
Execution timed out |
16 |
Execution timed out |
500 ms |
117360 KB |
Execution timed out |
17 |
Execution timed out |
500 ms |
117360 KB |
Execution timed out |
18 |
Partially correct |
313 ms |
117360 KB |
Partially correct |
19 |
Execution timed out |
500 ms |
117360 KB |
Execution timed out |
20 |
Execution timed out |
500 ms |
117360 KB |
Execution timed out |