結果

問題 No.150 "良問"(良問とは言っていない
ユーザー uwiuwi
提出日時 2015-02-12 23:50:24
言語 Java21
(openjdk 21)
結果
AC  
実行時間 142 ms / 5,000 ms
コード長 3,788 bytes
コンパイル時間 4,180 ms
コンパイル使用メモリ 92,472 KB
実行使用メモリ 40,492 KB
最終ジャッジ日時 2024-10-11 01:46:57
合計ジャッジ時間 6,907 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 116 ms
40,228 KB
testcase_01 AC 73 ms
38,180 KB
testcase_02 AC 73 ms
38,180 KB
testcase_03 AC 72 ms
37,968 KB
testcase_04 AC 71 ms
38,068 KB
testcase_05 AC 72 ms
38,332 KB
testcase_06 AC 140 ms
40,396 KB
testcase_07 AC 74 ms
37,832 KB
testcase_08 AC 72 ms
38,160 KB
testcase_09 AC 74 ms
38,072 KB
testcase_10 AC 115 ms
40,240 KB
testcase_11 AC 119 ms
39,780 KB
testcase_12 AC 96 ms
39,996 KB
testcase_13 AC 120 ms
40,076 KB
testcase_14 AC 138 ms
40,232 KB
testcase_15 AC 134 ms
40,108 KB
testcase_16 AC 77 ms
37,664 KB
testcase_17 AC 109 ms
39,748 KB
testcase_18 AC 123 ms
39,972 KB
testcase_19 AC 142 ms
40,328 KB
testcase_20 AC 137 ms
40,492 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q3xx;
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 Q344 {
	static InputStream is;
	static PrintWriter out;
	static String INPUT = "";
	
	static void solve()
	{
		char[] G = "good".toCharArray();
		char[] P = "problem".toCharArray();
		for(int T = ni();T >= 1;T--){
			char[] s = ns().toCharArray();
			
			int mindiff = 9999999;
			for(int i = 0;i+4-1 < s.length;i++){
				int diff = 0;
				for(int k = 0;k < 4;k++){
					if(s[i+k] != G[k])diff++;
				}
				for(int j = i+4;j+7-1 < s.length;j++){
					int diff2 = diff;
					for(int k = 0;k < 7;k++){
						if(s[j+k] != P[k])diff2++;
					}
					mindiff = Math.min(mindiff, diff2);
				}
			}
			out.println(mindiff);
		}
	}
	
	public static void main(String[] args) throws Exception
	{
		long S = System.currentTimeMillis();
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		solve();
		out.flush();
		long G = System.currentTimeMillis();
		tr(G-S+"ms");
	}
	
	private static boolean eof()
	{
		if(lenbuf == -1)return true;
		int lptr = ptrbuf;
		while(lptr < lenbuf)if(!isSpaceChar(inbuf[lptr++]))return false;
		
		try {
			is.mark(1000);
			while(true){
				int b = is.read();
				if(b == -1){
					is.reset();
					return true;
				}else if(!isSpaceChar(b)){
					is.reset();
					return false;
				}
			}
		} catch (IOException e) {
			return true;
		}
	}
	
	private static byte[] inbuf = new byte[1024];
	static int lenbuf = 0, ptrbuf = 0;
	
	private static 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 static boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private static int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private static double nd() { return Double.parseDouble(ns()); }
	private static char nc() { return (char)skip(); }
	
	private static 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 static 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 static 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 static int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private static 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 static 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) { if(INPUT.length() != 0)System.out.println(Arrays.deepToString(o)); }
}
0