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:
n, a, b, c = map(int, input().split())
s = [input() for i in range(n)]
log = []

def end():
    print("No")
    exit()

def under_zero(x):
    if x < 0:
        return True
    else:
        return False

def solve(i,a,b,c):

    if s[i] == "AB":
        # コーナーケース
        if a == 1 and b == 1:
            # aが重複 最後はどっちでもいいので
            if i == n-1 or s[i+1] == "AB" or s[i+1] == 'AC':
                a += 1
                b -= 1
                log.append("A")
            # Bが重複
            else:# "BC"
                a -= 1
                b += 1
                log.append("B")
        elif a == 0 and b == 0:
            end()
        else:
            if a>=b:
                a -= 1
                b += 1
                log.append("B")
            else:
                a += 1
                b -= 1
                log.append("A")

    elif s[i] == "AC":
        # コーナーケース
        if a == 1 and c == 1:
            # aが重複
            if i == n-1 or s[i+1] == "AC" or s[i+1] == 'AB':
                a += 1
                c -= 1
                log.append("A")
            # Cが重複
            else:# "BC"
                c += 1
                a -= 1
                log.append("C")
        elif a == 0 and b == 0:
            end()
        else:
            if a>=c:
                a -= 1
                c += 1
                log.append("C")
            else:
                a += 1
                c -= 1
                log.append("A")

    else:#BC
        # コーナーケース
        if c == 1 and b == 1:
            # Bが重複
            if i == n-1 or  s[i+1] == "BC" or s[i+1] == 'AB':
                c -= 1
                b += 1
                log.append("B")
            # Cが重複
            else:# "AC"
                c += 1
                b -= 1
                log.append("C")

        elif a == 0 and b == 0:
            end()

        else:
            if b>=c:
                b -= 1
                c += 1
                log.append("C")
            else:
                b += 1
                c -= 1
                log.append("B")


for i in range(n):
        solve(i,a,b,c)
else:
    print("Yes")
    print(*log, sep='\n')

Submission status: Wrong Answer

Solution code:
# A B C
# 1 1 1
# 2 0 1
# 2 1 0
# 1 2 1
# それぞれ1以上の場合は問題ない
# 2人以上が1以上の場合はok
# では2人以上が0の場合は？
# 1 1 0 
# 0 1 1 C
# 1 0 1 A


# 合計が0の場合
# A B C
# 0 0 0

# 合計が1の場合
# A B C
# 1 0 0
# 0 1 0 AB => B
# 0 1 0 AC => No
# ==> sによる

# 合計が2の場合
# A B C
# 2 0 0
# 1 1 0 AB => B
# 0 1 1 AC => C
# 初回で0の組み合わせが選択されなければYes

# 合計が3以上の場合も同様に、初回で2つ以上が0でなければYesになる

from typing import Tuple, List, Optional

def play(N: int, A: int, B: int, C: int, s_arr: List[str]) -> Tuple[bool, Optional[List[str]]]:
    strategies = []
    v_dict = {'A': A, 'B': B, 'C': C}

    if A + B + C == 0:
        return (False, None)
    
    elif A + B + C == 1:
        prime = 'A' if A else 'B' if B else 'C'

        for s in s_arr:
            if prime in s:
                prime = s.replace(prime, '')
                strategies.append(prime)
            else:
                return (False, None)

    else:
        # 1 1 0 AB => B
        # 0 2 0 AC => No
        # 次のターンの文字列を見る
        # 1 1 0 AB => C
        # 0 1 1 AC => A
        for n in range(N):
            s = s_arr[n]
            if len(list(filter(lambda c: v_dict[c] == 0, s))) == 2:
                return (False, None)
            else:
                n, m = v_dict[s[0]], v_dict[s[1]]
                if n < m:
                    v_dict[s[0]] += 1
                    v_dict[s[1]] -= 1
                    strategies.append(s[0])
                elif n > m:
                    v_dict[s[0]] -= 1
                    v_dict[s[1]] += 1
                    strategies.append(s[1])                
                elif n < N - 1 and n == m and s[0] in s_arr[n+1]:
                    v_dict[s[0]] += 1
                    v_dict[s[1]] -= 1
                    strategies.append(s[0])
                elif n < N - 1 and n == m and s[1] in s_arr[n+1]:
                    v_dict[s[0]] -= 1
                    v_dict[s[1]] += 1
                    strategies.append(s[1])
                else:
                    v_dict[s[0]] -= 1
                    v_dict[s[1]] += 1
                    strategies.append(s[1])


    return (True, strategies)


