#927192 (C++17) No.1876 Xor of Sum

• 問題: No.1876 Xor of Sum
• ユーザー: ゆにぽけ
• 提出日時: 2023-11-09 20:47:23
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 393 ms / 2,000 ms
• コード長: 2,708 bytes
• コンパイル時間: 1,357 ms
• コンパイル使用メモリ: 128,820 KB
• 実行使用メモリ: 6,676 KB
• 最終ジャッジ日時: 2023-11-09 20:47:34
• 合計ジャッジ時間: 10,485 ms
• ジャッジサーバーID （参考情報）: judge12 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	9 ms; 6,676 KB
testcase_01	AC	9 ms; 6,676 KB
testcase_02	AC	11 ms; 6,676 KB
testcase_03	AC	157 ms; 6,676 KB
testcase_04	AC	295 ms; 6,676 KB
testcase_05	AC	39 ms; 6,676 KB
testcase_06	AC	372 ms; 6,676 KB
testcase_07	AC	45 ms; 6,676 KB
testcase_08	AC	39 ms; 6,676 KB
testcase_09	AC	245 ms; 6,676 KB
testcase_10	AC	137 ms; 6,676 KB
testcase_11	AC	324 ms; 6,676 KB
testcase_12	AC	157 ms; 6,676 KB
testcase_13	AC	228 ms; 6,676 KB
testcase_14	AC	192 ms; 6,676 KB
testcase_15	AC	213 ms; 6,676 KB
testcase_16	AC	33 ms; 6,676 KB
testcase_17	AC	346 ms; 6,676 KB
testcase_18	AC	378 ms; 6,676 KB
testcase_19	AC	373 ms; 6,676 KB
testcase_20	AC	389 ms; 6,676 KB
testcase_21	AC	371 ms; 6,676 KB
testcase_22	AC	377 ms; 6,676 KB
testcase_23	AC	382 ms; 6,676 KB
testcase_24	AC	370 ms; 6,676 KB
testcase_25	AC	369 ms; 6,676 KB
testcase_26	AC	375 ms; 6,676 KB
testcase_27	AC	375 ms; 6,676 KB
testcase_28	AC	383 ms; 6,676 KB
testcase_29	AC	393 ms; 6,676 KB

ソースコード

#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#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<functional>
#include<utility>
#include<atcoder/segtree>
using namespace std;
struct modint
{
	private:
	unsigned int value;
	static int &mod()
	{
		static int m = 0;
		return m;
	}

	public:
	static void setmod(const int m)
	{
		mod() = m;
	}
	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;
	}
	unsigned int val() noexcept {return value;}
	modint &operator+=(const modint &other) noexcept
	{
		value += other.value;
		if(value >= mod()) value -= mod();
		return *this;
	}
	modint &operator-=(const modint &other) noexcept
	{
		unsigned int x = value;
		if(x < other.value) x += mod();
		x -= other.value;
		value = x;
		return *this;
	}
	modint &operator*=(const modint &other) noexcept
	{
		unsigned long long x = value;
		x *= other.value;
		value = (unsigned int) (x % mod());
		return *this;
	}
	modint &operator/=(const modint &other) noexcept
	{
		return *this *= other.inverse();
	}
	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);
	}
	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;
	}
	modint operator+() {return *this;}
	modint operator-() {return modint() - *this;}
	modint &operator++(int) noexcept {return *this += 1;}
	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 mint = modint;
void solve()
{
	int N;
	cin >> N;
	const int M = 2000*2000;
	bitset<M+1> dp;
	dp[0] = 1;
	for(;N--;)
	{
		int A;
		cin >> A;
		dp ^= dp << A;
	}
	int ans = 0;
	for(int i = 1;i <= M;i++) ans ^= dp[i]*i;
	cout << ans << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) solve();
}