結果
問題 |
No.3102 floor sqrt xor
|
ユーザー |
|
提出日時 | 2025-04-11 22:17:47 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 18 ms / 2,000 ms |
コード長 | 7,113 bytes |
コンパイル時間 | 1,913 ms |
コンパイル使用メモリ | 197,664 KB |
実行使用メモリ | 7,844 KB |
最終ジャッジ日時 | 2025-04-11 22:17:51 |
合計ジャッジ時間 | 3,312 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h> using namespace std; #define overload4(_1, _2, _3, _4, name, ...) name #define rep1(n) for(int i = 0; i < (int)(n); ++i) #define rep2(i, n) for(int i = 0; i < (int)(n); ++i) #define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i) #define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c)) #define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i) #define ALL(a) (a).begin(), (a).end() #define Sort(a) (sort((a).begin(), (a).end())) #define RSort(a) (sort((a).rbegin(), (a).rend())) #define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end())) using i64 = int64_t; using i128 = __int128_t; using ll = long long; using ul = unsigned long long; using ull = unsigned long long; using ld = long double; using vi = vector<int>; using vll = vector<long long>; using vull = vector<unsigned long long>; using vc = vector<char>; using vst = vector<string>; using vd = vector<double>; using vld = vector<long double>; using P = pair<long long, long long>; template<class T> long long sum(const T &a){ return accumulate(a.begin(), a.end(), 0LL); } template<class T> auto min(const T &a){ return *min_element(a.begin(), a.end()); } template<class T> auto max(const T &a){ return *max_element(a.begin(), a.end()); } const long long MINF = 0x7fffffffffff; const long long INF = 0x1fffffffffffffff; const long long MOD = 998244353; const long double EPS = 1e-9; const long double PI = acos(-1); template<class T> inline bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; } template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; } template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; } template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; 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, 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; } template<class T, class U> void inGraph(vector<vector<T>> &G, U n, U m, bool directed = true, bool zero_index = true){ G.resize(n); for(int i = 0; i < m; i++){ int a, b; cin >> a >> b; if(!zero_index) a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } } template <typename T> long long binary_search(long long ok, long long ng, T check){ while(abs(ok - ng) > 1){ long long mid = (ok + ng) / 2; if(check(mid)) ok = mid; else ng = mid; } return ok; } template <typename T> long double binary_search_real(long double ok, long double ng, T check, int iter = 100){ for(int i = 0; i < iter; ++i){ long double mid = (ok + ng) / 2; if(check(mid)) ok = mid; else ng = mid; } return ok; } template <typename T> long long trisum(T a, T b){ long long res = ((b - a + 1) * (a + b)) / 2; return res; } template <typename T> T intpow(T x, int n){ T ret = 1; while(n > 0) { if(n & 1) (ret *= x); (x *= x); n >>= 1; } return ret; } template <typename T> T getReminder(T a, T b){ if(b == 0) return -1; if(a >= 0 && b > 0){ return a % b; } else if(a < 0 && b > 0){ return ((a % b) + b) % b; } else if(a >= 0 && b < 0){ return a % b; } else{ return (abs(b) - abs(a % b)) % b; } } template<class T, class U> inline T vin(T &vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; } template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; } template<class... T> void in(T&... a){ (cin >> ... >> a); } void out(){ cout << '\n'; } template<class T, class... Ts> void out(const T &a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; } void fout(){ cout << endl; } template<class T, class... Ts> void fout(const T &a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << endl; } void debug(){ cerr << '\n'; } template<class T, class... Ts> void debug(const T &a, const Ts&... b){ cerr << a; (cerr << ... << (cerr << ' ', b)); cerr << '\n'; } unsigned long long kthRoot(unsigned long long a, unsigned long long k){ unsigned long long tmp = powl(a, (long double) 1 / (long double) k); unsigned long long res = 0; vector<unsigned long long> border = {tmp - 1, tmp, tmp + 1}; for(auto x : border){ if(x == 0) continue; unsigned long long curr = a; for(int i = 0; i < (int) k; i++){ curr /= x; } if(curr >= 1) res = max(res, x); } return res; } ll T; void input(){ in(T); } void solve(){ ll n; in(n); ll s = kthRoot(n, 2); ll ss = kthRoot(s * 2, 2); ll x = 0, idx = -1; rrep(i, 60){ if((1LL << i) <= s){ idx = i; break; } x += (1LL << i) & n; } rrep(i, idx + 1){ if((1LL << i) <= ss){ break; } x += ((1LL << i) & s) ^ ((1LL << i) & n); } ll sq = kthRoot((x - ss * 2), 2); for(ll i = max(0LL, x - ss * 2); i <= x + ss * 2; i++){ while((sq + 1) * (sq + 1) <= i){ sq++; } if((i ^ sq) == n){ out(i); return; } } out(-1); // map<ll, ll> mp; // rep(i, 100){ // mp[i ^ kthRoot(i, 2)] = i; // } // for(auto [key, val] : mp){ // out(key, val); // } } int main(){ ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(20); T = 1; input(); while(T--) solve(); }