結果

問題 No.1645 AB's abs
ユーザー nishi5451nishi5451
提出日時 2021-08-14 10:17:25
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 2,855 bytes
コンパイル時間 2,168 ms
コンパイル使用メモリ 78,116 KB
実行使用メモリ 64,404 KB
最終ジャッジ日時 2024-10-04 22:20:43
合計ジャッジ時間 6,752 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 56 ms
50,132 KB
testcase_01 AC 55 ms
50,000 KB
testcase_02 AC 82 ms
55,584 KB
testcase_03 AC 56 ms
49,960 KB
testcase_04 AC 57 ms
49,784 KB
testcase_05 AC 56 ms
49,860 KB
testcase_06 AC 60 ms
50,068 KB
testcase_07 AC 58 ms
50,076 KB
testcase_08 AC 85 ms
55,716 KB
testcase_09 AC 88 ms
55,680 KB
testcase_10 AC 84 ms
55,436 KB
testcase_11 AC 86 ms
55,724 KB
testcase_12 AC 84 ms
55,536 KB
testcase_13 AC 99 ms
64,048 KB
testcase_14 AC 96 ms
63,676 KB
testcase_15 AC 99 ms
63,912 KB
testcase_16 AC 101 ms
64,076 KB
testcase_17 AC 99 ms
63,952 KB
testcase_18 AC 97 ms
64,056 KB
testcase_19 AC 101 ms
64,028 KB
testcase_20 AC 98 ms
63,956 KB
testcase_21 AC 97 ms
63,752 KB
testcase_22 AC 97 ms
63,932 KB
testcase_23 AC 101 ms
64,352 KB
testcase_24 AC 98 ms
64,180 KB
testcase_25 AC 98 ms
64,168 KB
testcase_26 AC 95 ms
64,356 KB
testcase_27 AC 98 ms
64,232 KB
testcase_28 AC 96 ms
64,360 KB
testcase_29 AC 98 ms
64,324 KB
testcase_30 AC 97 ms
64,316 KB
testcase_31 AC 102 ms
64,320 KB
testcase_32 AC 101 ms
64,116 KB
testcase_33 AC 100 ms
64,344 KB
testcase_34 AC 99 ms
64,404 KB
testcase_35 AC 98 ms
64,208 KB
testcase_36 AC 98 ms
64,184 KB
testcase_37 AC 115 ms
64,364 KB
testcase_38 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

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);
		long[][] dp = new long[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;
	}
}
0