Problem:


Score : 600 points

Problem Statement

There is a game that involves three variables, denoted A, B, and C.

As the game progresses, there will be N events where you are asked to make a choice.
Each of these choices is represented by a string s_i. If s_i is AB, you must add 1 to A or B then subtract 1 from the other; if s_i is AC, you must add 1 to A or C then subtract 1 from the other; if s_i is BC, you must add 1 to B or C then subtract 1 from the other.

After each choice, none of A, B, and C should be negative.

Determine whether it is possible to make N choices under this condition. If it is possible, also give one such way to make the choices.

Constraints

1 \leq N \leq 10^5

0 \leq A,B,C \leq 10^9

N, A, B, C are integers.

s_i is AB, AC, or BC.

Input

Input is given from Standard Input in the following format:

N A B C
s_1
s_2
:
s_N

Output

If it is possible to make N choices under the condition, print Yes; otherwise, print No.

Also, in the former case, show one such way to make the choices in the subsequent N lines. The (i+1)-th line should contain the name of the variable (A, B, or C) to which you add 1 in the i-th choice.

Sample Input 1

2 1 3 0
AB
AC

Sample Output 1

Yes
A
C

You can successfully make two choices, as follows:

In the first choice, add 1 to A and subtract 1 from B. A becomes 2, and B becomes 2.

In the second choice, add 1 to C and subtract 1 from A. C becomes 1, and A becomes 1.

Sample Input 2

3 1 0 0
AB
BC
AB

Sample Output 2

No

Sample Input 3

1 0 9 0
AC

Sample Output 3

No

Sample Input 4

8 6 9 1
AC
BC
AB
BC
AC
BC
AB
AB

Sample Output 4

Yes
C
B
B
C
C
B
A
A



Sample input:
2 1 3 0
AB
AC


Sample output:
Yes
A
C

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)


def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1               # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    

    def parse(com):
        if com == 'AB':
            return 0, 1
        elif com == 'BC':
            return 1, 2
        else:
            return 0, 2

    def sim_1(t_copy, commands):
        s = 'ABC'
        result = []
        for com in commands:
            i, j = parse(com)
            if t_copy[i] == 0 and t_copy[j] == 0:
                return False, result
            elif t_copy[i] == 0:
                result.append(s[i])
                t_copy[i], t_copy[j] = 1, 0
            else:
                result.append(s[j])
                t_copy[i], t_copy[j] = 0, 1
        return True, result
    

    def sim_2(t_copy, commands):
        s = 'ABC'
        size = len(commands)
        result = []
        for k in range(size):
            print(t_copy)
            com = commands[k]
            i, j = parse(com)
            if t_copy[i] == 0 and t_copy[j] == 0:
                raise RuntimeError
            # 配分後は必ず (1 以上, 1 以上, 0 以上)
            elif t_copy[i] == 0:
                result.append(s[i])
                t_copy[i] += 1
                t_copy[j] -= 1
            elif t_copy[j] == 0:
                result.append(s[j])
                t_copy[j] += 1
                t_copy[i] -= 1
            else:
                # 片方はどうしても 0 になってしまう
                if t_copy[i] == 1 and t_copy[j] == 1:
                    if k != size - 1:
                        next_com = commands[k + 1]
                        next_i, next_j = parse(next_com)
                        if not (i == next_i and j == next_j):
                            next_duplicate_one = list(set([i, j]) & set([next_i, next_j]))[0]
                            tmp = [next_i, next_j]
                            tmp.remove(next_duplicate_one)
                            next_not_duplicate = tmp[0]
                            if t_copy[next_not_duplicate] == 0:
                                result.append(s[next_duplicate_one])
                                t_copy[next_duplicate_one] += 1
                                tmp = [i, j]
                                tmp.remove(next_duplicate_one)
                                res = tmp[0]
                                t_copy[res] -= 1
                                continue    # ここを忘れてハマり続けた...
                    # 自由？
                    result.append(s[i])
                    t_copy[i] += 1
                    t_copy[j] -= 1
                # 0 にならないですむ                 
                elif t_copy[i] <= t_copy[j]:
                    result.append(s[i])
                    t_copy[i] += 1
                    t_copy[j] -= 1
                else:
                    result.append(s[j])
                    t_copy[j] += 1
                    t_copy[i] -= 1
        return result
            
    
    n, a, b, c  = mi()
    t = [a, b, c]
    commands = [input() for _ in range(n)]
    i, j = parse(commands[0])
    # (0, 0, 0)
    if sum(t) == 0:
        predicate = False
    # (1, 0, 0)
    elif sum(t) == 1:
        predicate, result = sim_1(t[:], commands)
    # (2 以上, 0, 0) で最初に沈む
    elif t.count(0) == 2 and t[i] == 0 and t[j] == 0:
        predicate = False
    # (2 以上, 0, 0) で最初に沈まない
    # (1 以上, 1 以上, 0)
    # (1 以上, 1 以上, 1 以上)
    # うまく立ち回り続ける
    else:
        predicate = True
        result = sim_2(t[:], commands)
    
    if predicate:
        print('Yes')
        print(*result, sep='\n')
    else:
        print('No')


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import sys
input = lambda: sys.stdin.readline().strip()
N, A, B, C = [int(x) for x in input().split()]
s = [input() for _ in range(N)]
last = {'AB': None, 'BC': None, 'AC': None}
abc = {'A': A, 'B': B, 'C': C}
moves = []
can = True
for x in s:
    if last[x] is None:
        last[x] = abc[x[1]] == 0
    abc[x[last[x]]] += 1
    abc[x[last[x] ^ 1]] -= 1
    moves.append(last[x])
    last[x] ^= 1
    can &= all(x >= 0 for x in abc.values())
