結果

問題 No.700 LOVE
ユーザー tutuz
提出日時 2018-06-15 23:10:43
言語 Java
(openjdk 23)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 2,466 bytes
コンパイル時間 2,273 ms
コンパイル使用メモリ 77,680 KB
実行使用メモリ 50,648 KB
最終ジャッジ日時 2024-06-30 15:21:15
合計ジャッジ時間 3,799 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 14 WA * 2
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.InputMismatchException;
import java.util.StringTokenizer;
public class Main {
    public static void main(String[] args) throws IOException {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskX solver = new TaskX();
        solver.solve(1, in, out);
        out.close();
    }
    static int INF = 1 << 30;
    static int MOD = 1000000007;
    static int[] mh4 = { 0, -1, 1, 0 };
    static int[] mw4 = { -1, 0, 0, 1 };
    static int[] mh8 = { -1, -1, -1, 0, 0, 1, 1, 1 };
    static int[] mw8 = { -1, 0, 1, -1, 1, -1, 0, 1 };
    static class TaskX {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int n = in.nextInt(), m = in.nextInt();
            char[][] s = new char[n][m];
            for (int i = 0; i < n; i++) {
                s[i] = in.nextString().toCharArray();
            }
            char[] t = "LOVE".toCharArray();
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m-4; j++) {
                    boolean isFound = true;
                    for (int k = 0; k < 4; k++) {
                        if (s[i][j+k] == t[k]) {
                            continue;
                        } else {
                            isFound = false;
                            break;
                        }
                    }
                    if (isFound) {
                        out.println("YES");
                        return;
                    }
                }
            }
            out.println("NO");
        }
    }
    static class InputReader {
        BufferedReader in;
        StringTokenizer tok;
        public String nextString() {
            while (!tok.hasMoreTokens()) {
                try {
                    tok = new StringTokenizer(in.readLine(), " ");
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
            }
            return tok.nextToken();
        }
        public int nextInt() {
            return Integer.parseInt(nextString());
        }
        public long nextLong() {
            return Long.parseLong(nextString());
        }
        public double nextDouble() {
            return Double.parseDouble(nextString());
        }
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        public InputReader(InputStream inputStream) {
            in = new BufferedReader(new InputStreamReader(inputStream));
            tok = new StringTokenizer("");
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0