結果
問題 | No.1645 AB's abs |
ユーザー | nishi5451 |
提出日時 | 2021-08-14 10:16:47 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,853 bytes |
コンパイル時間 | 2,261 ms |
コンパイル使用メモリ | 77,972 KB |
実行使用メモリ | 62,772 KB |
最終ジャッジ日時 | 2024-10-04 22:19:30 |
合計ジャッジ時間 | 6,742 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 55 ms
49,880 KB |
testcase_01 | AC | 55 ms
50,064 KB |
testcase_02 | AC | 67 ms
52,524 KB |
testcase_03 | AC | 54 ms
49,948 KB |
testcase_04 | AC | 58 ms
49,980 KB |
testcase_05 | AC | 56 ms
50,148 KB |
testcase_06 | AC | 59 ms
50,068 KB |
testcase_07 | AC | 57 ms
49,700 KB |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | WA | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
ソースコード
import java.util.*; import java.io.*; public class Main { static final int INF = 1<<30; static final long INFL = 1L<<60; static final int MOD = 1000000007; static final int MOD2 = 998244353; static List<List<Integer>> g; public static void main(String[] args) { FastScanner fs = new FastScanner(); PrintWriter pw = new PrintWriter(System.out); // -10000 to 10000 int n = fs.nextInt(); int M_MAX = 20000; int[] a = fs.nextInts(n); int[][] dp = new int[n+1][M_MAX+1]; dp[0][10000] = 1; for(int i = 0; i < n; i++){ for(int j = 0; j <= M_MAX; j++){ if(dp[i][j] != 0){ dp[i+1][j-a[i]] = (dp[i+1][j-a[i]] + dp[i][j]) % MOD2; dp[i+1][j+a[i]] = (dp[i+1][j+a[i]] + dp[i][j]) % MOD2; } } } long ans = 0; for(int i = 1; i <= M_MAX; i++){ ans += Math.abs(i-10000)*dp[n][i]; ans %= MOD2; } pw.println(ans); pw.close(); } } class FastScanner { private InputStream in = System.in; private byte[] buffer = new byte[1024]; private int length = 0, p = 0; private boolean hasNextByte() { if (p < length) return true; else{ p = 0; try{ length = in.read(buffer); }catch(Exception e){ e.printStackTrace(); } if(length == 0) return false; } return true; } private int readByte() { if (hasNextByte() == true) return buffer[p++]; return -1; } private static boolean isPrintable(int n) { return 33 <= n && n <= 126; } private void skip() { while (hasNextByte() && !isPrintable(buffer[p])) p++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int temp = readByte(); while (isPrintable(temp)) { sb.appendCodePoint(temp); temp = readByte(); } return sb.toString(); } public int nextInt() { return Math.toIntExact(nextLong()); } public int[] nextInts(int n) { int[] ar = new int[n]; for (int i = 0; i < n; i++) ar[i] = nextInt(); return ar; } public long[] nextLongs(int n) { long[] ar = new long[n]; for (int i = 0; i < n; i++) ar[i] = nextLong(); return ar; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); boolean minus = false; int temp = readByte(); if (temp == '-') { minus = true; temp = readByte(); } if (temp < '0' || '9' < temp) throw new NumberFormatException(); long n = 0; while (isPrintable(temp)) { if ('0' <= temp && temp <= '9') { n *= 10; n += temp - '0'; } temp = readByte(); } return minus ? -n : n; } public char[] nextChars() { String s = next(); return s.toCharArray(); } public char[][] nextCharMat(int h, int w) { char[][] ar = new char[h][w]; for(int i = 0; i < h; i++){ String s = next(); for(int j = 0; j < w; j++){ ar[i][j] = s.charAt(j); } } return ar; } }