Submission #1695907
Source Code Expand
import java.util.Arrays; import java.util.HashMap; import java.util.Map; import java.util.Scanner; public class Main { // private static final String ex = "1\n" + // "10\n" + // "2"; // private static final String ex = "2\n" + // "9\n" + // "3 6"; // private static final String ex = "5\n" + // "20\n" + // "11 12 9 17 12"; public static void main(String[] args) { System.out.println(solve(new Scanner(System.in))); // System.out.println(solve(new Scanner(ex))); } private static int solve(Scanner scanner) { int N = Integer.parseInt(scanner.nextLine()); int K = Integer.parseInt(scanner.nextLine()); int[] X = new int[N]; String[] split = scanner.nextLine().split(" "); for (int i = 0; i < N; i ++) { X[i] = Integer.parseInt(split[i]); } int sum = 0; for (int i = 0; i < N; i ++) { if ((K - X[i]) > X[i]) sum += X[i]; else sum += Math.abs(K - X[i]); } return sum * 2; } }
Submission Info
Submission Time | |
---|---|
Task | B - Collecting Balls (Easy Version) |
User | g_votte |
Language | Java8 (OpenJDK 1.8.0) |
Score | 200 |
Code Size | 1139 Byte |
Status | AC |
Exec Time | 98 ms |
Memory | 23252 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 96 ms | 21588 KB |
02.txt | AC | 96 ms | 21716 KB |
03.txt | AC | 96 ms | 21972 KB |
04.txt | AC | 97 ms | 19540 KB |
05.txt | AC | 94 ms | 18772 KB |
06.txt | AC | 96 ms | 23252 KB |
07.txt | AC | 96 ms | 19796 KB |
subtask0_0.txt | AC | 94 ms | 18516 KB |
subtask0_1.txt | AC | 95 ms | 21844 KB |
subtask0_2.txt | AC | 98 ms | 18900 KB |