Submission #1063854

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const double PI2 = 8.0 * atan(1.0);

#define REP(i,n)	for(int i=0;i<(int)n;++i)
#define ALL(c)		(c).begin(),(c).end()
#define CLEAR(v)	memset(v,0,sizeof(v))
#define MP(a,b)		make_pair((a),(b))
#define ABS(a)		((a)>0?(a):-(a))
#define FOR(i,s,n)	for(int i=s;i<(int)n;++i)

#define OK "OK"
#define NG "NG"

int k;
string s;
int n;

#define INF (1000000)

int dp[2][100][100][100];

int main(int argc, char **argv) {
	cin >> k >> s;
	n = s.length();
	if (n % 2 == 0) {
		cout << NG << endl;
		return 0;
	}
	REP(i, n) REP(j, n - i + 1) REP(l, k + 1) {
		dp[0][i][j][l] = INF;
		dp[1][i][j][l] = -INF;
	}
	REP(i, n) {
		if (s[i] >= '0' && s[i] <= '9') {
			dp[0][i][1][0] = dp[1][i][1][0] = s[i] - '0';
		}
		dp[0][i][1][1] = 0;
		dp[1][i][1][1] = 9;
	}
	REP(temp, n / 2) {
		int j = temp * 2 + 3;
		REP(i, n - j + 1) {
			REP(temp2, j / 2) {
				int j2 = temp2 * 2 + 1;
				REP(l1, k + 1) REP(l2, k - l1 + 1) {
					int mi1 = dp[0][i][j2][l1];
					int ma1 = dp[1][i][j2][l1];
					int mi2 = dp[0][i + j2][j - j2 - 1][l2];
					int ma2 = dp[1][i + j2][j - j2 - 1][l2];
					if (s[i + j - 1] == '+') {
						dp[0][i][j][l1 + l2] = min(dp[0][i][j][l1 + l2], mi1 + mi2);
						dp[0][i][j][l1 + l2 + 1] = min(dp[0][i][j][l1 + l2 + 1], mi1 - ma2);
						dp[1][i][j][l1 + l2] = max(dp[1][i][j][l1 + l2], ma1 + ma2);
						dp[1][i][j][l1 + l2 + 1] = max(dp[1][i][j][l1 + l2 + 1], ma1 - mi2);
					}
					else if (s[i + j - 1] == '-') {
						dp[0][i][j][l1 + l2 + 1] = min(dp[0][i][j][l1 + l2 + 1], mi1 + mi2);
						dp[0][i][j][l1 + l2] = min(dp[0][i][j][l1 + l2], mi1 - ma2);
						dp[1][i][j][l1 + l2 + 1] = max(dp[1][i][j][l1 + l2 + 1], ma1 + ma2);
						dp[1][i][j][l1 + l2] = max(dp[1][i][j][l1 + l2], ma1 - mi2);
					}
					else {
						dp[0][i][j][l1 + l2 + 1] = min(dp[0][i][j][l1 + l2 + 1], mi1 + mi2);
						dp[0][i][j][l1 + l2 + 1] = min(dp[0][i][j][l1 + l2 + 1], mi1 - ma2);
						dp[1][i][j][l1 + l2 + 1] = max(dp[1][i][j][l1 + l2 + 1], ma1 + ma2);
						dp[1][i][j][l1 + l2 + 1] = max(dp[1][i][j][l1 + l2 + 1], ma1 - mi2);
					}
				}
			}
		}
	}
	int res = -INF;
	REP(l, k + 1) res = max(res, dp[1][0][n][l]);
	if (abs(res) < 1000) {
		cout << OK << endl;
		cout << res << endl;
	}
	else {
		cout << NG << endl;
	}
	return 0;
}

Submission Info

Judge Result