結果
問題 | No.683 Two Operations No.3 |
ユーザー | tancahn2380 |
提出日時 | 2018-05-12 16:39:47 |
言語 | C++11 (gcc 11.4.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,992 bytes |
コンパイル時間 | 941 ms |
コンパイル使用メモリ | 108,424 KB |
実行使用メモリ | 13,756 KB |
最終ジャッジ日時 | 2024-06-28 09:36:34 |
合計ジャッジ時間 | 4,390 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
13,756 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 2 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,944 KB |
testcase_06 | TLE | - |
testcase_07 | -- | - |
testcase_08 | -- | - |
testcase_09 | -- | - |
testcase_10 | -- | - |
testcase_11 | -- | - |
testcase_12 | -- | - |
testcase_13 | -- | - |
testcase_14 | -- | - |
testcase_15 | -- | - |
ソースコード
# include <iostream> # include <algorithm> # include <vector> # include <string> # include <set> # include <map> # include <cmath> # include <iomanip> # include <functional> # include <utility> # include <stack> # include <queue> # include <list> # include <tuple> # include <unordered_map> # include <numeric> # include <complex> # include <bitset> # include <random> # include <chrono> # include <cstdlib> # include <tuple> # include <array> using namespace std; using LL = long long; using ULL = unsigned long long; constexpr int INF = 2147483647; constexpr int HINF = INF / 2; constexpr double DINF = 100000000000000000.0; constexpr double HDINF = 50000000000000000.0; constexpr long long LINF = 9223372036854775807; constexpr long long HLINF = 4500000000000000000; const double PI = acos(-1); template <typename T_char>T_char TL(T_char cX) { return tolower(cX); }; template <typename T_char>T_char TU(T_char cX) { return toupper(cX); }; const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 }; const int dx[4] = { 0,1,0,-1 }, dy[4] = { 1,0,-1,0 }; # define ALL(x) (x).begin(),(x).end() # define UNIQUE(c) sort(ALL((c)));(c).erase(unique(ALL((c))),(c).end()) # define LOWER(s) transform(ALL((s)),(s).begin(),TL<char>) # define UPPER(s) transform(ALL((s)),(s).begin(),TU<char>) # define FOR(i,a,b) for(LL i=(a);i<(b);i++) # define RFOR(i,a,b) for(LL i=(a);i>=(b);i--) # define REP(i,n) FOR(i,0,n) # define INIT std::ios::sync_with_stdio(false);std::cin.tie(0) LL a, b; bool solve(LL a, LL b) { queue<pair<LL, LL>>que; que.push(make_pair(a, b)); while (!que.empty()) { auto q = que.front(); que.pop(); if (q.first % 2 && q.second % 2)continue; if (!q.first && !q.second)return true; if (q.first % 2 == 0)que.push(make_pair(q.first / 2, q.second - 1)); if (q.second % 2 == 0)que.push(make_pair(q.first - 1, q.second / 2)); } return false; } int main() { cin >> a >> b; cout << (solve(a, b) ? "Yes" : "No") << endl; }