if can:
    print('Yes')
    print(*(s[i][moves[i]] for i in range(N)), sep='\n')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
input = lambda: sys.stdin.readline().strip()
N, A, B, C = [int(x) for x in input().split()]
s = [input() for _ in range(N)]
last = {'AB': None, 'BC': None, 'AC': None}
abc = {'A': A, 'B': B, 'C': C}
moves = []
for x in s:
    if last[x] is None:
        last[x] = abc[x[1]] == 0
        abc[x[last[x]]] += 1
        abc[x[last[x] ^ 1]] -= 1
    moves.append(last[x])
    last[x] ^= 1
can = True
abc = {'A': A, 'B': B, 'C': C}
for i in range(N):
    abc[s[i][moves[i]]] += 1
    abc[s[i][moves[i] ^ 1]] -= 1
    can &= all(x >= 0 for x in abc.values())
if can:
    print('Yes')
    print(*(s[i][moves[i]] for i in range(N)), sep='\n')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

N,A,B,C = inputIL()
l = inputSLs(N)

if A+B+C == 0:
  print("No")
  exit()
  
n = len(l)


a = []

if A+B+C == 1:
  for item in l:
    if item == "AB":
      if A==B==0:
        print("No")
        exit()
      elif A==0:
        A += 1
        B -= 1
        a.append("A")
      else:
        A -= 1
        B += 1
        a.append("B")
    if item == "AC":
      if A==C==0:
        print("No")
        exit()
      elif A==0:
        A += 1
        C -= 1
        a.append("A")
      else:
        A -= 1
        C += 1
        a.append("C")
    if item == "BC":
      if B==C==0:
        print("No")
        exit()
      elif B==0:
        B += 1
        C -= 1
        a.append("B")
      else:
        B -= 1
        C += 1
        a.append("C")

if A+B+C >= 2:
  for i in range(n):
    item = l[i]
    if item == "AB":
      if A==B==0:
        print("No")
        exit()
      elif A==0:
        A += 1
        B -= 1
        a.append("A")
      elif B==0:
        A -= 1
        B += 1
        a.append("B")
      elif C==0 and i!=n-1:
        nitem = l[i+1]
        if nitem == "AB":
          A += 1
          B -= 1
          a.append("A")
        if nitem == "AC":
          A += 1
          B -= 1
          a.append("A")
        if nitem == "BC":
          A -= 1
          B += 1
          a.append("B")
      else:
        A += 1
        B -= 1
        a.append("A")
        
    if item == "AC":
      if A==C==0:
        print("No")
        exit()
      elif A==0:
        A += 1
        C -= 1
        a.append("A")
      elif C==0:
        A -= 1
        C += 1
        a.append("C")
      elif B==0 and i!=n-1:
        nitem = l[i+1]
        if nitem == "AC":
          A += 1
          C -= 1
          a.append("A")
        if nitem == "AB":
          A += 1
          C -= 1
          a.append("A")
        if nitem == "BC":
          A -= 1
          C += 1
          a.append("C")
      else:
        A += 1
        C -= 1
        a.append("A")

        
    if item == "BC":
      if B==C==0:
        print("No")
        exit()
      elif B==0:
        B += 1
        C -= 1
        a.append("B")
      elif C==0:
        B -= 1
        C += 1
        a.append("C")
      elif A==0 and i!=n-1:
        nitem = l[i+1]
        if nitem == "BC":
          B += 1
          C -= 1
          a.append("B")
        if nitem == "AB":
          B += 1
          C -= 1
          a.append("B")
        if nitem == "AC":
          B -= 1
          C += 1
          a.append("C")
      else:
        B += 1
        C -= 1
        a.append("B")
        
