結果

問題 No.1439 Let's Compare!!!!
ユーザー neko_the_shadowneko_the_shadow
提出日時 2021-04-10 14:47:24
言語 Java21
(openjdk 21)
結果
AC  
実行時間 1,225 ms / 2,000 ms
コード長 5,522 bytes
コンパイル時間 3,594 ms
コンパイル使用メモリ 81,348 KB
実行使用メモリ 78,748 KB
最終ジャッジ日時 2023-09-08 10:53:42
合計ジャッジ時間 14,767 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 76 ms
51,800 KB
testcase_01 AC 79 ms
51,592 KB
testcase_02 AC 77 ms
51,876 KB
testcase_03 AC 83 ms
51,604 KB
testcase_04 AC 88 ms
51,680 KB
testcase_05 AC 84 ms
51,612 KB
testcase_06 AC 78 ms
51,552 KB
testcase_07 AC 200 ms
58,420 KB
testcase_08 AC 225 ms
58,984 KB
testcase_09 AC 187 ms
56,364 KB
testcase_10 AC 1,188 ms
76,540 KB
testcase_11 AC 1,143 ms
66,264 KB
testcase_12 AC 1,118 ms
66,288 KB
testcase_13 AC 1,225 ms
76,852 KB
testcase_14 AC 1,200 ms
78,748 KB
testcase_15 AC 949 ms
62,904 KB
testcase_16 AC 819 ms
62,820 KB
testcase_17 AC 803 ms
62,932 KB
testcase_18 AC 750 ms
62,268 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package _1439;
import java.io.BufferedReader;
import java.io.EOFException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.UncheckedIOException;
import java.math.BigInteger;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.List;
import java.util.TreeSet;
import java.util.function.Supplier;
import java.util.regex.Pattern;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class Main {
    public void exec() {
        int n = stdin.nextInt();
        int[] s = stdin.nextString().chars().map(ch -> ch-'0').toArray();
        int[] t = stdin.nextString().chars().map(ch -> ch-'0').toArray();
        
        TreeSet<Integer> d = IntStream.range(0, n).filter(i -> s[i] != t[i]).boxed().collect(Collectors.toCollection(TreeSet::new));
        
        int q = stdin.nextInt();
        for (int i = 0; i < q; i++) {
            String c = stdin.nextString();
            int x = stdin.nextInt()-1;
            int y = stdin.nextInt();
            
            if (c.equals("S")) {
                s[x] = y;
            } else {
                t[x] = y;
            }
            
            if (s[x] == t[x]) {
                d.remove(x);
            } else {
                d.add(x);
            }
            
            if (d.isEmpty()) {
                stdout.println("=");
            } else {
                int p = d.first();
                if (s[p] < t[p]) {
                    stdout.println("<");
                } else {
                    stdout.println(">");
                }
            }
        }
    }

    private static final Stdin stdin = new Stdin(System.in);
    private static final Stdout stdout = new Stdout(System.out);

    public static void main(String[] args) {
        try {
            new Main().exec();
        } finally {
            stdout.flush();
        }
    }

    public static class Stdin {
        private Deque<String> queue;
        private BufferedReader in;
        private Pattern space;

        public Stdin(InputStream in) {
            this.queue = new ArrayDeque<>();
            this.in = new BufferedReader(new InputStreamReader(in));
            this.space = Pattern.compile(" ");
        }

        public String nextString() {
            if (queue.isEmpty()) {
                try {
                    String line = in.readLine();
                    if (line == null) {
                        throw new EOFException();
                    }
                    space.splitAsStream(line).forEach(this.queue::addLast);
                } catch (IOException e) {
                    throw new UncheckedIOException(e);
                }
            }
            return queue.removeFirst();
        }

        public int nextInt() {
            return Integer.parseInt(nextString());
        }

        public double nextDouble() {
            return Double.parseDouble(nextString());
        }

        public long nextLong() {
            return Long.parseLong(nextString());
        }
        
        public BigInteger nextBigInteger() {
            return new BigInteger(nextString());
        }

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

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

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

        public long[] nextLongArray(int n) {
            long[] a = new long[n];
            for (int i = 0; i < n; i++) a[i] = nextLong();
            return a;
        }
        
        public BigInteger[] nexBigIntegerArray(int n) {
            BigInteger[] a = new BigInteger[n];
            for (int i = 0; i < n; i++) a[i] = nextBigInteger();
            return a;
        }
        
        public List<Integer> nextIntegerList(int n) {
            return nextList(n, this::nextInt);
        }
        
        public List<Long> nextLongList(int n) {
            return nextList(n, this::nextLong);
        }
        
        public List<Double> nextDoubleList(int n) {
            return nextList(n, this::nextDouble);
        }
        
        public List<String> nextStringList(int n) {
            return nextList(n, this::nextString);
        }
        
        public List<BigInteger> nextBigIntegerList(int n) {
            return nextList(n, this::nextBigInteger);
        }
        
        private <T> List<T> nextList(int n, Supplier<T> supplier) {
            List<T> a = new ArrayList<>();
            for (int i = 0; i < n; i++) a.add(supplier.get());
            return a;
        }
    }

    public static class Stdout {
        private PrintWriter stdout;

        public Stdout(PrintStream stdout) {
            this.stdout =  new PrintWriter(stdout, false);
        }

        public void println(Object ... objs) {
            for (int i = 0, len = objs.length; i < len; i++) {
                stdout.print(objs[i]);
                if (i != len-1) stdout.print(' ');
            }
            stdout.println();
        }

        public void flush() {
            stdout.flush();
        }
    }
}
0