if __name__ == '__main__':
    N, A, B, C = map(int, input().split())
    s = [input() for _ in range(N)]

    result, strategy = play(N, A, B, C, s)
    if result:
        print('Yes')
        print('\n'.join(strategy))
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
n, a, b, c = map(int, input().split())
s = [input() for i in range(n)]
log = []

def end():
    print("No")
    exit()

def under_zero(x):
    if x < 0:
        return True
    else:
        return False

def solve(i,a,b,c):

    if s[i] == "AB":
        # コーナーケース
        if a == 1 and b == 1:
            # aが重複 最後はどっちでもいいので
            if i == n-1 or s[i+1] == "AB" or s[i+1] == 'AC':
                a += 1
                b -= 1
                log.append("A")
            # Bが重複
            else:# "BC"
                a -= 1
                b += 1
                log.append("B")
        else:
            if a>=b:
                a -= 1
                b += 1
                log.append("B")
                if under_zero(a):
                    end()
            else:
                a += 1
                b -= 1
                log.append("A")
                if under_zero(b):
                    end()
    elif s[i] == "AC":
        # コーナーケース
        if a == 1 and c == 1:
            # aが重複
            if i == n-1 or s[i+1] == "AC" or s[i+1] == 'AB':
                a += 1
                c -= 1
                log.append("A")
            # Cが重複
            else:# "BC"
                c += 1
                a -= 1
                log.append("C")
        else:
            if a>=c:
                a -= 1
                c += 1
                log.append("C")
                if under_zero(a):
                    end()
            else:
                a += 1
                c -= 1
                log.append("A")
                if under_zero(c):
                    end()
    else:
        # コーナーケース
        if c == 1 and b == 1:
            # Bが重複
            if i == n-1 or  s[i+1] == "BC" or s[i+1] == 'AB':
                c -= 1
                b += 1
                log.append("B")
            # Cが重複
            else:# "AC"
                c += 1
                b -= 1
                log.append("C")
        else:
            if b>=c:
                b -= 1
                c += 1
                log.append("C")
                if under_zero(b):
                    end()
            else:
                b += 1
                c -= 1
                log.append("B")
                if under_zero(c):
                    end()

for i in range(n):
        solve(i,a,b,c)
else:
    print("Yes")
    print(*log, sep='\n')

Submission status: Wrong Answer

Solution code:
n, a, b, c = map(int, input().split())
s = [input() for i in range(n)]
log = []

def end():
    print("No")
    exit()

def under_zero(x):
    if x < 0:
        return True
    else:
        return False

def solve(i,a,b,c):


    if s[i] == "AB":
        # コーナーケース
        if a == 1 and b == 1:
            # aが重複 最後はどっちでもいいので
            if i == n-1 or s[i+1] == "AB" or s[i+1] == 'AC':
                a += 1
                b -= 1
                log.append("A")
            # Bが重複
            else:# "BC"
                a -= 1
                b += 1
                log.append("B")
        else:
            if a>=b:
                a -= 1
                b += 1
                log.append("B")
                if under_zero(a):
                    end()
            else:
                a += 1
                b -= 1
                log.append("A")
                if under_zero(b):
                    end()
    elif s[i] == "AC":
        # コーナーケース
        if a == 1 and c == 1:
            # cが重複
            if i == n-1 or s[i+1] == "AC" or s[i+1] == 'BC':
                c += 1
                a -= 1
                log.append("C")
            # Aが重複
            else:# "AB"
                c -= 1
                a += 1
                log.append("A")
        else:
            if a>=c:
                a -= 1
                c += 1
                log.append("C")
                if under_zero(a):
                    end()
            else:
                a += 1
                c -= 1
                log.append("A")
                if under_zero(c):
                    end()
    else:
        # コーナーケース
        if c == 1 and b == 1:
            # Bが重複
            if i == n-1 or  s[i+1] == "BC" or s[i+1] == 'AB':
                c -= 1
                b += 1
                log.append("B")
            # Cが重複
            else:# "AC"
                c += 1
                b -= 1
                log.append("C")
        else:
            if b>=c:
                b -= 1
                c += 1
                log.append("C")
                if under_zero(b):
                    end()
            else:
                b += 1
                c -= 1
                log.append("B")
                if under_zero(c):
                    end()

