結果
問題 | No.2195 AND Set |
ユーザー |
![]() |
提出日時 | 2023-01-20 21:35:22 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 206 ms / 2,000 ms |
コード長 | 2,561 bytes |
コンパイル時間 | 3,265 ms |
コンパイル使用メモリ | 181,012 KB |
最終ジャッジ日時 | 2025-02-10 04:30:56 |
ジャッジサーバーID (参考情報) |
judge4 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 13 |
ソースコード
#include <algorithm>#include <bitset>#include <cassert>#include <cmath>#include <cstdio>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <iterator>#include <map>#include <numeric>#include <queue>#include <set>#include <sstream>#include <stack>#include <unordered_set>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endif#define GET_MACRO(_1, _2, _3, NAME, ...) NAME#define _rep(i, n) _rep2(i, 0, n)#define _rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++)#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()using i64 = long long;template <class T, class U>bool chmin(T& a, const U& b) {return (b < a) ? (a = b, true) : false;}template <class T, class U>bool chmax(T& a, const U& b) {return (b > a) ? (a = b, true) : false;}inline void YesNo(bool f, string yes = "Yes", string no = "No") {std::cout << (f ? yes : no) << "\n";}template <typename T>istream& operator>>(istream& i, vector<T>& v) {rep(j, v.size()) i >> v[j];return i;}template <typename T>string join(vector<T>& v) {stringstream s;rep(i, v.size()) s << ' ' << v[i];return s.str().substr(1);}template <typename T>ostream& operator<<(ostream& o, vector<T>& v) {if (v.size()) o << join(v);return o;}template <typename T>string join(vector<vector<T>>& vv) {string s = "\n";rep(i, vv.size()) s += join(vv[i]) + "\n";return s;}template <typename T>ostream& operator<<(ostream& o, vector<vector<T>>& vv) {if (vv.size()) o << join(vv);return o;}int main() {cin.tie(nullptr);ios::sync_with_stdio(false);int q;cin >> q;vector<int> c(30);set<int> m;int cnt = 0;rep(j, q) {int t;cin >> t;if (t == 1) {int x;cin >> x;if (m.count(x)) continue;m.insert(x);cnt++;rep(i, 30) c[i] += (x >> i & 1);}if (t == 2) {int x;cin >> x;if (!m.count(x)) continue;cnt--;m.erase(x);rep(i, 30) c[i] -= (x >> i & 1);}if (t == 3) {int ans = 0;if (cnt == 0) {cout << -1 << "\n";continue;}rep(i, 30) ans += (c[i] == cnt) << i;cout << ans << "\n";}}}