結果
問題 | No.2393 Bit Grid Connected Component |
ユーザー |
![]() |
提出日時 | 2023-07-29 00:08:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 44 ms / 2,000 ms |
コード長 | 7,140 bytes |
コンパイル時間 | 2,248 ms |
コンパイル使用メモリ | 210,296 KB |
最終ジャッジ日時 | 2025-02-15 20:46:36 |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 20 |
ソースコード
#pragma region competitive_programming#ifdef __LOCAL#define _GLIBCXX_DEBUG#endif#pragma GCC optimize("Ofast")#include<bits/stdc++.h>//#include<atcoder/dsu>//#include "Rollback_dsu.hpp"//#include "Partial_Persistent_DSU.hpp"//#include<atcoder/math>//#include "modint_plus.hpp"//typedef atcoder::modint1000000007 mint;//typedef atcoder::modint998244353 mint;//#include "Matrix.hpp"//#include<atcoder/convolution>//#include "Formal_Power_Series.hpp"//#include "Bit_Convolution.hpp"//#include<atcoder/maxflow>//#include<atcoder/mincostflow>//#include "Primal_Dual.hpp"//#include "maxflow_mincap.hpp"//#include<atcoder/fenwicktree>//#include<atcoder/segtree>//#include<atcoder/lazysegtree>//#include "2D_Segment_Tree.hpp"//#include "DisjointSparseTable.hpp"//#include "SWAG.hpp"//#include "Mo_algorithm.hpp"//#include "Heavy_Light_Decomposition.hpp"//#include "Binary_Trie.hpp"//#include "LCT.hpp"//#include "Slope_Trick.hpp"//#include<atcoder/string>//#include<atcoder/scc>namespace tomo0608 {typedef long long ll;typedef long double ld;template <class T> using V = std::vector<T>;template <class T> using VV = V<V<T>>;template <class T> using VVV = V<VV<T>>;typedef std::pair<int, int> pii;typedef std::pair<long long, long long> pll;template<class... T>void input(T&... a) { (std::cin >> ... >> a); };#define INT(...) int __VA_ARGS__; IN(__VA_ARGS__)#define LL(...) long long __VA_ARGS__; IN(__VA_ARGS__)#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__)#define DBL(...) double __VA_ARGS__; IN(__VA_ARGS__)#define VEC(type, name, size) std::vector<type> name(size);IN(name)#define VECVEC(type, name, h, w) std::vector<std::vector<type>> name(h, std::vector<type>(w));IN(name)template<class T1, class T2> std::istream& operator>>(std::istream& is, std::pair<T1, T2>& p) { is >> p.first >> p.second; return is; }template<class T1, class T2> std::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& p) { os << '(' << p.first << ", " << p.second <<')'; return os; }template<class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) { for (auto& e : v) is >> e; return is; }template<class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) { for (auto& e : v) os << e << ' '; return os; }template<typename T> std::ostream& operator << (std::ostream& os, std::set<T>& set_var) { os << "{"; for (auto itr = set_var.begin(); itr !=set_var.end(); itr++) { os << *itr;++itr;if (itr != set_var.end()) os << ", ";itr--; }os << "}";return os; }template <typename T, typename U> std::ostream& operator<<(std::ostream& os, std::map<T, U>& map_var) { os << "{";for (auto itr = map_var.begin(); itr != map_var.end(); itr++) { os << *itr;itr++;if (itr != map_var.end()) os << ", ";itr--; }os << "}";return os; }void IN() {}template <class Head, class... Tail> void IN(Head& head, Tail &...tail) {std::cin >> head;IN(tail...);}void print() { std::cout << '\n'; }template<class T, class... Ts>void print(const T& a, const Ts&... b) { std::cout << a; (std::cout << ... << (std::cout << ' ', b)); std::cout <<'\n'; }void drop() { std::cout << '\n';exit(0); }template<class T, class... Ts>void drop(const T& a, const Ts&... b) { std::cout << a; (std::cout << ... << (std::cout << ' ', b)); std::cout <<'\n';exit(0); }#ifdef __LOCALvoid debug_out() { std::cerr << std::endl; }template < class Head, class... Tail> void debug_out(Head H, Tail... T) { std::cerr << ' ' << H; debug_out(T...); }#define debug(...) std::cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#define dump(x) std::cerr << 'L' << __LINE__ << " " << #x << " = " << (x) << std::endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endif#define rep1(a) for(long long i = 0; i < a; i++)#define rep2(i, a) for(long long i = 0; i < a; i++)#define rep3(i, a, b) for(long long i = a; i < b; i++)#define rep4(i, a, b, c) for(long long i = a; i < b; i += c)#define drep1(a) for(long long i = a-1; i >= 0; i--)#define drep2(i, a) for(long long i = a-1; i >= 0; i--)#define drep3(i, a, b) for(long long i = a-1; i >= b; i--)#define drep4(i, a, b, c) for(long long i = a-1; i >= b; i -= c)#define overload4(a, b, c, d, e, ...) e#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)#define drep(...) overload4(__VA_ARGS__, drep4, drep3, drep2, drep1)(__VA_ARGS__)#define endl '\n'} // namespace tomo0608namespace tomo0608 {#define ALL(x) x.begin(),x.end()template <class T = long long, class S> T SUM(const S& v) { return accumulate(ALL(v), T(0)); }#define MIN(v) *min_element(ALL(v))#define MAX(v) *max_element(ALL(v))#define SORT(v) sort(ALL(v))#define REVERSE(v) reverse(ALL(v))#define RSORT(v) sort(ALL(v)); reverse(ALL(v))#define UNIQUE(x) SORT(x), x.erase(unique(ALL(x)), x.end())#define lb(c, x) distance((c).begin(), lower_bound(ALL(c), (x)))#define ub(c, x) distance((c).begin(), upper_bound(ALL(c), (x)))template <typename T> void zip(std::vector<T>& x) { std::vector<T> y = x;UNIQUE(y);for (int i = 0; i < x.size(); ++i) { x[i] = lb(y, x[i]); } }template<class T> using priority_queue_rev = std::priority_queue<T, std::vector<T>, std::greater<T>>;template<class T, class U> inline bool chmax(T& a, const U& b) { if (a < b) { a = b; return 1; } return 0; }template<class T, class U> inline bool chmin(T& a, const U& b) { if (a > b) { a = b; return 1; } return 0; }template<class T> inline int count_between(std::vector<T>& a, T l, T r) { return lower_bound(ALL(a), r) - lower_bound(ALL(a), l); } // [l, r)#define bittest(n, k) (((n) >> k) & 1)int topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }int topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }int lowbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }int lowbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }#define perm(v) for(bool permrepflag = true; (permrepflag ? exchange(permrepflag, false) : next_permutation(ALL(v)));)template <typename T, typename S> T ceil(T x, S y) {assert(y);return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));}template <typename T, typename S> T floor(T x, S y) {assert(y);return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));}}//using namespace atcoder;using namespace std;using namespace tomo0608;int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 };int dy[8] = { 0, 1, 0, -1, 1, -1, -1, 1 };// インタラクティブ問題のときは出力するたびにcout.flush();を忘れない!!!!!void solve();int main() {std::cin.tie(0);std::ios_base::sync_with_stdio(false);std::cout << std::setprecision(20);int codeforces = 1;cin >> codeforces;while (codeforces--) {solve();}return 0;}#pragma endregionvoid solve() {LL(x, y);x |= (1LL << y) - 1;print(x & (x ^ (x + 1LL)));}