Submission #1441897
Source Code Expand
//Do what you can't. import java.io.*; import java.util.*; import java.math.BigInteger; public class Main{ public static void main(String[] args) { InputReader in = new InputReader(System.in); PrintWriter w = new PrintWriter(System.out); int n = in.nextInt(), a = in.nextInt(), b = in.nextInt(); int[] arr = in.nextIntArray(n); long fat = 0; for (int i = 0; i < n - 1; i++) { fat += Math.min((long)Math.abs(arr[i] - arr[i + 1]) * a, b); } w.println(fat); w.close(); } static class InputReader { private final InputStream stream; private final byte[] buf = new byte[8192]; private int curChar, snumChars; private SpaceCharFilter filter; public InputReader(InputStream stream) { this.stream = stream; } public int snext() { if (snumChars == -1) throw new InputMismatchException(); if (curChar >= snumChars) { curChar = 0; try { snumChars = stream.read(buf); } catch (IOException e) { throw new InputMismatchException(); } if (snumChars <= 0) return -1; } return buf[curChar++]; } public int nextInt() { int c = snext(); while (isSpaceChar(c)) { c = snext(); } int sgn = 1; if (c == '-') { sgn = -1; c = snext(); } int res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res *= 10; res += c - '0'; c = snext(); } while (!isSpaceChar(c)); return res * sgn; } public long nextLong() { int c = snext(); while (isSpaceChar(c)) { c = snext(); } int sgn = 1; if (c == '-') { sgn = -1; c = snext(); } long res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res *= 10; res += c - '0'; c = snext(); } while (!isSpaceChar(c)); return res * sgn; } public int[] nextIntArray(int n) { int a[] = new int[n]; for (int i = 0; i < n; i++) { a[i] = nextInt(); } return a; } public String readString() { int c = snext(); while (isSpaceChar(c)) { c = snext(); } StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = snext(); } while (!isSpaceChar(c)); return res.toString(); } public String nextLine() { int c = snext(); while (isSpaceChar(c)) c = snext(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = snext(); } while (!isEndOfLine(c)); return res.toString(); } public boolean isSpaceChar(int c) { if (filter != null) return filter.isSpaceChar(c); return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } private boolean isEndOfLine(int c) { return c == '\n' || c == '\r' || c == -1; } public interface SpaceCharFilter { public boolean isSpaceChar(int ch); } } }
Submission Info
Submission Time | |
---|---|
Task | D - Walk and Teleport |
User | ashubeckham |
Language | Java8 (OpenJDK 1.8.0) |
Score | 500 |
Code Size | 3292 Byte |
Status | AC |
Exec Time | 96 ms |
Memory | 21844 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_balancedmax_01.txt, subtask_1_balancedmax_02.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_min_01.txt, subtask_1_onlya_01.txt, subtask_1_onlyamax_01.txt, subtask_1_onlyb_01.txt, subtask_1_onlybmax_01.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 71 ms | 20180 KB |
sample_02.txt | AC | 70 ms | 19796 KB |
sample_03.txt | AC | 79 ms | 18772 KB |
subtask_1_balancedmax_01.txt | AC | 92 ms | 19284 KB |
subtask_1_balancedmax_02.txt | AC | 92 ms | 19924 KB |
subtask_1_max_01.txt | AC | 91 ms | 21844 KB |
subtask_1_max_02.txt | AC | 96 ms | 19284 KB |
subtask_1_min_01.txt | AC | 67 ms | 19028 KB |
subtask_1_onlya_01.txt | AC | 85 ms | 19924 KB |
subtask_1_onlyamax_01.txt | AC | 92 ms | 19412 KB |
subtask_1_onlyb_01.txt | AC | 80 ms | 18004 KB |
subtask_1_onlybmax_01.txt | AC | 93 ms | 21588 KB |
subtask_1_rand_01.txt | AC | 88 ms | 16340 KB |
subtask_1_rand_02.txt | AC | 90 ms | 19796 KB |
subtask_1_rand_03.txt | AC | 88 ms | 21844 KB |