print(a)

        
print("Yes")
for item in a:
  print(item)

Submission status: Wrong Answer

Solution code:
import sys
def input() : return sys.stdin.readline().strip()

def main():
    N, A, B, C = map(int, input().split())
    s = tuple(input() for _ in range(N))
    d = {}
    d["A"] = A
    d["B"] = B
    d["C"] = C
    ans = []
    for i in range(N-1):
        l1, r1 = s[i]
        l2, r2 = s[i+1]

        if d["A"]*d["B"]*d["C"]:
            temp = [d[l1], d[r1]]
            max_val = max(temp)
            max_index = temp.index(max_val)
            
            if max_index == 0:
                ans.append(r1)
                d[l1] -= 1
                d[r1] += 1
            else:
                ans.append(l1)
                d[l1] += 1
                d[r1] -= 1
        else:
            if d[l1] * d[r1]:
                for c in [l1, r1]:
                    if [l1, r1, l2, r2].count(c) == 1:
                        d[c] -= 1
                    else:
                        ans.append(c)
                        d[c] += 1
            else:
                temp = [d[l1], d[r1]]
                max_val = max(temp)
                max_index = temp.index(max_val)
            
                if max_index == 0:
                    ans.append(r1)
                    d[l1] -= 1
                    d[r1] += 1
                else:
                    ans.append(l1)
                    d[l1] += 1
                    d[r1] -= 1

    l1, r1 = s[N-1]
    temp = [d[l1], d[r1]]
    max_val = max(temp)
    max_index = temp.index(max_val)
            
    if max_index == 0:
        ans.append(r1)
        d[l1] -= 1
        d[r1] += 1
    else:
        ans.append(l1)
        d[l1] += 1
        d[r1] -= 1

    if any([d[c] < 0 for c in "ABC"]):
            print("No")
    else:
        print("Yes")
        print(*ans, sep="\n")

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
from sys import stdin

import time
def dprint(*args):
    #print(*args)
    pass


n, a, b, c = [int(x) for x in stdin.readline().rstrip().split()]
ans = "Yes"

card = []
sentaku = []

for i in range(n):
    s = stdin.readline().rstrip()
    card.append(s)

if a+b+c == 0:
    ans = "No"

nums = {"A": a, "B": b, "C": c}


def judge(i, j, k):
    global ans
    dprint(n, i, j, k, ans, nums, sentaku)
    if nums[j] == 0 and nums[k] == 0:
        ans = "No"
        return

    if nums[j] == 0:
        nums[j] += 1
        nums[k] -= 1
        sentaku.append(j)
        return
    if nums[k] == 0:
        nums[k] += 1
        nums[j] -= 1
        sentaku.append(k)
        return

    total = sum(nums.values())
    if total > 2 or i == n-1:
        nums[j] += 1
        nums[k] -= 1
        sentaku.append(j)
        dprint("tekitou")
        return

    ns = card[i+1]
    if ns[0] == j or ns[1] == j:
        nums[j] += 1
        nums[k] -= 1
        sentaku.append(j)
        return
    else:
        nums[k] += 1
        nums[j] -= 1
        sentaku.append(k)
        return
    pass


for i in range(n):
    s = card[i]
    judge(i, s[0], s[1])


print(ans)

if ans == "Yes":
    for i in range(len(sentaku)):
        print(sentaku[i])

