結果
問題 | No.1150 シュークリームゲーム(Easy) |
ユーザー | shojin_pro |
提出日時 | 2020-08-07 22:35:02 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,539 bytes |
コンパイル時間 | 2,632 ms |
コンパイル使用メモリ | 81,068 KB |
実行使用メモリ | 63,052 KB |
最終ジャッジ日時 | 2023-10-25 03:10:11 |
合計ジャッジ時間 | 11,283 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 56 ms
52,372 KB |
testcase_01 | AC | 56 ms
52,324 KB |
testcase_02 | AC | 56 ms
50,296 KB |
testcase_03 | AC | 55 ms
53,412 KB |
testcase_04 | AC | 56 ms
52,316 KB |
testcase_05 | AC | 56 ms
53,412 KB |
testcase_06 | AC | 57 ms
53,404 KB |
testcase_07 | AC | 56 ms
53,412 KB |
testcase_08 | AC | 55 ms
53,412 KB |
testcase_09 | AC | 55 ms
52,368 KB |
testcase_10 | AC | 55 ms
53,420 KB |
testcase_11 | AC | 55 ms
53,424 KB |
testcase_12 | AC | 57 ms
53,416 KB |
testcase_13 | AC | 55 ms
53,420 KB |
testcase_14 | AC | 55 ms
53,404 KB |
testcase_15 | AC | 55 ms
52,344 KB |
testcase_16 | AC | 55 ms
53,420 KB |
testcase_17 | AC | 57 ms
53,428 KB |
testcase_18 | AC | 58 ms
52,344 KB |
testcase_19 | AC | 56 ms
52,388 KB |
testcase_20 | AC | 58 ms
53,416 KB |
testcase_21 | AC | 56 ms
52,380 KB |
testcase_22 | WA | - |
testcase_23 | AC | 216 ms
60,820 KB |
testcase_24 | AC | 244 ms
58,888 KB |
testcase_25 | WA | - |
testcase_26 | AC | 253 ms
60,524 KB |
testcase_27 | AC | 236 ms
61,068 KB |
testcase_28 | WA | - |
testcase_29 | AC | 210 ms
58,944 KB |
testcase_30 | AC | 245 ms
60,756 KB |
testcase_31 | AC | 226 ms
58,720 KB |
testcase_32 | WA | - |
testcase_33 | AC | 247 ms
60,400 KB |
testcase_34 | WA | - |
testcase_35 | AC | 250 ms
61,260 KB |
testcase_36 | AC | 255 ms
61,288 KB |
testcase_37 | AC | 249 ms
60,964 KB |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | AC | 251 ms
61,364 KB |
testcase_42 | AC | 217 ms
56,772 KB |
testcase_43 | AC | 220 ms
58,784 KB |
testcase_44 | AC | 250 ms
63,052 KB |
ソースコード
import java.util.*; import java.io.*; public class Main { public static void main(String[] args) throws Exception { FastScanner sc = new FastScanner(System.in); PrintWriter pw = new PrintWriter(System.out); int n = sc.nextInt(); int s = sc.nextInt()-1; int t = sc.nextInt()-1; long[] a = sc.nextLongArray(n); long total = 0; for(long v : a){ total += v; } ArrayList<Long> arr = new ArrayList<>(); int xcnt = n/2+n%2; for(int i = -xcnt+1; i < xcnt; i++){ int now = s+i; if(now < 0){ now += n; }else if(now >= n){ now -= n; } if(Math.abs(i) > Math.min(Math.abs(now-t),Math.abs(now-(n+t)))){ continue; }else{ arr.add(a[now]); } } long nowx = 0; for(int i = 0; i < xcnt; i++){ nowx += arr.get(i); } long ans = nowx; int p = 0; int ne = xcnt; int len = arr.size(); while(true){ if(ne >= len) break; nowx += (arr.get(ne)-arr.get(p)); p++; ne++; ans = Math.max(ans,nowx); } long y = total-ans; pw.println(ans-y); pw.flush(); } static class GeekInteger { public static void save_sort(int[] array) { shuffle(array); Arrays.sort(array); } public static int[] shuffle(int[] array) { int n = array.length; Random random = new Random(); for (int i = 0, j; i < n; i++) { j = i + random.nextInt(n - i); int randomElement = array[j]; array[j] = array[i]; array[i] = randomElement; } return array; } } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }