結果
問題 | No.345 最小チワワ問題 |
ユーザー | Oland |
提出日時 | 2018-11-22 22:03:46 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,982 bytes |
コンパイル時間 | 3,156 ms |
コンパイル使用メモリ | 78,748 KB |
実行使用メモリ | 36,864 KB |
最終ジャッジ日時 | 2024-06-06 23:06:01 |
合計ジャッジ時間 | 5,039 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 49 ms
36,420 KB |
testcase_01 | AC | 48 ms
36,332 KB |
testcase_02 | AC | 48 ms
36,332 KB |
testcase_03 | AC | 47 ms
36,804 KB |
testcase_04 | AC | 49 ms
36,712 KB |
testcase_05 | AC | 49 ms
36,436 KB |
testcase_06 | AC | 47 ms
36,544 KB |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | AC | 49 ms
36,576 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 48 ms
36,764 KB |
testcase_15 | AC | 49 ms
36,804 KB |
testcase_16 | AC | 50 ms
36,580 KB |
testcase_17 | AC | 49 ms
36,864 KB |
testcase_18 | AC | 49 ms
36,788 KB |
testcase_19 | AC | 48 ms
36,600 KB |
testcase_20 | AC | 48 ms
36,660 KB |
testcase_21 | WA | - |
testcase_22 | AC | 47 ms
36,456 KB |
testcase_23 | AC | 47 ms
36,712 KB |
testcase_24 | AC | 47 ms
36,456 KB |
testcase_25 | AC | 49 ms
36,416 KB |
testcase_26 | AC | 48 ms
36,864 KB |
testcase_27 | AC | 48 ms
36,832 KB |
testcase_28 | WA | - |
testcase_29 | AC | 47 ms
36,608 KB |
testcase_30 | AC | 47 ms
36,860 KB |
testcase_31 | WA | - |
ソースコード
import java.io.File; import java.io.FileInputStream; import java.util.Scanner; import java.util.Map.Entry; import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Collections; import java.util.Comparator; import java.util.HashMap; import java.util.List; import java.util.NoSuchElementException; public class Main { public static void main(String[] args) throws IOException { FastScanner sc = new FastScanner(System.in); String S = sc.next(); int C = -1; int min = 101; while(true){ C = S.indexOf("c", C+1); if(C == -1) break; int W1 = S.indexOf("w", C+1); int W2 = (W1 != -1) ? S.indexOf("w", W1+1) : -1; if(!(W2 == -1 || C > W1)) min = Math.min(min, W2-C+1); } System.out.println(min); } } class FastScanner { private InputStream in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; public FastScanner(InputStream in) { this.in = in; } private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1; } private static boolean isPrintableChar(int c){ return 33 <= c && c <= 126; } public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { long nl = nextLong(); if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException(); return (int) nl; } public double nextDouble() { return Double.parseDouble(next()); } }