Saturday, May 3, 2014

Squats [Codeforces Round #242 (Div. 2)] Problem A

A. Squats
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Pasha has many hamsters and he makes them work out. Today, n hamsters (n is even) came to work out. The hamsters lined up and each hamster either sat down or stood up.
For another exercise, Pasha needs exactly  hamsters to stand up and the other hamsters to sit down. In one minute, Pasha can make some hamster ether sit down or stand up. How many minutes will he need to get what he wants if he acts optimally well?
Input
The first line contains integer n (2 ≤ n ≤ 200n is even). The next line contains n characters without spaces. These characters describe the hamsters' position: the i-th character equals 'X', if the i-th hamster in the row is standing, and 'x', if he is sitting.
Output
In the first line, print a single integer — the minimum required number of minutes. In the second line, print a string that describes the hamsters' position after Pasha makes the required changes. If there are multiple optimal positions, print any of them.

Sample test(s)
input
4
xxXx
output
1
XxXx
input
2
XX
output
1
xX
input
6
xXXxXx
output
0
xXXxXx
→ Source
import java.util.Scanner;
public class Squats {

    public static void main(String[] args) {
        Scanner s = new Scanner(System.in);
        int n = s.nextInt();

        String k = s.next();
        char h[] = new char[n];
        int up = 0, mn = 0;
        for (int i = 0; i < n; ++i) {
            h[i] = k.charAt(i);
            if (h[i] == 'X') {
                up++;
            }
        }

        if (up < n / 2) {
            for (int i = 0; i < n && up < n / 2; ++i) {
                if (h[i] == 'x') {
                    mn++;
                    h[i] = 'X';
                    up++;
                }
            }
        } else if (up > n / 2) {
            for (int i = 0; i < n && up > n / 2; ++i) {
                if (h[i] == 'X') {
                    mn++;
                    h[i] = 'x';
                    up--;
                }
            }
        } 
        System.out.println(mn);
        for(int i=0;i<n;++i){System.out.print(h[i]);}

    }
}

No comments:

Post a Comment