結果

問題 No.1439 Let's Compare!!!!
ユーザー tenten
提出日時 2024-02-07 13:17:46
言語 Java
(openjdk 23)
結果
TLE  
実行時間 -
コード長 2,225 bytes
コンパイル時間 2,428 ms
コンパイル使用メモリ 88,108 KB
実行使用メモリ 67,876 KB
最終ジャッジ日時 2024-09-28 12:29:29
合計ジャッジ時間 11,083 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 16 TLE * 1
権限があれば一括ダウンロードができます

ソースコード

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

import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;
public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        char[][] strings = new char[2][];
        for (int i = 0; i < 2; i++) {
            strings[i] = sc.next().toCharArray();
        }
        Map<String, Integer> idxes = Map.of("S", 0, "T", 1);
        int[] diff = {0};
        while (diff[0] < n && strings[0][diff[0]] == strings[1][diff[0]]) {
            diff[0]++;
        }
        int q = sc.nextInt();
        String result = IntStream.range(0, q).mapToObj(i -> {
            int x = idxes.get(sc.next());
            int positon = sc.nextInt() - 1;
            char c = (char)(sc.nextInt() + '0');
            strings[x][positon] = c;
            if (positon <= diff[0]) {
                diff[0] = positon;
                while (diff[0] < n && strings[0][diff[0]] == strings[1][diff[0]]) {
                    diff[0]++;
                }
            }
            if (diff[0] == n) {
                return "=";
            } else if (strings[0][diff[0]] < strings[1][diff[0]]) {
                return "<";
            } else {
                return ">";
            }
        }).collect(Collectors.joining("\n"));
        System.out.println(result);
    }
}
class Scanner {
    BufferedReader br;
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
        } catch (Exception e) {
            
        }
    }
    
    public int nextInt() {
        return Integer.parseInt(next());
    }
    
    public long nextLong() {
        return Long.parseLong(next());
    }
    
    public double nextDouble() {
        return Double.parseDouble(next());
    }
    
    public String next() {
        try {
            while (!st.hasMoreTokens()) {
                st = new StringTokenizer(br.readLine());
            }
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            return st.nextToken();
        }
    }
    
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0