#959265 (C++17) No.868 ハイパー部分和問題

• 問題: No.868 ハイパー部分和問題
• ユーザー: ゆにぽけ
• 提出日時: 2024-03-11 15:28:51
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 1,520 ms / 7,000 ms
• コード長: 3,923 bytes
• コンパイル時間: 1,490 ms
• コンパイル使用メモリ: 134,336 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-09-29 22:02:35
• 合計ジャッジ時間: 18,376 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	1 ms; 5,248 KB
testcase_07	AC	2 ms; 5,248 KB
testcase_08	AC	2 ms; 5,248 KB
testcase_09	AC	2 ms; 5,248 KB
testcase_10	AC	2 ms; 5,248 KB
testcase_11	AC	2 ms; 5,248 KB
testcase_12	AC	2 ms; 5,248 KB
testcase_13	AC	2 ms; 5,248 KB
testcase_14	AC	753 ms; 5,248 KB
testcase_15	AC	698 ms; 5,248 KB
testcase_16	AC	702 ms; 5,248 KB
testcase_17	AC	705 ms; 5,248 KB
testcase_18	AC	701 ms; 5,248 KB
testcase_19	AC	496 ms; 5,248 KB
testcase_20	AC	495 ms; 5,248 KB
testcase_21	AC	502 ms; 5,248 KB
testcase_22	AC	503 ms; 5,248 KB
testcase_23	AC	500 ms; 5,248 KB
testcase_24	AC	499 ms; 5,248 KB
testcase_25	AC	504 ms; 5,248 KB
testcase_26	AC	496 ms; 5,248 KB
testcase_27	AC	498 ms; 5,248 KB
testcase_28	AC	496 ms; 5,248 KB
testcase_29	AC	349 ms; 5,248 KB
testcase_30	AC	345 ms; 5,248 KB
testcase_31	AC	350 ms; 5,248 KB
testcase_32	AC	695 ms; 5,248 KB
testcase_33	AC	700 ms; 5,248 KB
testcase_34	AC	1,520 ms; 5,248 KB
testcase_35	AC	1,515 ms; 5,248 KB
testcase_36	AC	760 ms; 5,248 KB
testcase_37	AC	760 ms; 5,248 KB
testcase_38	AC	2 ms; 5,248 KB
testcase_39	AC	2 ms; 5,248 KB

ソースコード

#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
template<int m> struct modint
{
	private:
	unsigned int value;
	static constexpr int mod() {return m;}

	public:
	constexpr modint(const long long x = 0) noexcept
	{
		long long y = x;
		if(y < 0 || y >= mod())
		{
			y %= mod();
			if(y < 0) y += mod();
		}
		value = (unsigned int)y;
	}
	static constexpr int get_mod() noexcept {return m;}
	static constexpr int primitive_root() noexcept
	{
		assert(m == 998244353);
		return 3;
	}
	constexpr unsigned int val() noexcept {return value;}
	constexpr modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	constexpr modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	constexpr modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	constexpr modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	constexpr modint inverse() const noexcept
	{
		assert(value);
		long long a = value,b = mod(),x = 1,y = 0;
		while(b)
		{
			long long q = a/b;
			a -= q*b; swap(a,b);
			x -= q*y; swap(x,y);
		}
		return modint(x);
	}
	constexpr modint power(long long N) const noexcept
	{
		assert(N >= 0);
		modint p = *this,ret = 1;
		while(N)
		{
			if(N & 1) ret *= p;
			p *= p;
			N >>= 1;
		}
		return ret;
	}
	constexpr modint operator+() {return *this;}
	constexpr modint operator-() {return modint() - *this;}
	constexpr modint &operator++(int) noexcept {return *this += 1;}
	constexpr modint &operator--(int) noexcept {return *this -= 1;}
	friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
	friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
	friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
	friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
	friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
using mint1 = modint<998244353>;
using mint2 = modint<1000000007>;
void Main()
{
	int N,K;
	cin >> N >> K;
	vector<mint1> dp1(K + 1);
	vector<mint2> dp2(K + 1);
	dp1[0] = 1;
	dp2[0] = 1;
	vector<int> A(N);
	for(int i = 0;i < N;i++)
	{
		cin >> A[i];
		{
			for(int j = K;j - A[i] >= 0;j--)
			{
				dp1[j] += dp1[j - A[i]];
			}
		}
		{
			for(int j = K;j - A[i] >= 0;j--)
			{
				dp2[j] += dp2[j - A[i]];
			}
		}
	}
	const mint1 inv1 = mint1(1) / 2;
	const mint2 inv2 = mint2(1) / 2;
	int Q;
	cin >> Q;
	for(;Q--;)
	{
		int x,v;
		cin >> x >> v;
		x--;
		int u = A[x];
		A[x] = v;
		{
			if(u > 0)
			{
				for(int i = 0;i + u <= K;i++)
				{
					dp1[i + u] -= dp1[i];
				}
			}
			else
			{
				for(int i = 0;i <= K;i++)
				{
					dp1[i] *= inv1;
				}
			}
			for(int i = K;i - v >= 0;i--)
			{
				dp1[i] += dp1[i - v];
			}
		}
		{
			if(u > 0)
			{
				for(int i = 0;i + u <= K;i++)
				{
					dp2[i + u] -= dp2[i];
				}
			}
			else
			{
				for(int i = 0;i <= K;i++)
				{
					dp2[i] *= inv2;
				}
			}
			for(int i = K;i - v >= 0;i--)
			{
				dp2[i] += dp2[i - v];
			}
		}
		cout << (dp1[K].val() != 0 || dp2[K].val() != 0 ? "1\n" : "0\n");
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) Main();
}