結果
問題 | No.204 ゴールデン・ウィーク(2) |
ユーザー | fujisu |
提出日時 | 2015-05-09 19:40:24 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 82 ms / 1,000 ms |
コード長 | 3,133 bytes |
コンパイル時間 | 2,626 ms |
コンパイル使用メモリ | 79,120 KB |
実行使用メモリ | 54,100 KB |
最終ジャッジ日時 | 2023-08-25 23:40:56 |
合計ジャッジ時間 | 7,068 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
53,624 KB |
testcase_01 | AC | 69 ms
52,516 KB |
testcase_02 | AC | 82 ms
52,596 KB |
testcase_03 | AC | 78 ms
53,616 KB |
testcase_04 | AC | 67 ms
51,200 KB |
testcase_05 | AC | 80 ms
53,412 KB |
testcase_06 | AC | 68 ms
51,088 KB |
testcase_07 | AC | 66 ms
52,160 KB |
testcase_08 | AC | 66 ms
52,392 KB |
testcase_09 | AC | 69 ms
52,952 KB |
testcase_10 | AC | 80 ms
52,576 KB |
testcase_11 | AC | 65 ms
51,104 KB |
testcase_12 | AC | 82 ms
52,436 KB |
testcase_13 | AC | 75 ms
53,536 KB |
testcase_14 | AC | 71 ms
52,392 KB |
testcase_15 | AC | 77 ms
53,512 KB |
testcase_16 | AC | 80 ms
52,424 KB |
testcase_17 | AC | 76 ms
53,308 KB |
testcase_18 | AC | 66 ms
52,548 KB |
testcase_19 | AC | 65 ms
51,044 KB |
testcase_20 | AC | 69 ms
52,504 KB |
testcase_21 | AC | 69 ms
52,420 KB |
testcase_22 | AC | 69 ms
50,572 KB |
testcase_23 | AC | 67 ms
53,612 KB |
testcase_24 | AC | 79 ms
53,528 KB |
testcase_25 | AC | 78 ms
53,852 KB |
testcase_26 | AC | 77 ms
53,576 KB |
testcase_27 | AC | 71 ms
52,432 KB |
testcase_28 | AC | 70 ms
52,728 KB |
testcase_29 | AC | 65 ms
51,048 KB |
testcase_30 | AC | 76 ms
53,568 KB |
testcase_31 | AC | 71 ms
52,448 KB |
testcase_32 | AC | 78 ms
52,400 KB |
testcase_33 | AC | 65 ms
52,652 KB |
testcase_34 | AC | 79 ms
52,628 KB |
testcase_35 | AC | 77 ms
52,400 KB |
testcase_36 | AC | 66 ms
51,152 KB |
testcase_37 | AC | 79 ms
51,872 KB |
testcase_38 | AC | 71 ms
51,604 KB |
testcase_39 | AC | 65 ms
51,968 KB |
testcase_40 | AC | 76 ms
51,376 KB |
testcase_41 | AC | 68 ms
53,152 KB |
testcase_42 | AC | 76 ms
52,640 KB |
testcase_43 | AC | 69 ms
54,100 KB |
testcase_44 | AC | 67 ms
52,448 KB |
testcase_45 | AC | 69 ms
53,204 KB |
testcase_46 | AC | 65 ms
53,640 KB |
testcase_47 | AC | 67 ms
52,628 KB |
testcase_48 | AC | 67 ms
53,848 KB |
ソースコード
import java.io.IOException; import java.util.InputMismatchException; import java.util.LinkedList; import java.util.List; public class Main { void run() { MyScanner sc = new MyScanner(); int d = sc.nextInt(); char[] c = ("xxxxxxxxxxxxxxxxxxxx" + sc.next() + sc.next() + "xxxxxxxxxxxxxxxxxxxx@").toCharArray(); int cnt = 1; List<Integer> list = new LinkedList<Integer>(); for (int i = 1; i < c.length; i++) { if (c[i] != c[i - 1]) { if (c[i - 1] == 'o') { list.add(cnt); } else { list.add(-cnt); } cnt = 0; } cnt++; } Integer[] a = list.toArray(new Integer[0]); int max = 0; for (int i = 0; i < a.length; i++) { if (a[i] < 0) { if (-a[i] <= d) { int tmp1 = 0, tmp2 = 0; if (0 <= i - 1) { tmp1 = a[i - 1]; } if (i + 1 < a.length) { tmp2 = a[i + 1]; } max = Math.max(max, tmp1 + -a[i] + tmp2); } else { max = Math.max(max, d); if (0 <= i - 1) { max = Math.max(max, a[i - 1] + d); } if (i + 1 < a.length) { max = Math.max(max, a[i + 1] + d); } } } else { max = Math.max(max, a[i]); } } System.out.println(max); } public static void main(String[] args) { new Main().run(); } public void mapDebug(int[][] a) { System.out.println("--------map display---------"); for (int i = 0; i < a.length; i++) { for (int j = 0; j < a[i].length; j++) { System.out.printf("%3d ", a[i][j]); } System.out.println(); } System.out.println("----------------------------" + '\n'); } class MyScanner { int read() { try { return System.in.read(); } catch (IOException e) { throw new InputMismatchException(); } } boolean isSpaceChar(int c) { return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; } boolean isEndline(int c) { return c == '\n' || c == '\r' || c == -1; } int nextInt() { return Integer.parseInt(next()); } int[] nextIntArray(int n) { int[] array = new int[n]; for (int i = 0; i < n; i++) array[i] = nextInt(); return array; } long nextLong() { return Long.parseLong(next()); } long[] nextLongArray(int n) { long[] array = new long[n]; for (int i = 0; i < n; i++) array[i] = nextLong(); return array; } double nextDouble() { return Double.parseDouble(next()); } double[] nextDoubleArray(int n) { double[] array = new double[n]; for (int i = 0; i < n; i++) array[i] = nextDouble(); return array; } String next() { int c = read(); while (isSpaceChar(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isSpaceChar(c)); return res.toString(); } String[] nextStringArray(int n) { String[] array = new String[n]; for (int i = 0; i < n; i++) array[i] = next(); return array; } String nextLine() { int c = read(); while (isEndline(c)) c = read(); StringBuilder res = new StringBuilder(); do { res.appendCodePoint(c); c = read(); } while (!isEndline(c)); return res.toString(); } } }