for i in range(n):
        solve(i,a,b,c)
else:
    print("Yes")
    print(*log, sep='\n')

Submission status: Wrong Answer

Solution code:
# A B C
# 1 1 1
# 2 0 1
# 2 1 0
# 1 2 1
# それぞれ1以上の場合は問題ない
# 2人以上が1以上の場合はok
# では2人以上が0の場合は？
# 1 1 0 
# 0 1 1 C
# 1 0 1 A


# 合計が0の場合
# A B C
# 0 0 0

# 合計が1の場合
# A B C
# 1 0 0
# 0 1 0 AB => B
# 0 1 0 AC => No
# ==> sによる

# 合計が2の場合
# A B C
# 2 0 0
# 1 1 0 AB => B
# 0 1 1 AC => C
# 初回で0の組み合わせが選択されなければYes

# 合計が3以上の場合も同様に、初回で2つ以上が0でなければYesになる

from typing import Tuple, List, Optional

def play(N: int, A: int, B: int, C: int, s_arr: List[str]) -> Tuple[bool, Optional[List[str]]]:
    strategies = []
    v_dict = {'A': A, 'B': B, 'C': C}

    if A + B + C == 0:
        return (False, None)
    
    elif A + B + C == 1:
        prime = 'A' if A else 'B' if B else 'C'

        for s in s_arr:
            if prime in s:
                prime = s.replace(prime, '')
                strategies.append(prime)
            else:
                return (False, None)

    else:
        # 1 1 0 AB => B
        # 0 2 0 AC => No
        # 次のターンの文字列を見る
        # 1 1 0 AB => C
        # 0 1 1 AC => A
        for n in range(N):
            s = s_arr[n]
            if len(list(filter(lambda c: v_dict[c] == 0, s))) == 2:
                return (False, None)
            else:
                n, m = v_dict[s[0]], v_dict[s[1]]
                if n < m:
                    v_dict[s[0]] += 1
                    v_dict[s[1]] -= 1
                    strategies.append(s[0])
                elif n > m:
                    v_dict[s[0]] -= 1
                    v_dict[s[1]] += 1
                    strategies.append(s[1])                
                elif n < N - 1 and s[0] in s_arr[n+1]:
                    v_dict[s[0]] += 1
                    v_dict[s[1]] -= 1
                    strategies.append(s[0])
                elif n < N - 1 and s[1] in s_arr[n+1]:
                    v_dict[s[0]] -= 1
                    v_dict[s[1]] += 1
                    strategies.append(s[1])
                else:
                    v_dict[s[0]] -= 1
                    v_dict[s[1]] += 1
                    strategies.append(s[1])


    return (True, strategies)


if __name__ == '__main__':
    N, A, B, C = map(int, input().split())
    s = [input() for _ in range(N)]

    result, strategy = play(N, A, B, C, s)
    if result:
        print('Yes')
        print('\n'.join(strategy))
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
# A B C
# 1 1 1
# 2 0 1
# 2 1 0
# 1 2 1
# それぞれ1以上の場合は問題ない
# 2人以上が1以上の場合はok
# では2人以上が0の場合は？
# 1 1 0 
# 0 1 1 C
# 1 0 1 A


# 合計が0の場合
# A B C
# 0 0 0

# 合計が1の場合
# A B C
# 1 0 0
# 0 1 0 AB => B
# 0 1 0 AC => No
# ==> sによる

# 合計が2の場合
# A B C
# 2 0 0
# 1 1 0 AB => B
# 0 1 1 AC => C
# 初回で0の組み合わせが選択されなければYes

# 合計が3以上の場合も同様に、初回で2つ以上が0でなければYesになる

from typing import Tuple, List, Optional

