Codeforces Round #616 (Div. 2)

Codeforces Round #616 (Div. 2)

A. Even But Not Even

#include <bits/stdc++.h>

#define int long long
using namespace std;

int const MAXN = 2e5 + 10;
int n, m, T;

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> T;
    while(T--) {
        cin >> n;
        string s;
        cin >> s;
        int len = -1;
        for (int i = s.size(); i >= 0; --i) {
            if ((s[i] - '0') & 1) {
                len = i;
                break;
            }
        }
        if (len == -1) {
            cout << len << endl;
            continue;
        }
        int cnt = 0;
        for (int i = 0; i <= len; ++i) {
            if ((s[i] - '0') & 1) cnt++;
        }
        if (cnt % 2 == 0) {
            for (int i = 0; i <= len; ++i) cout << s[i];
            cout << endl;
        }
        else {
            int pos = len;
            for (int i = len - 1; i >= 0; --i) {
                if ((s[i] - '0') & 1) {
                    pos = i;
                    break;
                }
            }
            if (pos == len) {
                cout << -1 << endl;
                continue;
            }
            for (int i = 0; i <= len; ++i) {
                if (i == pos) continue;
                cout << s[i];
            }
            cout << endl;
        }
    }
    return 0;
}

B. Array Sharpening

#include <bits/stdc++.h>

#define int long long
using namespace std;

int const MAXN = 3e5 + 10;
int n, m, T, a[MAXN], l[MAXN], r[MAXN];

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> T;
    while (T--) {
        cin >> n;
        for (int i = 0; i < n; ++i) cin >> a[i], l[i] = r[i] = 0;
        for (int i = 0; i < n; ++i) {
            if (a[i] >= i) {
                if (i > 0)
                    l[i] = 1 & l[i - 1];
                else
                    l[i] = 1;
            }
        }
        for (int i = n - 1; i >= 0; --i) {
            if (a[i] >= n - i - 1) {
                if (i < n - 1)
                    r[i] = 1 & r[i + 1];
                else
                    r[i] = 1;
            }
        }
        int flg = 0;
        for (int i = 0; i < n; ++i) {
            if (l[i] == 1 && r[i] == 1) flg = 1;
        }
        if (flg)
            cout << "Yes\n";
        else
            cout << "No\n";
    }
    return 0;
}

C. Mind Control

#include <bits/stdc++.h>

#define int long long
using namespace std;

int const MAXN = 2e5 + 10;
int n, m, T, a[MAXN];

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> T;
    while(T--) {
        int m, k;
        cin >> n >> m >> k;
        for (int i = 0; i < n; ++i) cin >> a[i];
        k = min(m - 1, k);
        int res = 0;
        for (int i = 0; i <= k; ++i) {
            int tmp = 1e9;
            for (int j = 0; j < m - k; ++j) {
                tmp = min(tmp, max(a[i + j], a[n - 1 - (k - i) - (m - k - j - 1)]));
            }
            res = max(res, tmp);
        }
        cout << res << endl;
    }   
    return 0;
}

D. Irreducible Anagrams