結果

問題 No.2629 A replace B replace C
ユーザー AsahiAsahi
提出日時 2024-02-16 23:43:35
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 6,166 bytes
コンパイル時間 3,936 ms
コンパイル使用メモリ 87,848 KB
実行使用メモリ 58,084 KB
最終ジャッジ日時 2024-09-28 22:43:57
合計ジャッジ時間 17,599 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 195 ms
58,084 KB
testcase_01 AC 173 ms
55,988 KB
testcase_02 AC 165 ms
55,888 KB
testcase_03 AC 184 ms
56,724 KB
testcase_04 AC 141 ms
54,272 KB
testcase_05 AC 173 ms
54,680 KB
testcase_06 AC 172 ms
54,488 KB
testcase_07 AC 169 ms
56,020 KB
testcase_08 AC 173 ms
54,856 KB
testcase_09 AC 177 ms
55,628 KB
testcase_10 AC 185 ms
55,712 KB
testcase_11 AC 192 ms
56,108 KB
testcase_12 AC 184 ms
54,584 KB
testcase_13 AC 172 ms
54,808 KB
testcase_14 AC 180 ms
54,484 KB
testcase_15 AC 191 ms
55,988 KB
testcase_16 AC 183 ms
55,888 KB
testcase_17 AC 185 ms
55,904 KB
testcase_18 AC 181 ms
54,748 KB
testcase_19 AC 173 ms
55,864 KB
testcase_20 AC 171 ms
55,996 KB
testcase_21 AC 188 ms
55,500 KB
testcase_22 AC 163 ms
54,804 KB
testcase_23 WA -
testcase_24 WA -
testcase_25 AC 162 ms
54,636 KB
testcase_26 AC 175 ms
55,936 KB
testcase_27 AC 170 ms
54,744 KB
testcase_28 AC 185 ms
54,432 KB
testcase_29 WA -
testcase_30 AC 151 ms
53,972 KB
testcase_31 AC 185 ms
54,960 KB
testcase_32 AC 192 ms
54,888 KB
testcase_33 AC 211 ms
57,996 KB
testcase_34 AC 176 ms
55,872 KB
testcase_35 AC 182 ms
54,800 KB
testcase_36 AC 205 ms
56,264 KB
testcase_37 AC 199 ms
54,888 KB
testcase_38 AC 188 ms
54,672 KB
testcase_39 AC 184 ms
56,056 KB
testcase_40 AC 196 ms
54,920 KB
testcase_41 AC 162 ms
54,588 KB
testcase_42 AC 166 ms
54,596 KB
testcase_43 AC 160 ms
54,464 KB
testcase_44 AC 162 ms
54,676 KB
testcase_45 AC 168 ms
54,476 KB
testcase_46 AC 186 ms
55,664 KB
testcase_47 AC 160 ms
54,508 KB
testcase_48 AC 167 ms
54,936 KB
testcase_49 AC 162 ms
54,812 KB
testcase_50 AC 186 ms
55,992 KB
testcase_51 AC 166 ms
54,712 KB
testcase_52 AC 187 ms
56,080 KB
testcase_53 AC 137 ms
53,700 KB
testcase_54 AC 145 ms
53,736 KB
testcase_55 AC 160 ms
54,812 KB
testcase_56 AC 135 ms
53,628 KB
testcase_57 AC 167 ms
54,744 KB
testcase_58 AC 154 ms
54,240 KB
testcase_59 AC 182 ms
55,860 KB
testcase_60 AC 170 ms
54,744 KB
testcase_61 AC 125 ms
53,680 KB
testcase_62 AC 126 ms
54,196 KB
testcase_63 AC 121 ms
53,524 KB
testcase_64 AC 117 ms
53,428 KB
testcase_65 AC 119 ms
53,632 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.util.*; 
import java.io.*;
import java.math.*;
import java.util.stream.*;
import java.util.function.*;

class Main implements Runnable {

    public void solve() {    
        int n = in.nextInt();
        String s = in.next() , t = in.next();
        int AtoC = 0 , BtoC = 0 , AtoB = 0 ;
        boolean valid = true ;
        for(int i = 0 ; i < n ; i ++) {
            if(s.charAt(i) == t.charAt(i)) continue;
            else if(s.charAt(i) == 'A') {
                if(t.charAt(i) == 'B') AtoB ++ ;
                else if(t.charAt(i) == 'C') AtoC ++ ;
            }
            else if(s.charAt(i) == 'B') {
                if(t.charAt(i) == 'C') BtoC ++ ;
                else if(t.charAt(i) == 'A') valid = false ;
            }
            else if(s.charAt(i) == 'C') {
                if(t.charAt(i) == 'A' || t.charAt(i) == 'B') valid = false; 
            }
        }
        if(!valid) {
            out.print(no);
            return;
        }
        int min = Math.min(AtoC , BtoC);
        AtoC = AtoC - min ;
        if((AtoC <= BtoC) && (AtoC <= AtoB)) {
            BtoC = BtoC - AtoC ;
            AtoB = AtoB - AtoC ;
            out.println(BtoC == AtoB ? yes : no);
        }
        else {
            out.println(no);
            return;
        }
    }

    
    /******/



    /******/
    
    public PrintWriter out = new PrintWriter(System.out);
    public In in = new In() ;
    public static final int  inf = (1  << 30);
    public static final long lnf = (1L << 60);
    public static final String yes = "Yes" , no  = "No" ;
    public static final int mod7 = 1000000007 , mod9 = 998244353;
    public static final int [] dy4 = {-1,0,1,0} , dx4 = {0,1,0,-1};
    public static final int [] dy8 = {-1,-1,-1,0,1,1,1,0} , dx8 = {-1,0,1,1,1,0,-1,-1};

    public static void main(String ... args) { new Thread(null, new Main(), "", Runtime.getRuntime().maxMemory()).start(); }
    public void run() { solve(); out.flush(); }

}

class In {

    private final InputStream in = System.in;
    private final Scanner sc = new Scanner(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;
    }

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

    public char nextChar() {
        return next().charAt(0);
    }

    public BigInteger nextBigInteger() {
        return sc.nextBigInteger();
    }

    public int [] nextInt(int n) {
        int [] array = new int[n];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = nextInt();
        }
        return array ;
    }

    public int [][] nextInt(int n , int m) {
        int [][] array = new int[n][m];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = nextInt(m);
        }
        return array ;
    }

    public long [] nextLong(int n) {
        long [] array = new long[n];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = nextLong();
        }
        return array ;
    }

    public long [][] nextLong(int n , int m) {
        long [][] array = new long[n][m];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = nextLong(m);
        }
        return array ;
    }

    public double [] nextDouble(int n) {
        double [] array = new double[n];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = nextDouble();
        }
        return array ;
    }
    
    public String [] next(int n) {
        String [] array = new String[n];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = next();
        }
        return array ;
    }

    public String [][] next(int n , int m) {
        String [][] array = new String[n][m];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = next(m);
        }
        return array ;
    }

    public char [] nextChar(int n) {
        char [] array = new char[n];
        String string = next() ;
        for(int i = 0 ; i < n ; i ++) {
            array[i] = string.charAt(i);
        }
        return array ;
    }

    public char [][] nextChar(int n , int m) {
        char [][] array = new char[n][m];
        for(int i = 0 ; i < n ; i ++) {
            array[i] = nextChar(m);
        }
        return array ;
    }

}
0