Submission status: Wrong Answer

Solution code:
from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
    if(a%b==0):return(b)
    return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
N,A,B,C=map(int,input().split())
S=[input() for i in range(N)]
idleA=10**20
idleB=10**10
idleC=1
stack=[[A,B,C]]
lst={}
dp=[{} for i in range(N)]

def main(n,a,b,c):

    if not a in dp[n]:
        dp[n][a]={}
    if not b in dp[n][a]:
        dp[n][a][b]={}
    if not c in dp[n][a][b]:
        dp[n][a][b][c]=""
    if not dp[n][a][b][c]:
        return(False)
    return(True)

for n in range(N):
    s=S[n]
    #nlst=set()
    nstack=[]
    while stack:
        #print(stack)
        a,b,c=stack.pop()
        if s=="AB":
            if a>0 and not main(n,a-1,b+1,c):
                dp[n][a-1][b+1][c]="B"
                nstack.append([a-1,b+1,c])
            if b>0 and not main(n,a+1,b-1,c):
                dp[n][a+1][b-1][c]="A"
                nstack.append([a+1,b-1,c])
        elif s=="BC":
            if c>0 and not main(n,a,b+1,c-1):
                dp[n][a][b+1][c-1]="B"
                nstack.append([a,b+1,c-1])
            if b>0 and not main(n,a,b-1,c+1):
                dp[n][a][b-1][c+1]="C"
                nstack.append([a,b-1,c+1])
        elif s=="AC":
            if a>0 and not main(n,a-1,b,c+1):
                dp[n][a-1][b][c+1]="C"
                nstack.append([a-1,b,c+1])
            if c>0 and not main(n,a+1,b,c-1):
                dp[n][a+1][b][c-1]="A"
                nstack.append([a+1,b,c-1])

    stack=nstack
if nstack:
    print("Yes")
    lst=[]
    a,b,c=nstack.pop()
    lst.append([dp[n][a][b][c],a,b,c])
    for n in range(N-1)[::-1]:
        s=S[n+1]
        X,a,b,c=lst[-1]
        if s=="AB":
            if  main(n,a-1,b+1,c):
                lst.append([dp[n][a-1][b+1][c],a-1,b+1,c])
                continue
            if  main(n,a+1,b-1,c):
                lst.append([dp[n][a+1][b-1][c],a+1,b-1,c])
                continue
        if s=="BC":
            if  main(n,a,b+1,c-1):
                lst.append([dp[n][a][b+1][c-1],a,b+1,c-1])
                continue
            if  main(n,a,b-1,c+1):
                lst.append([dp[n][a][b-1][c+1],a,b-1,c+1])
                continue
        if s=="AC":
            if  main(n,a-1,b,c+1):
                lst.append([dp[n][a-1][b][c+1],a-1,b,c+1])
                continue
            if  main(n,a+1,b,c-1):
                lst.append([dp[n][a+1][b][c-1],a+1,b,c-1])
                continue
        #print("a")
    for X,a,b,c in list(reversed(lst)):
        print(X)
else:
    print("No")

Submission status: Wrong Answer

Solution code:
X={}
N,X['A'],X['B'],X['C']=[int(x) for x in input().split()]
seq=[]
for _ in range(N):
  s=input()
  b=X[s[0]]<X[s[1]]
  d=1 if b else -1
  X[s[0]]+=d
  X[s[1]]-=d
  if b:
    seq.append(s[0])
  else:
    seq.append(s[1])
  if X[s[0]] < 0 or X[s[1]] < 0:
    print('No')
    exit()
print('Yes')
for c in seq:
  print(c)

Submission status: Wrong Answer

Solution code:
from heapq import *
import sys
from collections import *
from itertools import *
from decimal import *
import copy
from bisect import *
import math
sys.setrecursionlimit(4100000)
def gcd(a,b):
    if(a%b==0):return(b)
    return (gcd(b,a%b))
input=lambda :sys.stdin.readline().rstrip()
N,A,B,C=map(int,input().split())
S=[input() for i in range(N)]
idleA=10**20
idleB=10**10
idleC=1
stack=[[A,B,C]]
lst={}
dp=[{} for i in range(N)]

