Codeforces Round 898 (Div. 4)

Codeforces Round 898 (Div. 4)

Codeforces Round 898 (Div. 4) A. Short Sort

import java.io.*;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int T = Integer.parseInt(bf.readLine());
        while (T-- > 0) {
            String str = bf.readLine();
            if (str.equals("abc") || str.equals("acb") || str.equals("bac") || str.equals("cba")) bw.write("YES\n");
            else bw.write("NO\n");
        }
        bw.close();
    }
}

Codeforces Round 898 (Div. 4) B. Good Kid

import java.io.*;
import java.util.ArrayList;
import java.util.Collections;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int T = Integer.parseInt(bf.readLine());
        while (T-- > 0) {
            int n = Integer.parseInt(bf.readLine());
            String[] str = bf.readLine().split(" ");
            ArrayList<Integer> arrayList = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                int x = Integer.parseInt(str[i]);
                arrayList.add(x);
            }
            Collections.sort(arrayList);
            arrayList.set(0, arrayList.get(0) + 1);
            int ans = 1;
            for (Integer x : arrayList) {
                ans *= x;
            }
            bw.write(ans + "\n");
        }
        bw.close();
    }
}

Codeforces Round 898 (Div. 4) C. Target Practice

import java.io.*;
import java.util.ArrayList;
import java.util.Collections;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int T = Integer.parseInt(bf.readLine());
        while (T-- > 0) {
            int ans = 0;
            for (int i = 0; i < 10; i++) {
                String str = bf.readLine();
                for (int j = 0; j < 10; j++) {
                    if (str.charAt(j) == 'X') {
                        ArrayList<Integer> arrayList = new ArrayList<>();
                        arrayList.add(i + 1);
                        arrayList.add(j + 1);
                        arrayList.add(10 - i);
                        arrayList.add(10 - j);
                        Collections.sort(arrayList);
                        ans += arrayList.get(0);
                    }
                }
            }
            bw.write(ans + "\n");
        }
        bw.close();
    }
}

Codeforces Round 898 (Div. 4) D. 1D Eraser

import java.io.*;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int T = Integer.parseInt(bf.readLine());
        while (T-- > 0) {
            String[] str = bf.readLine().split(" ");
            int n = Integer.parseInt(str[0]);
            int k = Integer.parseInt(str[1]);
            String s = bf.readLine();
            int ans = 0, t = -1;
            for (int i = 0; i < n; i++) {
                if (s.charAt(i) == 'B' && i > t) {
                    t = i + k - 1;
                    ans++;
                }
            }
            bw.write(ans + "\n");
        }
        bw.close();
    }
}

Codeforces Round 898 (Div. 4) E. Building an Aquarium

import java.io.*;
import java.util.ArrayList;
import java.util.Collections;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int T = Integer.parseInt(bf.readLine());
        while (T-- > 0) {
            String[] str = bf.readLine().split(" ");
            int n = Integer.parseInt(str[0]);
            int x = Integer.parseInt(str[1]);
            str = bf.readLine().split(" ");
            ArrayList<Integer> a = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                a.add(Integer.parseInt(str[i]));
            }
            Collections.sort(a);
            long sum = 0, ans = 0;
            for (int i = 0; i < n; i++) {
                if (i != 0 && sum + (long) i * (a.get(i) - a.get(i - 1)) > x) {
                    ans = a.get(i - 1) + (x - sum) / i;
                    break;
                }
                if (i != 0) {
                    sum += (long) i * (a.get(i) - a.get(i - 1));
                }
                if (i == n - 1) {
                    ans = a.get(i) + (x - sum) / n;
                }
            }
            bw.write(ans + "\n");
        }
        bw.close();
    }
}

Codeforces Round 898 (Div. 4) F. Money Trees

import java.io.*;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int T = Integer.parseInt(bf.readLine());
        while (T-- > 0) {
            String[] str = bf.readLine().split(" ");
            int n = Integer.parseInt(str[0]);
            int k = Integer.parseInt(str[1]);
            str = bf.readLine().split(" ");
            int[] s = new int[n + 1];
            for (int i = 0; i < n; i++) {
                s[i + 1] = s[i] + Integer.parseInt(str[i]);
            }
            str = bf.readLine().split(" ");
            int[] h = new int[n];
            for (int i = 0; i < n; i++) {
                h[i] = Integer.parseInt(str[i]);
            }
            int ans = 0;
            for (int i = 0, j = 0; i < n; i++) {
                if (i != 0 && h[i - 1] % h[i] != 0) {
                    j = i;
                }
                while (s[i + 1] - s[j] > k) {
                    j++;
                }
                ans = Math.max(ans, i - j + 1);
            }
            bw.write(ans + "\n");
        }
        bw.close();
    }
}

Codeforces Round 898 (Div. 4) G. ABBC or BACB

import java.io.*;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        int T = Integer.parseInt(bf.readLine());
        while (T-- > 0) {
            String s = bf.readLine();
            int ans = 0;
            int n = s.length();
            for (int i = 0, j = -1; i <= n; i++) {
                if (i == n || s.charAt(i) == 'C') {
                    int mn = n;
                    for (int x = 0, y = j; x <= i; x++) {
                        if (x < i && s.charAt(x) == 'A') ans++;
                        else {
                            mn = Math.min(mn, x - y - 1);
                            y = x;
                        }
                    }
                    ans -= mn;
                }
            }
            bw.write(ans + "\n");
        }
        bw.close();
    }
}