Submission #658738

#	Time	Username	Problem	Language	Result	Execution time	Memory
658738		coderInTraining	Palembang Bridges (APIO15_bridge)	Java	0 / 100	154 ms	12352 KiB

bridge

import java.util.*;

class Main {
    public static void main (String[]args) {
        Scanner scan = new Scanner (System.in);

        int allowedBridges = scan.nextInt();
        int citizenNumber = scan.nextInt();

        long previousAdding = 0;

        ArrayList<Integer> locations = new ArrayList<Integer>();

        for (int i = 0; i < citizenNumber; i++) {
            char startZone = scan.next().charAt(0);
            int startLocation = scan.nextInt();

            char endZone = scan.next().charAt(0);
            int endLocation = scan.nextInt();

            if (startZone == endZone) {
                previousAdding += Math.abs(endLocation - startLocation);
            }

            locations.add(startLocation);
            locations.add(endLocation);
        }

        /*
         * If we are only able to build one bridge, we should
         * build it at the median of all start and end locations.
         * After find the median, we can calculate the answer
         * by looping through all values and adding the previously
         * calculated value for locations in the same zone. 
         */
        if (allowedBridges == 1) {
            Collections.sort(locations);

            int size = locations.size();
            int median = locations.get(size / 2 - 1);

            long answer = 0;

            for (int i = 0; i < locations.size(); i++) {
                answer += Math.abs(locations.get(i) - median);
            }

            answer += previousAdding;

            System.out.println(answer);
        }
        else {
            System.out.println(100);
        }
    }
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 14
• Subtask 3: 0 / 9
• Subtask 4: 0 / 32
• Subtask 5: 0 / 37