Submission #3790277

---

Source Code Expand

// #include <boost/functional/hash.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// using mlint = boost::multiprecision::cpp_int;

#include <cassert>
#include <deque>
#include <queue>
#include <stack>
#include <algorithm>
#include <iostream>
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <complex>
#include <functional>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <iomanip>

using namespace std;
using i64 = int_fast64_t;
using db = double;
using pii = pair<int, int>;
using pli = pair<int_fast64_t, int>;
using pdi = pair<db, int>;
using plpii = pair<int_fast64_t, pair<int, int>>;
template <class T> using mat = vector<vector<T>>;
template <class T> using rprque = priority_queue<T, vector<T>, greater<T>>;

#define esc(x) cout << (x) << endl, exit(0)
#define inf(T) (numeric_limits<T>::max() / 2 - 1)
#define each(i, v) for (auto i = begin(v); i != end(v); ++i)
#define reach(i, v) for (auto i = rbegin(v); i != rend(v); ++i)
#define urep(i, s, t) for (int_fast64_t i = (s); i <= (t); ++i)
#define drep(i, s, t) for (int_fast64_t i = (s); i >= (t); --i)
#define rep(i, n) urep(i, 0, (n)-1)
#define rep1(i, n) urep(i, 1, (n))
#define rrep(i, n) drep(i, (n)-1, 0)
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
#define fir first
#define sec second
#define vct vector
#define u_map unordered_map
#define u_set unordered_set
#define l_bnd lower_bound
#define u_bnd upper_bound
#define rsz resize
#define ers erase
#define emp emplace
#define emf emplace_front
#define emb emplace_back
#define pof pop_front
#define pob pop_back
#define mkp make_pair
#define mkt make_tuple
#define popcnt __builtin_popcount

struct setupper
{
    setupper(uint_fast8_t prec)
    {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(prec);
#ifdef Local
    #define debug 1
    #define print(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
        cout << "\n-- Execution At Local ---\n"
             << "\n<Standard Output>\n"
             << "\n----------------\n\n";
        auto print_atexit = []() {
            time_t end_time = time(NULL);
            struct tm *ret = localtime(&end_time);
            cout << "\n----------------\n";
            cout << "\nSuccessfully Executed At " << (ret->tm_hour) << ":" << (ret->tm_min) << ":" << (ret->tm_sec) << "\n\n";
        };
        atexit(print_atexit);
#else
    #define debug 0
#endif
    }
} ;

template <class T, class U> ostream& operator << (ostream& s, pair<T,U> p) { return s << p.fir << " " << p.sec; }
template <class T> ostream& operator << (ostream& s, vct<T> v) { each(i,v) { if(i != begin(v)) s << " "; s << *i; } return s; }

namespace std {
    template <class T> void hash_combine(size_t &seed, T const &key) {
        seed ^= hash<T>()(key) + 0x9e3779b9 + (seed << 6) + (seed >> 2);
    }
    template <class T, class U> struct hash<pair<T,U>> {
        size_t operator()(pair<T,U> const &pr) const
        {
            size_t seed = 0;
            hash_combine(seed,pr.first);
            hash_combine(seed,pr.second);
            return seed;
        }
    };
    template <class Tup, size_t index = tuple_size<Tup>::value - 1> struct hashval_calc {
        static void apply(size_t& seed, Tup const& tup) {
            hashval_calc<Tup, index - 1>::apply(seed, tup);
            hash_combine(seed,get<index>(tup));
        }
    };
    template <class Tup> struct hashval_calc<Tup,0> {
        static void apply(size_t& seed, Tup const& tup) {
            hash_combine(seed,get<0>(tup));
        }
    };
    template <class ...T> struct hash<tuple<T...>> {
        size_t operator()(tuple<T...> const& tup) const
        {
            size_t seed = 0;
            hashval_calc<tuple<T...>>::apply(seed,tup);
            return seed;
        }
    };
}