def play(N: int, A: int, B: int, C: int, s_arr: List[str]) -> Tuple[bool, Optional[List[str]]]:
    strategies = []
    v_dict = {'A': A, 'B': B, 'C': C}

    if A + B + C == 0:
        return (False, None)
    
    elif A + B + C == 1:
        prime = 'A' if A else 'B' if B else 'C'

        for s in s_arr:
            if prime in s:
                prime = s.replace(prime, '')
                strategies.append(prime)
            else:
                return (False, None)

    else:
        # 1 1 0 AB => B
        # 0 2 0 AC => No
        # 次のターンの文字列を見る
        # 1 1 0 AB => C
        # 0 1 1 AC => A
        for n in range(N):
            s = s_arr[n]
            if len(list(filter(lambda c: v_dict[c] == 0, s))) == 2:
                return (False, None)
            else:
                n, m = v_dict[s[0]], v_dict[s[1]]
                if n < m:
                    v_dict[s[0]] += 1
                    v_dict[s[1]] -= 1
                    strategies.append(s[0])
                elif n < N - 1 and s[0] in s_arr[n+1]:
                    v_dict[s[0]] += 1
                    v_dict[s[1]] -= 1
                    strategies.append(s[0])
                elif n < N - 1 and s[1] in s_arr[n+1]:
                    v_dict[s[0]] -= 1
                    v_dict[s[1]] += 1
                    strategies.append(s[1])
                else:
                    v_dict[s[0]] -= 1
                    v_dict[s[1]] += 1
                    strategies.append(s[1])


    return (True, strategies)


if __name__ == '__main__':
    N, A, B, C = map(int, input().split())
    s = [input() for _ in range(N)]

    result, strategy = play(N, A, B, C, s)
    if result:
        print('Yes')
        print('\n'.join(strategy))
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
from bisect import bisect_left, bisect_right

INF = float("inf")
n, *s = map(int, input().split())
toidx = {"AB": (0, 1), "BC": (1, 2), "AC": (0, 2)}
toalp = lambda x: chr(ord("A") + x)
m = sum(s)
q = [toidx[input()] for _ in range(n)]

def solve():
    res = []
    if m == 0 or (not s[q[0][0]] and not s[q[0][1]]):
        print("No")
        return
    elif m == 1:
        for i, j in q:
            if not s[i] and not s[j]:
                print("No")
                return
            elif s[i]:
                s[j] += 1; s[i] -= 1
                res.append(toalp(j))
            elif s[j]:
                s[i] += 1; s[j] -= 1
                res.append(toalp(i))
    elif m == 2:
        d = {(0, 1): [], (0, 2): [], (1, 2): []}
        for i in range(n): d[q[i]].append(i)
        for key in d.keys(): d[key].append(INF)
        for idx, (i, j) in enumerate(q):
            if s[i] and s[j]:
                k = [x for x in range(3) if i != x and j != x][0]
                i, k = sorted([i, k])
                j, k = sorted([j, k])
                nik = d[(i, k)][bisect_left(d[(i, k)], idx)]
                njk = d[(j, k)][bisect_left(d[(j, k)], idx)]
                if nik <= njk:
                    s[i] += 1; s[j] -= 1
                    res.append(toalp(i))
                else: 
                    s[j] += 1; s[i] -= 1
                    res.append(toalp(j))
            elif s[i]:
                s[j] += 1; s[i] -= 1
                res.append(toalp(j))
            elif s[j]:
                s[i] += 1; s[j] -= 1
                res.append(toalp(i))
    else:
        for i, j in q:
            if s[i] >= s[j]:
                s[j] += 1; s[i] -= 1
                res.append(toalp(j))
            else:
                s[i] += 1; s[j] -= 1
                res.append(toalp(i))
    print("Yes")
    print(*res, sep="\n")

solve()

Submission status: Wrong Answer

Solution code:
n, a, b, c = map(int, input().split())
s = [input() for i in range(n)]
log = []

def end():
    print("No")
    exit()

def under_zero(x):
    if x < 0:
        return True
    else:
        return False

def solve(i,a,b,c):


    if s[i] == "AB":
        # コーナーケース
        if a == 1 and b == 1:
            # aが重複 最後はどっちでもいいので
            if i == n-1 or s[i+1] == "AB" or s[i+1] == 'AC':
                a += 1
                b -= 1
                log.append("A")
            # Bが重複
            else:# "BC"
                a -= 1
                b += 1
                log.append("B")
        else:
            if a>=b:
                a -= 1
                b += 1
                log.append("B")
                if under_zero(a):
                    return end()
            else:
                a += 1
                b -= 1
                log.append("A")
                if under_zero(b):
                    return end()
    elif s[i] == "AC":
        # コーナーケース
        if a == 1 and c == 1:
            # cが重複
            if i == n-1 or s[i+1] == "AB" or s[i+1] == 'BC':
                c -= 1
                b += 1
                log.append("B")
            # Bが重複
            else:# "AB"
                c += 1
                b -= 1
                log.append("C")
        else:
            if a>=c:
                a -= 1
                c += 1
                log.append("C")
                if under_zero(a):
                    return end()
            else:
                a += 1
                c -= 1
                log.append("A")
                if under_zero(c):
                    return end()
    else:
        # コーナーケース
        if c == 1 and b == 1:
            # cが重複
            if i == n-1 or  s[i+1] == "BC" or s[i+1] == 'AC':
                c += 1
                b -= 1
                log.append("C")
            # Bが重複
            else:# "BC"
                c -= 1
                b += 1
                log.append("B")
        else:
            if b>=c:
                b -= 1
                c += 1
                log.append("C")
                if under_zero(b):
                    return end()
            else:
                b += 1
                c -= 1
                log.append("B")
                if under_zero(c):
                    return end()

