# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
658737 | coderInTraining | Palembang Bridges (APIO15_bridge) | Java | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
import java.util.*;
public 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);
}
}
}