結果

問題 No.1005 BOT対策
ユーザー k_6101k_6101
提出日時 2020-03-06 22:44:38
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,473 bytes
コンパイル時間 2,774 ms
コンパイル使用メモリ 80,144 KB
実行使用メモリ 52,004 KB
最終ジャッジ日時 2024-10-14 10:49:15
合計ジャッジ時間 6,309 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
50,260 KB
testcase_01 AC 55 ms
50,124 KB
testcase_02 AC 56 ms
50,120 KB
testcase_03 AC 56 ms
50,184 KB
testcase_04 WA -
testcase_05 AC 56 ms
50,024 KB
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 56 ms
50,304 KB
testcase_09 AC 56 ms
50,200 KB
testcase_10 AC 56 ms
50,040 KB
testcase_11 RE -
testcase_12 WA -
testcase_13 AC 57 ms
49,876 KB
testcase_14 AC 56 ms
50,016 KB
testcase_15 AC 56 ms
50,268 KB
testcase_16 AC 56 ms
50,216 KB
testcase_17 AC 58 ms
50,220 KB
testcase_18 AC 55 ms
50,108 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 56 ms
50,316 KB
testcase_22 AC 57 ms
50,132 KB
testcase_23 AC 56 ms
50,400 KB
testcase_24 AC 56 ms
50,172 KB
testcase_25 AC 55 ms
50,336 KB
testcase_26 AC 57 ms
50,048 KB
testcase_27 WA -
testcase_28 WA -
testcase_29 AC 56 ms
50,024 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.net.ConnectException;
import java.rmi.dgc.Lease;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
	public static void main(String[] args) {
		Main main = new Main();
		main.solve();
		main.out.close();
	}

	// ======================================================================
	public void solve() {
		char[] S = ns().toCharArray();
		char[] T = ns().toCharArray();
		int start = 0, ans = 0, i;
		while(true) {
			i = start;
			LOOP:
			while(true) {
				for (int j = 0; j < T.length && (i + j) < S.length; j++) {
					if(S[i + j] != T[j]) {
//						out.println(" start = " + start + " i = " + i + "  j = " + j
//								+ "  S[" + (i+j) + "] = " + S[i+j] +  "  T[" + j + "] = " + T[j]);
						start++;
						break LOOP;
					}
					if(j == T.length - 1) {
						ans++;
						start = i + j + 1;
//						out.println("   ans = " + ans + "  i = " 
//								+ i + "  j = " + j + "  次の開始位置   = " + start);
						break LOOP;
					}
				}
				i++;
			}
			if(start >= S.length)	break;
		}
		out.println(ans);
	}
	// ------------------------------------------
	// ライブラリ
	// ------------------------------------------
	// Print
	private PrintWriter out = new PrintWriter(System.out);

	// Scanner
	private FastScanner scan = new FastScanner();

	int ni() {
		return scan.nextInt();
	}

	int[] ni(int n) {
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = ni();
		}
		return a;
	}

	int[][] ni(int y, int x) {
		int[][] a = new int[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = ni();
			}
		}
		return a;
	}

	long nl() {
		return scan.nextLong();
	}

	long[] nl(int n) {
		long[] a = new long[n];
		for (int i = 0; i < n; i++) {
			a[i] = nl();
		}
		return a;
	}

	long[][] nl(int y, int x) {
		long[][] a = new long[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = nl();
			}
		}
		return a;
	}

	String ns() {
		return scan.next();
	}

	String[] ns(int n) {
		String[] a = new String[n];
		for (int i = 0; i < n; i++) {
			a[i] = ns();
		}
		return a;
	}

	String[][] ns(int y, int x) {
		String[][] a = new String[y][x];
		for (int i = 0; i < y; i++) {
			for (int j = 0; j < x; j++) {
				a[i][j] = ns();
			}
		}
		return a;
	}
}

class FastScanner {
	private final InputStream in = System.in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	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());
	}
}
0