結果

問題 No.623 fudan no modulus to tigau
ユーザー yuya178yuya178
提出日時 2017-12-23 00:11:59
言語 Java21
(openjdk 21)
結果
AC  
実行時間 55 ms / 2,000 ms
コード長 4,219 bytes
コンパイル時間 2,368 ms
コンパイル使用メモリ 81,696 KB
実行使用メモリ 50,292 KB
最終ジャッジ日時 2024-12-17 23:53:16
合計ジャッジ時間 3,825 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
50,164 KB
testcase_01 AC 53 ms
50,220 KB
testcase_02 AC 52 ms
50,104 KB
testcase_03 AC 55 ms
50,244 KB
testcase_04 AC 55 ms
49,956 KB
testcase_05 AC 53 ms
50,292 KB
testcase_06 AC 54 ms
49,840 KB
testcase_07 AC 54 ms
50,236 KB
testcase_08 AC 54 ms
50,132 KB
testcase_09 AC 55 ms
50,160 KB
testcase_10 AC 52 ms
49,820 KB
testcase_11 AC 54 ms
50,004 KB
testcase_12 AC 53 ms
50,044 KB
testcase_13 AC 54 ms
50,040 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.math.*;
// import java.awt.Point;
 
public class Main {
    InputStream is;
    PrintWriter out;
    String INPUT = "";
 
    long MOD = 998244353;
    long inf = Long.MAX_VALUE;

    void solve()
    {
        int n = ni();
        int[] t = new int[n+1];
        int[] a = new int[n+1];
        int[] b = new int[n+1];
        for(int i = 2; i <= n; i++){
            t[i] = ni();
            a[i] = ni();
            b[i] = ni();
        }
        int q = ni();
        int[] x = new int[q];
        for(int i = 0; i < q; i++){
            x[i] = ni();
            long ans = f(t,a,b,x[i],n);
            out.println(ans);
        }
    }

    long f(int[] t, int[] a, int[] b, int x, int n){
        long[] f = new long[n+1];
        f[0] = 1;
        f[1] = x;
        for(int i = 2; i <= n; i++){
            if(t[i]==1){
                f[i] = f[a[i]] + f[b[i]];
            }
            if(t[i]==2){
                f[i] = a[i] * f[b[i]];
            }
            if(t[i]==3){
                f[i] = f[a[i]] * f[b[i]];
            }
            f[i] %= MOD;
        }
        return f[n];
    }   
    
    void run() throws Exception
    {
        is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
        out = new PrintWriter(System.out);
        
        long s = System.currentTimeMillis();
        solve();
        out.flush();
        if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
    }
    
    public static void main(String[] args) throws Exception { new Main().run(); }
    
    private byte[] inbuf = new byte[1024];
    private int lenbuf = 0, ptrbuf = 0;
    
    private int readByte()
    {
        if(lenbuf == -1)throw new InputMismatchException();
        if(ptrbuf >= lenbuf){
            ptrbuf = 0;
            try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
            if(lenbuf <= 0)return -1;
        }
        return inbuf[ptrbuf++];
    }
    
    private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
    private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
    
    private double nd() { return Double.parseDouble(ns()); }
    private char nc() { return (char)skip(); }
    
    private String ns()
    {
        int b = skip();
        StringBuilder sb = new StringBuilder();
        while(!(isSpaceChar(b) && b != ' ')){
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    
    private char[] ns(int n)
    {
        char[] buf = new char[n];
        int b = skip(), p = 0;
        while(p < n && !(isSpaceChar(b))){
            buf[p++] = (char)b;
            b = readByte();
        }
        return n == p ? buf : Arrays.copyOf(buf, p);
    }
    
    private char[][] nm(int n, int m)
    {
        char[][] map = new char[n][];
        for(int i = 0;i < n;i++)map[i] = ns(m);
        return map;
    }
    
    private int[] na(int n)
    {
        int[] a = new int[n];
        for(int i = 0;i < n;i++)a[i] = ni();
        return a;
    }
    
    private int ni()
    {
        int num = 0, b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private long nl()
    {
        long num = 0;
        int b;
        boolean minus = false;
        while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
        if(b == '-'){
            minus = true;
            b = readByte();
        }
        
        while(true){
            if(b >= '0' && b <= '9'){
                num = num * 10 + (b - '0');
            }else{
                return minus ? -num : num;
            }
            b = readByte();
        }
    }
    
    private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
 
}
0