結果
問題 | No.1296 OR or NOR |
ユーザー |
|
提出日時 | 2022-08-09 10:56:10 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 166 ms / 3,000 ms |
コード長 | 4,398 bytes |
コンパイル時間 | 1,960 ms |
コンパイル使用メモリ | 198,588 KB |
最終ジャッジ日時 | 2025-01-30 19:40:38 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 33 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep(i, n) for (int i = 0; i < (n); i++)#define per(i, n) for (int i = (n)-1; i >= 0; i--)#define rep2(i, l, r) for (int i = (l); i < (r); i++)#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)#define each(e, v) for (auto &e : v)#define MM << " " <<#define pb push_back#define eb emplace_back#define all(x) begin(x), end(x)#define rall(x) rbegin(x), rend(x)#define sz(x) (int)x.size()using ll = long long;using pii = pair<int, int>;using pil = pair<int, ll>;using pli = pair<ll, int>;using pll = pair<ll, ll>;template <typename T>using minheap = priority_queue<T, vector<T>, greater<T>>;template <typename T>using maxheap = priority_queue<T>;template <typename T>bool chmax(T &x, const T &y) {return (x < y) ? (x = y, true) : false;}template <typename T>bool chmin(T &x, const T &y) {return (x > y) ? (x = y, true) : false;}template <typename T>int flg(T x, int i) {return (x >> i) & 1;}template <typename T>void print(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << (i == n - 1 ? '\n' : ' ');if (v.empty()) cout << '\n';}template <typename T>void printn(const vector<T> &v, T x = 0) {int n = v.size();for (int i = 0; i < n; i++) cout << v[i] + x << '\n';}template <typename T>int lb(const vector<T> &v, T x) {return lower_bound(begin(v), end(v), x) - begin(v);}template <typename T>int ub(const vector<T> &v, T x) {return upper_bound(begin(v), end(v), x) - begin(v);}template <typename T>void rearrange(vector<T> &v) {sort(begin(v), end(v));v.erase(unique(begin(v), end(v)), end(v));}template <typename T>vector<int> id_sort(const vector<T> &v, bool greater = false) {int n = v.size();vector<int> ret(n);iota(begin(ret), end(ret), 0);sort(begin(ret), end(ret), [&](int i, int j) { return greater ? v[i] > v[j] : v[i] < v[j]; });return ret;}template <typename S, typename T>pair<S, T> operator+(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first + q.first, p.second + q.second);}template <typename S, typename T>pair<S, T> operator-(const pair<S, T> &p, const pair<S, T> &q) {return make_pair(p.first - q.first, p.second - q.second);}template <typename S, typename T>istream &operator>>(istream &is, pair<S, T> &p) {S a;T b;is >> a >> b;p = make_pair(a, b);return is;}template <typename S, typename T>ostream &operator<<(ostream &os, const pair<S, T> &p) {return os << p.first << ' ' << p.second;}struct io_setup {io_setup() {ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(15);}} io_setup;const int inf = (1 << 30) - 1;const ll INF = (1LL << 60) - 1;// const int MOD = 1000000007;const int MOD = 998244353;int main() {int N;cin >> N;vector<ll> a(N);rep(i, N) cin >> a[i];vector<int> ids;vector<ll> c;ll x = 0;per(i, N) {ll y = x | a[i];if (y > x) {ids.eb(i);c.eb(y & ~x);}x = y;}x = ((1LL << 60) - 1) & ~x;int K = sz(ids);int Q;cin >> Q;while (Q--) {ll X;cin >> X;if (K == 0) {if (X == 0) {cout << 0 << '\n';} else if (X == x) {cout << 1 << '\n';} else {cout << -1 << '\n';}continue;}ll S = 0;vector<int> col(K, 0);rep(i, K) {int t = __builtin_ctzll(c[i]);if (flg(X, t)) {col[i] = 1;S |= c[i];}}int cnt = 0;if (col[0] == 0) cnt++;rep(i, K - 1) {if (col[i] != col[i + 1]) cnt++;}int ans = inf;if (X == S) {if (col.back() == 1) {chmin(ans, cnt);} else if (ids.back() != 0) {chmin(ans, cnt + 1);}}if (X == (S | x)) {if (col.back() == 0) {chmin(ans, cnt);} else if (ids.back() != 0) {chmin(ans, cnt + 1);}}cout << (ans == inf ? -1 : ans) << '\n';}}