結果
問題 | No.2393 Bit Grid Connected Component |
ユーザー |
|
提出日時 | 2023-07-28 21:35:25 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 218 ms / 2,000 ms |
コード長 | 3,834 bytes |
コンパイル時間 | 4,845 ms |
コンパイル使用メモリ | 252,064 KB |
最終ジャッジ日時 | 2025-02-15 20:07:21 |
ジャッジサーバーID (参考情報) |
judge1 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 20 |
ソースコード
#include <bits/stdc++.h>#include <sys/time.h>#include <atcoder/all>using namespace std;using namespace atcoder;using ll = long long;using ull = unsigned long long;using ld = long double;using vi = vector<int>;using vvi = vector<vi>;using vvvi = vector<vvi>;using vl = vector<long>;using vvl = vector<vl>;using vll = vector<ll>;using vvll = vector<vll>;using vvvll = vector<vvll>;using vb = vector<bool>;using vvb = vector<vb>;using pii = pair<int, int>;using pll = pair<ll, ll>;using vpii = vector<pii>;using vpll = vector<pll>;using vstr = vector<string>;constexpr ll INF_LL=1e17;constexpr int INF_I=1LL<<30;constexpr ll inf = 1e12 + 7;#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 vector_cin(x) for(auto &n : (x)) cin >> n#define ALL(x) (x).begin(), (x).end()#define YesNo(x) ((x) ? "Yes": "No")#define pb emplace_back#define to_lower(S) transform(ALL((S)), (S).begin(), ::tolower)#define to_upper(S) transform(ALL((S)), (S).begin(), ::toupper)template <typename T>bool chmax(T &a, const T& b) {if (a < b){a = b;return true;}return false;}template <typename T>bool chmin(T &a, const T& b) {if (a > b){a = b;return true;}return false;}ll ceilint(ll x, ll y) {return (x + y - 1) / y;}void Main();int main() {std::cin.tie(nullptr);std::ios_base::sync_with_stdio(false);std::cout << std::fixed << std::setprecision(15);Main();return 0;}template <typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << "(" << p.first << "," << p.second << ")"; return os; }template <typename T1, typename T2>istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }template <typename T>ostream &operator<<(ostream &os, const vector<T> &v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 != (int)v.size() ? " ": "");}return os;}template <typename T>ostream &operator<<(ostream &os, const vector<vector<T>> &v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << endl;} return os;}template <typename T>ostream &operator<<(ostream &os, const vector<vector<vector<T>>> &v) { for (int i = 0; i < (int)v.size(); i++) { os << "i = " << i << endl; os << v[i];}return os;}template <typename T>istream &operator>>(istream &is, vector<T> &v) { for (T &in : v) is >> in; return is; }template <typename T, typename S>ostream &operator<<(ostream &os, const map<T, S> &mp) { for (auto &[key, val] : mp) { os << key << ":" << val << " ";} return os;}template <typename T>ostream &operator<<(ostream &os, const set<T> &st) { auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) {os << *itr << (i + 1 != (int)st.size() ? " ": "");itr++;}return os;}template <typename T>ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for (int i = 0; i < (int)st.size(); i++) { os << *itr << (i + 1 !=(int)st.size() ? " ": "");itr++;}return os;}template <typename T>ostream &operator<<(ostream &os, queue<T> q){ while (q.size()) { os << q.front() << " ";q.pop(); }return os;}template <typename T>ostream &operator<<(ostream &os, deque<T> q) { while (q.size()) { os << q.front() << " "; q.pop_front();} return os;}template <typename T>ostream &operator<<(ostream &os, stack<T> st) { while (st.size()){ os << st.top() << " "; st.pop();} return os;}template <class T, class Container, class Compare>ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq) { while (pq.size()) {os << pq.top() << " ";pq.pop();}return os;}//-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-void Main () {ll T;cin >> T;while (T--) {ll x, y;cin >> x >> y;while ((x >> y) & 1) {y++;}cout << (ll)powl(2, y) - 1 << endl;}}