void read() {}
template <class T, class ...Rest> void read(T &x, Rest &... rest) { cin >> x; read(rest...); }
template <class T> void write(T x) { cout << x; }
template <class T, class ...Rest> void write(T x, Rest ... rest) { cout << x << ' '; write(rest...); }
void writeln() {}
template <class T, class ...Rest> void writeln(T x, Rest ... rest) { cout << x << endl; writeln(rest...); }
const auto add = [](auto &x, auto y) { x += y; };
const auto mul = [](auto &x, auto y) { x *= y; };
const auto lam_min = [](auto x, auto y) { return min(x, y); };
const auto lam_max = [](auto x, auto y) { return max(x, y); };
const auto chmax = [](auto &m, auto x) { if(m < x){ m = x; return true; } return false; };
const auto chmin = [](auto &m, auto x) { if(m > x){ m = x; return true; } return false; };
bool odd(i64 x) { return x & 1; }
bool even(i64 x) { return !odd(x); }
bool parity(i64 x, i64 y) { return odd(x) ^ even(y); }
bool bit(i64 n, uint8_t e) { return (n >> e) & 1; }
i64 mask(i64 n, uint8_t e) { return n & ((1 << e) - 1); }
int ilog(i64 x, uint64_t b = 2) {
    if (x) return ilog(x / b, b) + 1;
    return -1;
}
uint divcnt(i64 x, i64 d) { if(x | d) return x % d ? 0 : divcnt(x / d, d) + 1; return inf(uint); }
i64 qceil(i64 x, i64 y) { return x > 0 ? (x - 1) / y + 1 : x / y; }
i64 gcd(i64 a, i64 b) {
    if (!b) return abs(a);
    return gcd(b, a % b);
}
i64 lcm(i64 a, i64 b) {
    if (a | b) return abs(a / gcd(a, b) * b);
    return 0;
}
i64 extgcd(i64 a, i64 b, i64 &x, i64 &y) {
    i64 d = a;
    if (b) d = extgcd(b, a % b, y, x), y -= (a / b) * x;
    else x = 1, y = 0;
    return d;
}
template <class F> i64 binsr(i64 ok, i64 ng, const F &fn) {
    while (abs(ok - ng) > 1) {
        i64 mid = (ok + ng) / 2;
        (fn(mid) ? ok : ng) = mid;
    }
    return ok;
}
template <class T> T cmprs(T &v) {
    T tmp = v, ret = v;
    sort(all(tmp));
    tmp.erase(unique(all(tmp)), end(tmp));
    each(i, ret) *i = l_bnd(all(tmp), *i) - begin(tmp) + 1;
    return ret;
}

constexpr int dx[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
constexpr int dy[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr long double gold = 1.618033988;
constexpr long double eps = 1e-15;
constexpr uint_fast64_t mod = 1e9 + 7;

string s;
int n,k;

int tonum(char c) {
    return (c!='+' and c!='-')?c-'0':-1;
}

bool vis[2][60][60][60];
int max_[60][60][60],min_[60][60][60];

int solvemin(int i,int j,int h);

int solvemax(int i,int j,int h) {
    if(vis[0][i][j][h]) return max_[i][j][h];
    vis[0][i][j][h]=true;
    int ret=-inf(int);
    if(j-i==1) {
        if(tonum(s[i])>=0) {
            ret=h>0?9:tonum(s[i]);
        } else {
            if(h>0) ret=9;
        }
        return max_[i][j][h]=ret;
    }
    if(h>0) {
        urep(b,i+1,j-2)rep(c,h) {
            int lef=solvemax(i,b,c);
            int rigx=solvemax(b,j-1,h-c-1);
            int rign=solvemin(b,j-1,h-c-1);
            if(lef>-inf(int) and rigx > -inf(int)) {
                ret=max(ret,lef+rigx);
            }
            if(lef>-inf(int) and rign<inf(int)) {
                ret=max(ret,lef-rign);
            }
        }
    }
    if(s[j-1]=='+') {
        urep(b,i+1,j-2)rep(c,h+1) {
            int lef=solvemax(i,b,c);
            int rigx=solvemax(b,j-1,h-c);
            if(min(rigx,lef)!=-inf(int)) ret=max(ret,lef+rigx);
        }
    } else if(s[j-1]=='-') {
        urep(b,i+1,j-2)rep(c,h+1) {
            int lef=solvemax(i,b,c);
            int rign=solvemin(b,j-1,h-c);
            if(min(-rign,lef)!=-inf(int)) ret=max(ret,lef-rign);
        }
    }
    return max_[i][j][h]=ret;
}

int solvemin(int i,int j,int h) {
    if(vis[1][i][j][h]) return min_[i][j][h];
    vis[1][i][j][h]=true;
    int ret=inf(int);
    if(j-i==1) {
        if(tonum(s[i])>=0) {
            ret=h>0?0:tonum(s[i]);
        } else {
            if(h>0) ret=0;
        }
        return min_[i][j][h]=ret;
    }
    if(h>0) {
        urep(b,i+1,j-2)rep(c,h) {
            int lef=solvemin(i,b,c);
            int rigx=solvemax(b,j-1,h-c-1);
            int rign=solvemin(b,j-1,h-c-1);
            if(lef<inf(int) and rigx > -inf(int)) {
                ret=min(ret,lef-rigx);
            }
            if(lef<inf(int) and rign<inf(int)) {
                ret=min(ret,lef+rign);
            }
        }
    }
    if(s[j-1]=='-') {
        urep(b,i+1,j-2)rep(c,h+1) {
            int lef=solvemin(i,b,c);
            int rigx=solvemax(b,j-1,h-c);
            if(min(rigx,-lef)!=-inf(int)) ret=min(ret,lef-rigx);
        }
    } else if(s[j-1]=='+') {
        urep(b,i+1,j-2)rep(c,h+1) {
            int lef=solvemin(i,b,c);
            int rign=solvemin(b,j-1,h-c);
            if(min(-rign,-lef)!=-inf(int)) ret=min(ret,lef+rign);
        }
    }
    return min_[i][j][h]=ret;
}

int main() {
    read(k,s);
    n=s.size();
    int ans=solvemax(0,n,k);
    if(ans!=-inf(int)) writeln("OK",ans);
    else writeln("NG");
}

Submission Info

Judge Result