def main(n,a,b,c):

    if not a in dp[n]:
        dp[n][a]={}
    if not b in dp[n][a]:
        dp[n][a][b]={}
    if not c in dp[n][a][b]:
        dp[n][a][b][c]=""
    if not dp[n][a][b][c]:
        return(False)
    return(True)

for n in range(N):
    s=S[n]
    #nlst=set()
    nstack=[]
    while stack:
        #print(stack)
        a,b,c=stack.pop()
        if s=="AB":
            if a>=1 and not main(n,a-1,b+1,c):
                dp[n][a-1][b+1][c]="B"
                nstack.append([a-1,b+1,c])
            if b>=1 and not main(n,a+1,b-1,c):
                dp[n][a+1][b-1][c]="A"
                nstack.append([a+1,b-1,c])
        elif s=="BC":
            if c>=1 and not main(n,a,b+1,c-1):
                dp[n][a][b+1][c-1]="B"
                nstack.append([a,b+1,c-1])
            if b>=1 and not main(n,a,b-1,c+1):
                dp[n][a][b-1][c+1]="C"
                nstack.append([a,b-1,c+1])
        elif s=="AC":
            if a>=1 and not main(n,a-1,b,c+1):
                dp[n][a-1][b][c+1]="C"
                nstack.append([a-1,b,c+1])
            if c>=1 and not main(n,a+1,b,c-1):
                dp[n][a+1][b][c-1]="A"
                nstack.append([a+1,b,c-1])

    stack=nstack
if dp[-1]:
    print("Yes")
    lst=[]
    flag=0
    for a in dp[-1]:
        for b in dp[-1][a]:
            for c in dp[-1][a][b]:
                X=dp[-1][a][b][c]
                if X:
                    lst.append([X,a,b,c])
                    flag=1
                    break
            if flag:
                break
        if flag:
            break
    for n in range(N-1)[::-1]:
        s=S[n+1]
        X,a,b,c=lst[-1]
        if s=="AB":
            if  main(n,a-1,b+1,c):
                lst.append([dp[n][a-1][b+1][c],a-1,b+1,c])
                continue
            if  main(n,a+1,b-1,c):
                lst.append([dp[n][a+1][b-1][c],a+1,b-1,c])
                continue
        if s=="BC":
            if  main(n,a,b+1,c-1):
                lst.append([dp[n][a][b+1][c-1],a,b+1,c-1])
                continue
            if  main(n,a,b-1,c+1):
                lst.append([dp[n][a][b-1][c+1],a,b-1,c+1])
                continue
        if s=="AC":
            if  main(n,a-1,b,c+1):
                lst.append([dp[n][a-1][b][c+1],a-1,b,c+1])
                continue
            if  main(n,a+1,b,c-1):
                lst.append([dp[n][a+1][b][c-1],a+1,b,c-1])
                continue
        #print("a")
    for X,a,b,c in list(reversed(lst)):
        print(X)
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
def input() : return sys.stdin.readline().strip()

def main():
    N, A, B, C = map(int, input().split())
    s = tuple(input() for _ in range(N))
    d = {}
    d["A"] = A
    d["B"] = B
    d["C"] = C
    ans = []
    for i in range(N-1):
        l1, r1 = s[i]
        l2, r2 = s[i+1]

        if l1 == l2 and r1 == r2:
            temp = [d[l1], d[r1]]
            max_val = max(temp)
            max_index = temp.index(max_val)
            
            if max_index == 0:
                ans.append(r1)
                d[l1] -= 1
                d[r1] += 1
            else:
                ans.append(l1)
                d[l1] += 1
                d[r1] -= 1
        else:
            for c in [l1, r1]:
                if [l1, r1, l2, r2].count(c) == 2:
                    d[c] -= 1
                else:
                    ans.append(c)
                    d[c] += 1

    l1, r1 = s[N-1]
    temp = [d[l1], d[r1]]
    max_val = max(temp)
    max_index = temp.index(max_val)
            
    if max_index == 0:
        ans.append(r1)
        d[l1] -= 1
        d[r1] += 1
    else:
        ans.append(l1)
        d[l1] += 1
        d[r1] -= 1

    if any([d[c] < 0 for c in "ABC"]):
            print("No")
    else:
        print("Yes")
        print(*ans, sep="\n")

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:

