結果
問題 | No.1298 OR XOR |
ユーザー | kcvlex |
提出日時 | 2020-11-27 21:25:28 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 4 ms / 2,000 ms |
コード長 | 3,462 bytes |
コンパイル時間 | 1,285 ms |
コンパイル使用メモリ | 148,648 KB |
最終ジャッジ日時 | 2025-01-16 06:22:57 |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 13 |
ソースコード
#include <limits>#include <initializer_list>#include <utility>#include <bitset>#include <tuple>#include <type_traits>#include <functional>#include <string>#include <array>#include <deque>#include <list>#include <queue>#include <stack>#include <vector>#include <map>#include <set>#include <unordered_map>#include <unordered_set>#include <iterator>#include <algorithm>#include <complex>#include <random>#include <numeric>#include <iostream>#include <iomanip>#include <sstream>#include <regex>#include <cassert>#include <cstddef>#include <variant>#define endl codeforces#define ALL(v) std::begin(v), std::end(v)#define ALLR(v) std::rbegin(v), std::rend(v)using ll = std::int64_t;using ull = std::uint64_t;using pii = std::pair<int, int>;using tii = std::tuple<int, int, int>;using pll = std::pair<ll, ll>;using tll = std::tuple<ll, ll, ll>;using size_type = ssize_t;template <typename T> using vec = std::vector<T>;template <typename T> using vvec = vec<vec<T>>;template <typename T> const T& var_min(const T &t) { return t; }template <typename T> const T& var_max(const T &t) { return t; }template <typename T, typename... Tail> const T& var_min(const T &t, const Tail&... tail) { return std::min(t, var_min(tail...)); }template <typename T, typename... Tail> const T& var_max(const T &t, const Tail&... tail) { return std::max(t, var_max(tail...)); }template <typename T, typename... Tail> void chmin(T &t, const Tail&... tail) { t = var_min(t, tail...); }template <typename T, typename... Tail> void chmax(T &t, const Tail&... tail) { t = var_max(t, tail...); }template <typename T, std::size_t Head, std::size_t... Tail>struct multi_dim_array { using type = std::array<typename multi_dim_array<T, Tail...>::type, Head>; };template <typename T, std::size_t Head>struct multi_dim_array<T, Head> { using type = std::array<T, Head>; };template <typename T, std::size_t... Args> using mdarray = typename multi_dim_array<T, Args...>::type;template <typename T, typename F, typename... Args>void fill_seq(T &t, F f, Args... args) {if constexpr (std::is_invocable<F, Args...>::value) {t = f(args...);} else {for (size_type i = 0; i < t.size(); i++) fill_seq(t[i], f, args..., i);}}template <typename T> vec<T> make_v(size_type sz) { return vec<T>(sz); }template <typename T, typename... Tail>auto make_v(size_type hs, Tail&&... ts) {auto v = std::move(make_v<T>(std::forward<Tail>(ts)...));return vec<decltype(v)>(hs, v);}namespace init__ {struct InitIO {InitIO() {std::cin.tie(nullptr);std::ios_base::sync_with_stdio(false);std::cout << std::fixed << std::setprecision(30);}} init_io;}template <typename T>T ceil_pow2(T bound) {T ret = 1;while (ret < bound) ret *= 2;return ret;}template <typename T>T ceil_div(T a, T b) { return a / b + !!(a % b); }tll solve() {ll n;std::cin >> n;std::bitset<64> bs(n);ll ans[] = { 0, 0, 0 };ll idx = 0;for (ll i = 0; i < 32; i++) {ll mask = 1ll << i;if (!(n & mask)) continue;ans[idx] += mask;idx++;idx %= 3;ans[idx] += mask;}if (ans[0] && ans[1] && ans[2]) return tll(ans[0], ans[1], ans[2]);return tll(-1, -1, -1);}int main() {auto [ a, b, c ] = solve();std::cout << a << ' ' << b << ' ' << c << '\n';return 0;}