結果
問題 | No.252 "良問"(良問とは言っていない (2) |
ユーザー |
|
提出日時 | 2015-07-24 22:48:02 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 387 ms / 2,000 ms |
コード長 | 3,611 bytes |
コンパイル時間 | 3,486 ms |
コンパイル使用メモリ | 83,564 KB |
実行使用メモリ | 50,032 KB |
最終ジャッジ日時 | 2024-07-08 13:24:45 |
合計ジャッジ時間 | 6,315 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 7 |
ソースコード
package contest;import java.io.ByteArrayInputStream;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.Arrays;import java.util.InputMismatchException;public class Q387 {InputStream is;PrintWriter out;String INPUT = "";void solve(){char[] problem = "problem".toCharArray();char[] good = "good".toCharArray();for(int T = ni();T >= 1;T--){char[] s = ns().toCharArray();int n = s.length;int[] ngs = new int[n];Arrays.fill(ngs, 7);for(int i = n-7;i >= 0;i--){int ng = 0;for(int j = 0;j < 7;j++){if(s[i+j] != problem[j])ng++;}ngs[i] = Math.min(ngs[i+1], ng);}int[] ps = new int[n+1];for(int i = 0;i <= n-7;i++){int ng = 0;for(int j = 0;j < 7;j++){if(s[i+j] != problem[j])ng++;}ps[i+1] = ps[i];if(ng == 0){ps[i+1]++;}}int ret = 18;for(int i = n-11;i >= 0;i--){int ng = 0;for(int j = 0;j < 4;j++){if(s[i+j] != good[j])ng++;}ret = Math.min(ret, ng + ngs[i+4] + (i-7+1 < 0 ? 0 : ps[i-7+1]));}out.println(ret);}}void run() throws Exception{is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());out = new PrintWriter(System.out);long s = System.currentTimeMillis();solve();out.flush();if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");}public static void main(String[] args) throws Exception { new Q387().run(); }private byte[] inbuf = new byte[1024];private int lenbuf = 0, ptrbuf = 0;private int readByte(){if(lenbuf == -1)throw new InputMismatchException();if(ptrbuf >= lenbuf){ptrbuf = 0;try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }if(lenbuf <= 0)return -1;}return inbuf[ptrbuf++];}private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }private double nd() { return Double.parseDouble(ns()); }private char nc() { return (char)skip(); }private String ns(){int b = skip();StringBuilder sb = new StringBuilder();while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')sb.appendCodePoint(b);b = readByte();}return sb.toString();}private char[] ns(int n){char[] buf = new char[n];int b = skip(), p = 0;while(p < n && !(isSpaceChar(b))){buf[p++] = (char)b;b = readByte();}return n == p ? buf : Arrays.copyOf(buf, p);}private char[][] nm(int n, int m){char[][] map = new char[n][];for(int i = 0;i < n;i++)map[i] = ns(m);return map;}private int[] na(int n){int[] a = new int[n];for(int i = 0;i < n;i++)a[i] = ni();return a;}private int ni(){int num = 0, b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}private long nl(){long num = 0;int b;boolean minus = false;while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));if(b == '-'){minus = true;b = readByte();}while(true){if(b >= '0' && b <= '9'){num = num * 10 + (b - '0');}else{return minus ? -num : num;}b = readByte();}}private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }}