結果

問題 No.3041 非対称じゃんけん
ユーザー Nauclhlt🪷
提出日時 2025-01-06 00:03:50
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
(最新)
AC  
(最初)
実行時間 -
コード長 1,865 bytes
コンパイル時間 1,793 ms
コンパイル使用メモリ 198,144 KB
実行使用メモリ 6,824 KB
最終ジャッジ日時 2025-01-06 00:39:33
合計ジャッジ時間 3,162 ms
ジャッジサーバーID
(参考情報)
judge4 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 3 WA * 10 RE * 5
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ull = unsigned long long;
int main()
{
int N, F;
cin >> N >> F;
vector<int> A(N);
vector<int> B(N);
vector<int> C(N);
int size = ((F * N + 63) / 64);
//cout << "size=" << size << endl;
assert(1 <= N && N <= 4000);
assert(1 <= F && F <= 60);
for (int i = 0; i < N; i++)
{
cin >> A[i];
assert(0 <= A[i] && A[i] <= F);
}
for (int i = 0; i < N; i++)
{
cin >> B[i];
assert(0 <= B[i] && B[i] <= F);
}
for (int i = 0; i < N; i++)
{
cin >> C[i];
assert(0 <= C[i] && C[i] <= F);
}
vector<ull> masks(65);
for (int i = 1; i <= 64; i++)
{
masks[i] = (masks[i - 1] << 1) | 1ULL;
}
vector<ull> dp(size);
vector<ull> nextdp(size);
//dp[0] |= 1ULL << 63;
dp[0] |= 1ULL << (63 - A[0]);
dp[0] |= 1ULL << (63 - B[0]);
dp[0] |= 1ULL << (63 - C[0]);
cout << __popcount(dp[0]) << endl;
for (int k = 2; k <= N; k++)
{
int a = A[k - 1];
int b = B[k - 1];
int c = C[k - 1];
nextdp[0] |= dp[0] | (dp[0] >> a);
for (int i = 1; i < size; i++)
{
nextdp[i] = (dp[i] | (dp[i] >> a)) | ((dp[i - 1] & masks[a]) << (64 - a));
}
nextdp[0] |= dp[0] >> b;
for (int i = 1; i < size; i++)
{
nextdp[i] |= (dp[i] >> b) | (dp[i - 1] & masks[b]) << (64 - b);
}
nextdp[0] |= dp[0] >> c;
for (int i = 1; i < size; i++)
{
nextdp[i] |= (dp[i] >> c) | (dp[i - 1] & masks[c]) << (64 - c);
}
// popcount of next dp
int ans = 0;
for (int i = 0; i < size; i++)
{
ans += __popcount(nextdp[i]);
}
cout << ans << endl;
swap(dp, nextdp);
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0