1706A - Another String Minimization Problem - CodeForces Solution

2-sat constructive algorithms greedy string suffix structures strings *800

Please click on ads to support us..

Python Code: 

for _ in range(int(input())):
    n, m = map(int, input().split())
    an = list(map(int, input().split()))
    res = ['B' for _ in range(m)]
    for i in range(n):
        a, b = min(an[i]-1, m-an[i]), max(an[i]-1, m-an[i])
        if res[a] == 'B':
            res[a] = 'A'
        elif res[b] == 'B':
            res[b] = 'A'
    print("".join(i for i in res))

C++ Code: 

#include <iostream>
#include <queue>
#include <algorithm>

using namespace std;

int64_t mod = 1000000007;

int pos[50];
char s[51];

void solve()
{
    int n, m;

    cin >> n >> m;

    for (int i = 0; i < m; ++i)
    {
        pos[i] = 0;
    }

    int a;
    for (int i = 0; i < n; ++i)
    {
        cin >> a;
        a--;
        if (m-1-a < a)
        {
            a = m-1-a;
        }

        if (pos[a] == 0)
        {
            pos[a]++;
        }
        else
        {
            pos[m-1-a]++;
        }
    }

    for (int i = 0; i < m; ++i)
    {
        if (pos[i])
        {
            cout << "A";
        }
        else
        {
            cout << "B";
        }
    }

    cout << "\n";
}

int main()
{
    //freopen("input.txt", "r", stdin);
    int t = 1;

    cin >> t;

    for (int i = 0; i < t; ++i)
    {
        solve();
    }

    return 0;
}


Comments

Submit
0 Comments
More Questions

580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements
897. Increasing Order Search Tree
905. Sort Array By Parity
1351. Count Negative Numbers in a Sorted Matrix
617. Merge Two Binary Trees
1450. Number of Students Doing Homework at a Given Time
700. Search in a Binary Search Tree
590. N-ary Tree Postorder Traversal
589. N-ary Tree Preorder Traversal
1299. Replace Elements with Greatest Element on Right Side
1768. Merge Strings Alternately
561. Array Partition I
1374. Generate a String With Characters That Have Odd Counts