提出 #26281615


ソースコード 拡げる

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        MyScanner in = new MyScanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        B solver = new B();
        solver.solve(1, in, out);
        out.close();
    }

    static class B {
        public void solve(int testNumber, MyScanner in, PrintWriter out) {
            char[] S = in.next().toCharArray(), T = in.next().toCharArray();
            boolean flip = false;
            for (int i = 0; i < S.length; i++) {
                if (S[i] != T[i]) {
                    if (flip || i + 1 == S.length || S[i + 1] != T[i]) {
                        out.println("No");
                        return;
                    }
                    flip = true;
                    char temp = S[i];
                    S[i] = S[i + 1];
                    S[i + 1] = temp;

                }
            }
            out.println("Yes");
        }

    }

    static class MyScanner {
        private BufferedReader in;
        private StringTokenizer st;

        public MyScanner(InputStream stream) {
            in = new BufferedReader(new InputStreamReader(stream));
        }

        public String next() {
            while (st == null || !st.hasMoreTokens()) {
                try {
                    String rl = in.readLine();
                    if (rl == null) {
                        return null;
                    }
                    st = new StringTokenizer(rl);
                } catch (IOException e) {
                    return null;
                }
            }
            return st.nextToken();
        }

    }
}

提出情報

提出日時
問題 B - typo
ユーザ daira4000
言語 Java (OpenJDK 11.0.6)
得点 200
コード長 2152 Byte
結果 AC
実行時間 77 ms
メモリ 32700 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 200 / 200
結果
AC × 3
AC × 15
セット名 テストケース
Sample example0.txt, example1.txt, example2.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, example0.txt, example1.txt, example2.txt
ケース名 結果 実行時間 メモリ
000.txt AC 71 ms 32384 KiB
001.txt AC 71 ms 32488 KiB
002.txt AC 68 ms 32504 KiB
003.txt AC 77 ms 32576 KiB
004.txt AC 74 ms 32700 KiB
005.txt AC 74 ms 32584 KiB
006.txt AC 76 ms 32564 KiB
007.txt AC 67 ms 32592 KiB
008.txt AC 76 ms 32520 KiB
009.txt AC 67 ms 32048 KiB
010.txt AC 67 ms 32024 KiB
011.txt AC 72 ms 32492 KiB
example0.txt AC 71 ms 32632 KiB
example1.txt AC 74 ms 32476 KiB
example2.txt AC 73 ms 32532 KiB