結果
問題 | No.150 "良問"(良問とは言っていない |
ユーザー |
![]() |
提出日時 | 2015-03-10 18:25:08 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 95 ms / 5,000 ms |
コード長 | 4,404 bytes |
コンパイル時間 | 4,231 ms |
コンパイル使用メモリ | 78,964 KB |
実行使用メモリ | 38,292 KB |
最終ジャッジ日時 | 2024-10-11 01:53:38 |
合計ジャッジ時間 | 6,012 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 20 |
ソースコード
//No.150 "良問"(良問とは言っていない import java.util.*; import java.io.*; import static java.util.Arrays.*; import static java.lang.Math.*; public class No150 { static final InputStream in = System.in; static final PrintWriter out = new PrintWriter(System.out,false); static void solve(){ int t = nextInt(); for (int k=0; k<t; k++) { String str = next(); int len = str.length(); int[] diffg = new int[len]; int[] diffp = new int[len]; for (int i=0; i<len-10; i++) diffg[i] = diffgood(str,i); for (int i=4; i<len-6; i++) diffp[i] = diffproblem(str,i); int ans = Integer.MAX_VALUE; for (int i=0; i<len-10; i++) for (int j=i+4; j<len-6; j++) ans = min(ans,diffg[i] + diffp[j]); out.println(ans); } } static char[] good = {'g','o','o','d'}; static char[] problem = {'p','r','o','b','l','e','m'}; static int diffgood(String str, int idx) { int ret = 0; for (int i=0; i<4; i++) { if (good[i] != str.charAt(i+idx)) ret++; } return ret; } static int diffproblem(String str, int idx) { int ret = 0; for (int i=0; i<7; i++) { if (problem[i] != str.charAt(i+idx)) ret++; } return ret; } public static void main(String[] args) throws Exception { long start = System.currentTimeMillis(); solve(); out.flush(); long end = System.currentTimeMillis(); //trace(end-start + "ms"); in.close(); } static void trace(Object... o) { System.out.println(deepToString(o));} static final byte[] buf = new byte[1024]; static int ptr = 0; static int buflen = 0; static boolean hasNextByte() { if (ptr < buflen) return true; ptr = 0; try{ buflen = in.read(buf); }catch (IOException e) {e.printStackTrace();} if (buflen <= 0) return false; return true; } static int readByte() { if (hasNextByte()) return buf[ptr++]; else return -1;} static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} static void skip() { while(hasNextByte() && !isPrintableChar(buf[ptr])) ptr++;} static boolean hasNext() {skip(); return hasNextByte();} static 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(); } static long nextLong() { if (!hasNext()) throw new NoSuchElementException(); boolean minus = false; long num = readByte(); if(num == '-'){ num = 0; minus = true; }else if (num < '0' || '9' < num){ throw new NumberFormatException(); }else{ num -= '0'; } while(true){ int b = readByte(); if('0' <= b && b <= '9') num = num * 10 + (b - '0'); else if(b == -1 || !isPrintableChar(b)) return minus ? -num : num; else throw new NoSuchElementException(); } } static int nextInt() { long num = nextLong(); if (num < Integer.MIN_VALUE || Integer.MAX_VALUE < num) throw new NumberFormatException(); return (int)num; } static double nextDouble() { return Double.parseDouble(next()); } static char nextChar() { if (!hasNext()) throw new NoSuchElementException(); return (char)readByte(); } static String nextLine() { while (hasNextByte() && (buf[ptr] == '\n' || buf[ptr] == '\r')) ptr++; if (!hasNextByte()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (b != '\n' && b != '\r') { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } static int[] nextArrayInt(int n) { int[] a = new int[n]; for (int i=0; i<n; i++) a[i] = nextInt(); return a; } }