結果

問題 No.1245 ANDORゲーム(calc)
ユーザー packer_jppacker_jp
提出日時 2020-10-02 22:55:17
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 328 ms / 2,000 ms
コード長 3,575 bytes
コンパイル時間 2,046 ms
コンパイル使用メモリ 200,668 KB
最終ジャッジ日時 2025-01-15 01:01:32
ジャッジサーバーID
(参考情報)
judge5 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 25
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int) (n); i++)
#define reps(i, n) for (int i = 1; i <= (int) (n); i++)
#define all(a) (a).begin(), (a).end()
#define uniq(a) (a).erase(unique(all(a)), (a).end())
#define bit(n) (1LL << (n))
#define dump(a) cerr << #a " = " << (a) << endl
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double PI = 3.1415926535897932384626433832795028;
constexpr int DY[9] = {0, 1, 0, -1, 1, 1, -1, -1, 0};
constexpr int DX[9] = {1, 0, -1, 0, 1, -1, -1, 1, 0};
int sign(int a) { return (a > 0) - (a < 0); }
int gcd(int a, int b) {
while (b) { swap(a %= b, b); }
return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int cdiv(int a, int b) { return (a - 1 + b) / b; }
template<typename T> void fin(T a) {
cout << a << endl;
exit(0);
}
template<typename T> T sq(T a) { return a * a; }
template<typename T, typename U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template<typename T, typename U> bool chmin(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &a) {
os << "(" << a.first << ", " << a.second << ")";
return os;
}
template<typename T> ostream &operator<<(ostream &os, const vector<T> &a) {
os << "{";
for (auto itr = a.begin(); itr != a.end(); itr++) {
os << *itr << (next(itr) != a.end() ? ", " : "");
}
os << "}";
return os;
}
template<typename T> ostream &operator<<(ostream &os, const deque<T> &a) {
os << "{";
for (auto itr = a.begin(); itr != a.end(); itr++) {
os << *itr << (next(itr) != a.end() ? ", " : "");
}
os << "}";
return os;
}
template<typename T> ostream &operator<<(ostream &os, const set<T> &a) {
os << "{";
for (auto itr = a.begin(); itr != a.end(); itr++) {
os << *itr << (next(itr) != a.end() ? ", " : "");
}
os << "}";
return os;
}
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &a) {
os << "{";
for (auto itr = a.begin(); itr != a.end(); itr++) {
os << *itr << (next(itr) != a.end() ? ", " : "");
}
os << "}";
return os;
}
template<typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &a) {
os << "{";
for (auto itr = a.begin(); itr != a.end(); itr++) {
os << *itr << (next(itr) != a.end() ? ", " : "");
}
os << "}";
return os;
}
struct setup {
static constexpr int PREC = 20;
setup() {
cout << fixed << setprecision(PREC);
cerr << fixed << setprecision(PREC);
};
} setup;
signed main() {
int N, Q;
cin >> N >> Q;
vint A(N);
rep(i, N) { cin >> A[i]; }
string S;
cin >> S;
vint t(Q);
rep(i, Q) { cin >> t[i]; }
vector mem(60, vector(2, 0LL));
rep(i, 60) {
rep(j, 2) {
int cur = j;
rep(k, N) {
int nxt;
if (S[k] == '0') { nxt = cur && (A[k] & bit(i)); }
else { nxt = cur || (A[k] & bit(i)); }
mem[i][j] += abs(nxt - cur);
cur = nxt;
}
}
}
rep(i, Q) {
int ans = 0;
rep(j, 60) {
ans += mem[j][(t[i] & bit(j)) > 0] << j;
}
cout << ans << endl;
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0