for i in range(n):
        solve(i,a,b,c)
else:
    print("Yes")
    print(*log, sep='\n')

Submission status: Wrong Answer

Solution code:
# A B C
# 1 1 1
# 2 0 1
# 2 1 0
# 1 2 1
# それぞれ1以上の場合は問題ない
# 2人以上が1以上の場合はok
# では2人以上が0の場合は？
# 1 1 0 
# 0 1 1 C
# 1 0 1 A


# 合計が0の場合
# A B C
# 0 0 0

# 合計が1の場合
# A B C
# 1 0 0
# 0 1 0 AB => B
# 0 1 0 AC => No
# ==> sによる

# 合計が2の場合
# A B C
# 2 0 0
# 1 1 0 AB => B
# 0 1 1 AC => C
# 初回で0の組み合わせが選択されなければYes

# 合計が3以上の場合も同様に、初回で2つ以上が0でなければYesになる

from typing import Tuple, List, Optional

def play(N: int, A: int, B: int, C: int, s_arr: List[str]) -> Tuple[bool, Optional[List[str]]]:
    strategies = []
    v_dict = {'A': A, 'B': B, 'C': C}

    if A + B + C == 0:
        return (False, None)
    
    elif A + B + C == 1:
        prime = 'A' if A else 'B' if B else 'C'

        for s in s_arr:
            if prime in s:
                prime = s.replace(prime, '')
                strategies.append(prime)
            else:
                return (False, None)

    else:
        for s in s_arr:
            if len(list(filter(lambda c: v_dict[c] == 0, s))) == 2:
                return (False, None)
            else:
                n, m = v_dict[s[0]], v_dict[s[1]]
                if n < m:
                    v_dict[s[0]] += 1
                    v_dict[s[1]] -= 1
                    strategies.append(s[0])
                else:
                    v_dict[s[0]] -= 1
                    v_dict[s[1]] += 1
                    strategies.append(s[1])

    return (True, strategies)


if __name__ == '__main__':
    N, A, B, C = map(int, input().split())
    s = [input() for _ in range(N)]

    result, strategy = play(N, A, B, C, s)
    if result:
        print('Yes')
        print('\n'.join(strategy))
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
# A B C
# 1 1 1
# 2 0 1
# 2 1 0
# 1 2 1
# それぞれ1以上の場合は問題ない
# 2人以上が1以上の場合はok
# では2人以上が0の場合は？
# 1 1 0 
# 0 1 1 C
# 1 0 1 A


# 合計が0の場合
# A B C
# 0 0 0

# 合計が1の場合
# A B C
# 1 0 0
# 0 1 0 AB => B
# 0 1 0 AC => No
# ==> sによる

# 合計が2の場合
# A B C
# 2 0 0
# 1 1 0 AB => B
# 0 1 1 AC => C
# 初回で0の組み合わせが選択されなければYes

# 合計が3以上の場合も同様に、初回で2つ以上が0でなければYesになる

from typing import Tuple, List

def play(N: int, A: int, B: int, C: int, s_arr: List[str]) -> Tuple[bool, List[str]]:
    result = []
    v_dict = {'A': A, 'B': B, 'C': C}

    if A + B + C == 0:
        return (False, [])
    
    elif A + B + C == 1:
        prime = None
        if A == 1:
            prime = 'A'
        elif B == 1:
            prime = 'B'
        else:
            prime = 'C'

        for s in s_arr:
            if prime in s:
                prime = s.replace(prime, '')
                result.append(prime)
            else:
                return (False, [])

    else:
        for s in s_arr:
            # Input => 1 3 0
            # print(list(filter(lambda c: v_dict[c] == 0, s)))
            # for c in s:
            #     print('c:', c, v_dict[c])
            if len(list(filter(lambda c: v_dict[c] == 0, s))) == 2:
                return (False, [])
            else:
                n, m = v_dict[s[0]], v_dict[s[1]]
                if n < m:
                    v_dict[s[0]] += 1
                    v_dict[s[1]] -= 1
                    result.append(s[0])
                else:
                    v_dict[s[0]] -= 1
                    v_dict[s[1]] += 1
                    result.append(s[1])

    return (True, result)
            


