Pinopeli

input/code.cpp: In function 'int h(std::map<int, int>, bool)':
input/code.cpp:52:9: warning: 'art' may be used uninitialized in this function [-Wmaybe-uninitialized]
         if (art) stc[p.F-i]--;
         ^

#include <iostream>
#include <map>
#include <unordered_map>
#include <vector>
using namespace std;
#define F first
#define S second
string stfy(map<int, int> &st) {
  string s;
  for (auto p : st) {
    s += to_string(p.first);
    s += ":";
    s += to_string(p.second);
    s += ";";
  }
  return s;
}
unordered_map<string, int> cc;
int N, A;
int TAKE_x, TAKE_y, KEEP;
vector<pair<int, int>> ADDs;
int y(map<int, int>&, vector<int>&, vector<pair<int, int>>&, int, bool);
int h(map<int, int> st, bool vr = 0) {
  if (st.size() == 0) return 0;
  string s = stfy(st);
  if (cc.count(s)) return cc[s];
  for (auto p : st) {
    map<int, int> stc = st;
    stc[p.F]--;
    if (stc[p.F] == 0) stc.erase(p.F);
    for (int i = 1; i <= p.F; ++i) {
      bool art;
      if (i != p.F) {
        art = stc.count(p.F-i);
        stc[p.F-i]++;
      }
      vector<int> sz;
      for (auto p2 : stc) {
        for (int j = 0; j < p2.S; ++j) sz.push_back(p2.F);
      }
      vector<pair<int, int>> ha;
      if (y(stc, sz, ha, i, vr)) {
        if (vr) {
          TAKE_x = p.F;
          TAKE_y = i;
        }
        //cout << "V: " << s << endl;
        cc[s] = 1;
        return 1;
      }
      if (i != p.F) {
        if (art) stc[p.F-i]--;
        else stc.erase(p.F-i);
      }
    }
  }
  //cout << "H: " << s << endl;
  cc[s] = 0;
  return 0;
}
int y(map<int, int> &st, vector<int> &sz, vector<pair<int, int>> &ha, int lf, bool vr) {
  if (lf < 1) return 0;
  if (ha.size() >= sz.size()) {
    if (lf <= A) {
      map<int, int> stc = st;
      for (auto p : ha) {
        if (p.F) {
          stc[p.F]--;
          if (stc[p.F] == 0) stc.erase(p.F);
        }
        stc[p.F+p.S]++;
      }
      bool W = !h(move(stc));
      if (W) {
        if (vr) KEEP=lf;
        return W;
      }
    }
    for (int i = 1; i < lf; ++i) {
      ha.push_back({0, i});
      if (y(st, sz, ha, lf-i, vr)) {
        if (vr) ADDs.push_back({0, i});
        return 1;
      }
      ha.pop_back();
    }
  } else {
    for (int i = 0; i < lf; ++i) {
      int szi = ha.size();
      ha.push_back({sz[szi], i});
      if (y(st, sz, ha, lf-i, vr)) {
        if (vr) ADDs.push_back({sz[szi], i});
        return 1;
      }
      ha.pop_back();
    }
  }
  return 0;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> A;
  map<int, int> bg;
  int sum = 0;
  for (int i = 0; i < N; ++i) {
    int x;
    cin >> x;
    bg[x]++;
    sum += x;
  }
  if (A == 1) {
    if (sum&1) {
      cout << "YES\n";
      cout << "TAKE " << bg.begin()->F << " 1\n";
      cout << "KEEP 1\n";
      cout << "END\n";
    } else cout << "NO\n";
    return 0;
  }
  bool W = h(bg, 1);
  if (W) {
    cout << "YES\n";
    cout << "TAKE " << TAKE_x << " " << TAKE_y << endl;
    cout << "KEEP " << KEEP << endl;
    for (auto p : ADDs) {
      if (p.S) cout << "ADD " << p.F << " " << p.S << '\n';
    }
    cout << "END" << endl;
  } else cout << "NO" << endl;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 1

Verdict: ACCEPTED

Test 12

Group: 1

Verdict: ACCEPTED

Test 13

Group: 1

Verdict: ACCEPTED

Test 14

Group: 1

Verdict: ACCEPTED

Test 15

Group: 1

Verdict: ACCEPTED

Test 16

Group: 1

Verdict: ACCEPTED

Test 17

Group: 1

Verdict: ACCEPTED

Test 18

Group: 1

Verdict: ACCEPTED

Test 19

Group: 1

Verdict: ACCEPTED

Test 20

Group: 1

Verdict: ACCEPTED

Test 21

Group: 1

Verdict: ACCEPTED

Test 22

Group: 1

Verdict: ACCEPTED

Test 23

Group: 1

Verdict: ACCEPTED

Test 24

Group: 1

Verdict: ACCEPTED

Test 25

Group: 1

Verdict: ACCEPTED

Test 26

Group: 1

Verdict: ACCEPTED

Test 27

Group: 1

Verdict: ACCEPTED

Test 28

Group: 1

Verdict: ACCEPTED

Test 29

Group: 1

Verdict: ACCEPTED

Test 30

Group: 1

Verdict: ACCEPTED

Test 31

Group: 1

Verdict: ACCEPTED

Test 32

Group: 1

Verdict: ACCEPTED

Test 33

Group: 1

Verdict: ACCEPTED

Test 34

Group: 1

Verdict: ACCEPTED

Test 35

Group: 1

Verdict: ACCEPTED

Test 36

Group: 1

Verdict: ACCEPTED

Test 37

Group: 2

Verdict: ACCEPTED

Test 38

Group: 2

Verdict: ACCEPTED

Test 39

Group: 2

Verdict: ACCEPTED

Test 40

Group: 2

Verdict: ACCEPTED

Test 41

Group: 2

Verdict: ACCEPTED

Test 42

Group: 2

Verdict: ACCEPTED

Test 43

Group: 2

Verdict: ACCEPTED

Test 44

Group: 2

Verdict: ACCEPTED

Test 45

Group: 2

Verdict: ACCEPTED

Test 46

Group: 2

Verdict: ACCEPTED

Test 47

Group: 3

Verdict: ACCEPTED

Test 48

Group: 3

Verdict: ACCEPTED

Test 49

Group: 3

Verdict: ACCEPTED

Test 50

Group: 3

Verdict: ACCEPTED

Test 51

Group: 3

Verdict: ACCEPTED

Test 52

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 53

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 54

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 55

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 56

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 57

Group: 3

Verdict: RUNTIME ERROR

Test 58

Group: 3

Verdict: RUNTIME ERROR

Test 59

Group: 3

Verdict: RUNTIME ERROR

Test 60

Group: 3

Verdict: RUNTIME ERROR

Test 61

Group: 3

Verdict: RUNTIME ERROR