結果
問題 | No.623 fudan no modulus to tigau |
ユーザー |
|
提出日時 | 2018-01-07 22:13:05 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 61 ms / 2,000 ms |
コード長 | 4,576 bytes |
コンパイル時間 | 4,207 ms |
コンパイル使用メモリ | 78,084 KB |
実行使用メモリ | 37,260 KB |
最終ジャッジ日時 | 2024-12-23 11:12:51 |
合計ジャッジ時間 | 5,520 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 12 |
ソースコード
import java.io.*;import java.util.*;public class Main_yukicoder623 {private static Scanner sc;private static Printer pr;private static void solve() {final int MOD = 998_244_353;int n = sc.nextInt();int[] t = new int[n - 1];int[] a = new int[n - 1];int[] b = new int[n - 1];for (int i = 0; i < n - 1; i++) {t[i] = sc.nextInt();a[i] = sc.nextInt();b[i] = sc.nextInt();}int q = sc.nextInt();int[] x = new int[q];for (int i = 0; i < q; i++) {x[i] = sc.nextInt();long[] f = new long[n + 1];f[0] = 1;f[1] = x[i];for (int j = 2; j <= n; j++) {if (t[j - 2] == 1) {f[j] = f[a[j - 2]] + f[b[j - 2]];} else if (t[j - 2] == 2) {f[j] = a[j - 2] * f[b[j - 2]];} else if (t[j - 2] == 3) {f[j] = f[a[j - 2]] * f[b[j - 2]];}f[j] %= MOD;}pr.println(f[n]);}}// ---------------------------------------------------public static void main(String[] args) {sc = new Scanner(System.in);pr = new Printer(System.out);solve();pr.close();sc.close();}@SuppressWarnings("unused")private static class Scanner {BufferedReader br;Scanner (InputStream in) {br = new BufferedReader(new InputStreamReader(in));}private boolean isPrintable(int ch) {return ch >= '!' && ch <= '~';}private boolean isCRLF(int ch) {return ch == '\n' || ch == '\r' || ch == -1;}private int nextPrintable() {try {int ch;while (!isPrintable(ch = br.read())) {if (ch == -1) {throw new NoSuchElementException();}}return ch;} catch (IOException e) {throw new NoSuchElementException();}}String next() {try {int ch = nextPrintable();StringBuilder sb = new StringBuilder();do {sb.appendCodePoint(ch);} while (isPrintable(ch = br.read()));return sb.toString();} catch (IOException e) {throw new NoSuchElementException();}}int nextInt() {try {// parseInt from Integer.parseInt()boolean negative = false;int res = 0;int limit = -Integer.MAX_VALUE;int radix = 10;int fc = nextPrintable();if (fc < '0') {if (fc == '-') {negative = true;limit = Integer.MIN_VALUE;} else if (fc != '+') {throw new NumberFormatException();}fc = br.read();}int multmin = limit / radix;int ch = fc;do {int digit = ch - '0';if (digit < 0 || digit >= radix) {throw new NumberFormatException();}if (res < multmin) {throw new NumberFormatException();}res *= radix;if (res < limit + digit) {throw new NumberFormatException();}res -= digit;} while (isPrintable(ch = br.read()));return negative ? res : -res;} catch (IOException e) {throw new NoSuchElementException();}}long nextLong() {try {// parseLong from Long.parseLong()boolean negative = false;long res = 0;long limit = -Long.MAX_VALUE;int radix = 10;int fc = nextPrintable();if (fc < '0') {if (fc == '-') {negative = true;limit = Long.MIN_VALUE;} else if (fc != '+') {throw new NumberFormatException();}fc = br.read();}long multmin = limit / radix;int ch = fc;do {int digit = ch - '0';if (digit < 0 || digit >= radix) {throw new NumberFormatException();}if (res < multmin) {throw new NumberFormatException();}res *= radix;if (res < limit + digit) {throw new NumberFormatException();}res -= digit;} while (isPrintable(ch = br.read()));return negative ? res : -res;} catch (IOException e) {throw new NoSuchElementException();}}float nextFloat() {return Float.parseFloat(next());}double nextDouble() {return Double.parseDouble(next());}String nextLine() {try {int ch;while (isCRLF(ch = br.read())) {if (ch == -1) {throw new NoSuchElementException();}}StringBuilder sb = new StringBuilder();do {sb.appendCodePoint(ch);} while (!isCRLF(ch = br.read()));return sb.toString();} catch (IOException e) {throw new NoSuchElementException();}}void close() {try {br.close();} catch (IOException e) {// throw new NoSuchElementException();}}}private static class Printer extends PrintWriter {Printer(PrintStream out) {super(out);}}}