if __name__ == '__main__':
    N, A, B, C = map(int, input().split())
    s = [input() for _ in range(N)]

    result, strategy = play(N, A, B, C, s)
    if result:
        print('Yes')
        print('\n'.join(strategy))
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
n, a, b, c = map(int, input().split())
s = [input() for i in range(n)]
log = []

def end():
    print("No")
    exit()

def under_zero(x):
    if x < 0:
        return True
    else:
        return False

def solve(i,a,b,c):


    if s[i] == "AB":
        # コーナーケース
        if a == 1 and b == 1:
            if i != n-1:
                # aが重複
                if s[i+1] == "AB" or s[i+1] == 'AC':
                    a += 1
                    b -= 1
                    log.append("A")
                # Bが重複
                else:# "BC"
                    a -= 1
                    b += 1
                    log.append("B")
        else:
            if a>=b:
                a -= 1
                b += 1
                log.append("B")
                if under_zero(a):
                    return end()
            else:
                a += 1
                b -= 1
                log.append("A")
                if under_zero(b):
                    return end()
    elif s[i] == "AC":
        # コーナーケース
        if a == 1 and c == 1:
            if i != n-1:
                # cが重複
                if s[i+1] == "AB" or s[i+1] == 'BC':
                    c -= 1
                    b += 1
                    log.append("B")
                # Bが重複
                else:# "AB"
                    c += 1
                    b -= 1
                    log.append("C")
        else:
            if a>=c:
                a -= 1
                c += 1
                log.append("C")
                if under_zero(a):
                    return end()
            else:
                a += 1
                c -= 1
                log.append("A")
                if under_zero(c):
                    return end()
    else:
        # コーナーケース
        if c == 1 and b == 1:
            if i != n-1:
                # cが重複
                if s[i+1] == "BC" or s[i+1] == 'AC':
                    c += 1
                    b -= 1
                    log.append("C")
                # Bが重複
                else:# "BC"
                    c -= 1
                    b += 1
                    log.append("B")
        else:
            if b>=c:
                b -= 1
                c += 1
                log.append("C")
                if under_zero(b):
                    return end()
            else:
                b += 1
                c -= 1
                log.append("B")
                if under_zero(c):
                    return end()

for i in range(n):
        solve(i,a,b,c)
else:
    print("Yes")
    print(*log, sep='\n')

Submission status: Wrong Answer

Solution code:
import dataclasses
n, a, b, c = list(map(int, input().split(" ")))
m = {"A": a, "B": b, "C": c}
h = ""
if sum(m.values()) == 0:
    print("No")
elif sum(m.values()) == 1:
    for i in range(n):
        x, y = input()
        if m[x] == 0 and m[y] == 0:
            print("No")
            break
        elif m[x] == 0:
            m[x] += 1
            m[y] -= 1
            h += x
        elif m[y] == 0:
            m[x] -= 1
            m[y] += 1
            h += y
    else:
        print("Yes")
        [print(i) for i in h]
else:
    inp = input()
    x, y = inp
    if m[x] == 0 and m[y] == 0:
        print("No")
    else:
        for i in range(n-1):
            next_inp = input()
            x, y = inp
            if m[x] == 0:
                m[x] += 1
                m[y] -= 1
                h += x
            elif m[y] == 0:
                m[x] -= 1
                m[y] += 1
                h += y
            elif m[x] == 1 and m[y] == 1:
                if x in next_inp:
                    m[x] += 1
                    m[y] -= 1
                    h += x
                else:
                    m[x] -= 1
                    m[y] += 1
                    h += y
            else:
                m[x] += 1
                m[y] -= 1
                h += x
            inp = next_inp
        x, y = inp
        if m[x] == 0:
            m[x] += 1
            m[y] -= 1
            h += x
        elif m[y] == 0:
            m[x] -= 1
            m[y] += 1
            h += y
        else:
            m[x] += 1
            m[y] -= 1
            h += x
        print("Yes")
        [print(i) for i in h]