si = lambda: input().strip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
msi = lambda: map(str, input().split())
lmii = lambda: list(map(int, input().split()))
lmsi = lambda: list(map(str, input().split()))
smii = lambda: sorted(map(int, input().split()))


# ----------

N, A, B, C = mii()
S = []
for i in range(N):
    S.append(si())

v = dict()
v['A'] = A
v['B'] = B
v['C'] = C

ans = []

for i in range(N):
    s1, s2 = list(S[i])
    # 両方0
    if v[s1] == v[s2] == 0:
        print('No')
        exit()
    # 片方0
    if v[s1] > 0 and v[s2] == 0:
        v[s1] -= 1
        v[s2] += 1
        ans.append(s2)
        continue
    if v[s1] == 0 and v[s2] > 0:
        v[s1] += 1
        v[s2] -= 1
        ans.append(s1)
        continue

    if i == N - 1:
        v[s1] += 1
        v[s2] -= 1
        ans.append(s1)
        continue

    if S[i] != S[i+1]:
        if s1 in S[i+1]:
            v[s1] += 1
            v[s2] -= 1
            ans.append(s1)
            continue

    v[s1] += 1
    v[s2] -= 1
    ans.append(s1)

print('Yes')
for a in ans:
    print(a)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

N,A,B,C = inputIL()
l = inputSLs(N)

if A+B+C == 0:
  print("No")
  exit()
  
n = len(l)


a = []

if A+B+C == 1:
  for item in l:
    if item == "AB":
      if A==B==0:
        print("No")
        exit()
      elif A==0:
        A += 1
        B -= 1
        a.append("A")
      else:
        A -= 1
        B += 1
        a.append("B")
    if item == "AC":
      if A==C==0:
        print("No")
        exit()
      elif A==0:
        A += 1
        C -= 1
        a.append("A")
      else:
        A -= 1
        C += 1
        a.append("C")
    if item == "BC":
      if B==C==0:
        print("No")
        exit()
      elif B==0:
        B += 1
        C -= 1
        a.append("B")
      else:
        B -= 1
        C += 1
        a.append("C")

if A+B+C == 2:
  for i in range(n):
    item = l[i]
    if item == "AB":
      if A==B==0:
        print("No")
        exit()
      elif A==0:
        A += 1
        B -= 1
        a.append("A")
      elif B==0:
        A -= 1
        B += 1
        a.append("B")
      elif C==0 and i!=n-1:
        nitem = l[i+1]
        if nitem == "AB":
          A += 1
          B -= 1
          a.append("A")
        if nitem == "AC":
          A += 1
          B -= 1
          a.append("A")
        if nitem == "BC":
          A -= 1
          B += 1
          a.append("B")
      else:
        if A<B:
          A += 1
          B -= 1
          a.append("A")
        else:
          A -= 1
          B += 1
          a.append("B")          
        
    if item == "AC":
      if A==C==0:
        print("No")
        exit()
      elif A==0:
        A += 1
        C -= 1
        a.append("A")
      elif C==0:
        A -= 1
        C += 1
        a.append("C")
      elif B==0 and i!=n-1:
        nitem = l[i+1]
        if nitem == "AC":
          A += 1
          C -= 1
          a.append("A")
        if nitem == "AB":
          A += 1
          C -= 1
          a.append("A")
        if nitem == "BC":
          A -= 1
          C += 1
          a.append("C")
      else:
        if A<C:
          A += 1
          C -= 1
          a.append("A")
        else:
          A -= 1
          C += 1
          a.append("C")  

        
    if item == "BC":
      if B==C==0:
        print("No")
        exit()
      elif B==0:
        B += 1
        C -= 1
        a.append("B")
      elif C==0:
        B -= 1
        C += 1
        a.append("C")
      elif A==0 and i!=n-1:
        nitem = l[i+1]
        if nitem == "BC":
          B += 1
          C -= 1
          a.append("B")
        if nitem == "AB":
          B += 1
          C -= 1
          a.append("B")
        if nitem == "AC":
          B -= 1
          C += 1
          a.append("C")
      else:
        if B<C:
          B += 1
          C -= 1
          a.append("B")
        else:
          B -= 1
          C += 1
          a.append("C")  
        


        
print("Yes")
for item in a:
  print(item)