Submission #3631604

---

Source Code Expand

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <map>
#include <vector>
#include <math.h>
#include <algorithm>
#include <queue>
#include <set>
#include <tuple>
using namespace std;

#define FOR(i,init,a) for(int i=init; i<a; i++)
#define rep(i,a) FOR(i,0,a)
#define rrep(i,a) for(int i=a; i>=0; i--)
#define rep1(i,a) for(int i=1; i<=a; i++)
#define cout1(a) cout << a << endl;
#define cout2(a,b) cout << a << " " << b << endl;
#define cout3(a,b,c) cout << a << " " << b << " " << c << endl;
#define cout4(a,b,c,d) cout << a << " " << b << " " << c << " " << d << endl;
#define mem(a,n) memset( a, n, sizeof(a))
#define all(a) a.begin(),a.end()

typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> V;
typedef vector<V> VV;
typedef vector<VV> VVV;
const int INF = 1e9;
const int MOD = 1e9+7;
const ll LLINF = 1e18;
static const double pi = 3.141592653589793;

int N, K;
string S;
bool visit[60][60][60], res[60][60][60];
int dp[60][60][60][2];

bool dfs(int L,int R,int K){
    if(visit[L][R][K]) return res[L][R][K];
    if((R-L)%2) return false;
    visit[L][R][K]=true;
    dp[L][R][K][0]=1<<20;
    dp[L][R][K][1]=-1<<20;
    
    if(L==R){
        if(K){
            res[L][R][K]=true;
            dp[L][R][K][0]=0;
            dp[L][R][K][1]=9;
        }else{
            if(S[L]>='0'&&S[L]<='9'){
                res[L][R][K]=true;
                dp[L][R][K][0]=dp[L][R][K][1]=S[L]-'0';
            }
        }
    }else{
        int left=K-(S[R]!='+');
        if(left>=0){
            for(int M=L;M<R-1;M++)rep(LL,left+1){
                if(dfs(L,M,LL)&&dfs(M+1,R-1,left-LL)){
                    res[L][R][K]=true;
                    dp[L][R][K][0]=min(dp[L][R][K][0],dp[L][M][LL][0]+dp[M+1][R-1][left-LL][0]);
                    dp[L][R][K][1]=max(dp[L][R][K][1],dp[L][M][LL][1]+dp[M+1][R-1][left-LL][1]);
                }
            }
        }
        left=K-(S[R]!='-');
        if(left>=0){
            for(int M=L;M<R-1;M++)rep(LL,left+1){
                if(dfs(L,M,LL)&&dfs(M+1,R-1,left-LL)){
                    res[L][R][K]=true;
                    dp[L][R][K][0]=min(dp[L][R][K][0],dp[L][M][LL][0]-dp[M+1][R-1][left-LL][1]);
                    dp[L][R][K][1]=max(dp[L][R][K][1],dp[L][M][LL][1]-dp[M+1][R-1][left-LL][0]);
                }
            }
        }
    }
    return res[L][R][K];
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    cin>>K>>S;
    N=S.size();
    
    int ma=-10000;
    rep(i,K+1)if(dfs(0,N-1,i)) ma=max(ma,dp[0][N-1][i][1]);
    if(ma==-10000){
        cout1("NG");
    }else{
        cout1("OK");
        cout1(ma);
    }
}

Submission Info

Judge Result