Submission status: Wrong Answer

Solution code:
n,a,b,c=map(int,input().split())
s=[input() for _ in range(n)]
if a+b+c==0:
	print("No")
elif a+b+c==1:
	for x in s:
		if x=="AB":
			if a==b==0:
				print("No")
				exit()
			elif a==0:
				a+=1
				b-=1
			else:
				b+=1
				a-=1
		elif x=="BC":
			if b==c==0:
				print("No")
				exit()
			elif b==0:
				b+=1
				c-=1
			else:
				c+=1
				b-=1
		else:
			if c==a==0:
				print("No")
				exit()
			elif c==0:
				c+=1
				a-=1
			else:
				a+=1
				c-=1
else:
	if s[0]=="AB":
		if a==b==0:
			print("No")
		else:
			print("Yes")
	elif s[0]=="BC":
		if b==c==0:
			print("No")
		else:
			print("Yes")
	else:
		if c==a==0:
			print("No")
		else:
			print("Yes")

Submission status: Wrong Answer

Solution code:
import dataclasses
n, a, b, c = list(map(int, input().split(" ")))
m = {"A": a, "B": b, "C": c}
h = ""
inp = input()
for i in range(n-1):
    next_inp = input()
    if sum(m.values()) == 0:
        print("No")
        break
    else:
        x, y = inp
        if m[x] == 0 and m[y] == 0:
            print("No")
            break
        elif m[x] == 0:
            m[x] += 1
            m[y] -= 1
            h += x
        elif m[y] == 0:
            m[x] -= 1
            m[y] += 1
            h += y
        elif m[x] == 1 and m[y] == 1:
            xx, yy = next_inp
            if xx in inp:
                m[x] += 1
                m[y] -= 1
                h += x
            else:
                m[x] -= 1
                m[y] += 1
                h += y
        else:
            m[x] += 1
            m[y] -= 1
            h += x
    inp = next_inp
else:
    x, y = inp
    if sum(m.values()) == 0:
        print("No")
        h = 0
    if m[x] == 0 and m[y] == 0:
        print("No")
        h = 0
    elif m[x] == 0:
        m[x] += 1
        m[y] -= 1
        h += x
    elif m[y] == 0:
        m[x] -= 1
        m[y] += 1
        h += y
    else:
        m[x] += 1
        m[y] -= 1
        h += x
if h:
    print("Yes")
    [print(i) for i in h]

Submission status: Wrong Answer

Solution code:
import sys


N, A, B, C = map(int, input().split())
stock = [A, B, C]

s = [input().rstrip('\n') for _ in range(N)]
sum_num = sum(list([A, B, C]))
to_char = ["A","B","C"]

target = []
for i in range(N):
    if s[i] == "AB":
        target.append([0,1])
    elif s[i] == "BC":
        target.append([1,2])
    else:
        target.append([0,2])
if sum_num == 0:
    print("No")
    sys.exit()
elif sum_num == 1:
    answer = []
    for i in range(N):
        if stock[target[i][0]] == 1:
            stock[target[i][0]] -= 1
            stock[target[i][1]] += 1
            answer.append(target[i][1])
        elif stock[target[i][1]] == 1:
            stock[target[i][1]] -= 1
            stock[target[i][0]] += 1
            answer.append(target[i][0])
        else :
            print("No")
            sys.exit()
    print("Yes")
    for i in range(N):
        to_char[answer[i]]
elif sum_num >= 2:
    if stock[target[0][0]] == 0 and stock[target[0][1]] == 0:
        print("No")
        sys.exit()
    else:
        print("Yes")
        for i in range(N-1):
            if target[i][0] in target[i+1] and stock[target[i][1]] >= 1:
                stock[target[i][0]] += 1
                stock[target[i][1]] -= 1
                print(to_char[target[i][0]])
            elif stock[target[i][0]] >= 1:
                stock[target[i][1]] += 1
                stock[target[i][0]] -= 1
                print(to_char[target[i][1]])
            else:
                stock[target[i][0]] += 1
                stock[target[i][1]] -= 1
                print(to_char[target[i][0]])
        if stock[target[-1][0]] == 0:
            print(to_char[target[-1][0]])
        else:
            print(to_char[target[-1][1]])