#975507 (C++14) No.2736 About half

• 問題: No.2736 About half
• ユーザー: Miz *
• 提出日時: 2024-04-20 15:54:55
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 2,982 bytes
• コンパイル時間: 1,137 ms
• コンパイル使用メモリ: 100,932 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-10-12 11:37:37
• 合計ジャッジ時間: 1,921 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
sample	AC * 3
other	AC * 15

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
#include<iostream> 
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<functional>
#include<map>
#include<set>
#include<math.h>
#include<bitset>
#include<cassert>
#include<random>
#include<chrono>
#include<tuple>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using i32 = int32_t;
using i8 = int8_t;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
template<class T> using despq = priority_queue<T>;
template<class T> using ascpq = priority_queue<T, vector<T>, greater<T>>;
#define efor(i, s, n, a) for (ll i = s; i != n; i+=a)
#define ffor(i, s, n) efor(i, s, n, 1)
#define rep(i, n) ffor(i, 0, n)
#define rrep(i, n) efor(i, n - 1, -1, -1)
#define itfor(i, c) for (__typeof((c).begin()) i=(c).begin();i!=(c).end();++i)
#define elif else if
#define inl(a) ll a; cin >> a
#define inll(a, b) ll a, b; cin >> a >> b
#define inlll(a, b, c) ll a, b, c; cin >> a >> b >> c
#define ins(s) string s; cin >> s
#define out(a) cout << a 
#define out_(a) cout << a << " " 
#define outl(a) cout << a << "\n"
#define lmax(a, b) a=max(a,b)
#define lmin(a, b) a=min(a,b)
#define all(a) begin(a), end(a)
#define inRange(x, l, r) l <= x && x <= r
#define mkp(a, b) make_pair(a, b)
// IsLeftLarger
template <typename T> bool chmin(T& a, const T& b) {
    if (a <= b) return false;
    a = b;
    return true;
}
template <typename T> bool chmax(T& a, const T& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T> T Max(vector<T>& a) {
    assert(!a.empty());
    T ret = a[0];
    for (int i = 0; i < (int)a.size(); i++) chmax(ret, a[i]);
    return ret;
}
template <typename T> T Min(vector<T>& a) {
    assert(!a.empty());
    T ret = a[0];
    for (int i = 0; i < (int)a.size(); i++) chmin(ret, a[i]);
    return ret;
}
template <typename T> T Sum(vector<T>& a) {
    T ret = 0;
    for (int i = 0; i < (int)a.size(); i++) ret += a[i];
    return ret;
}
inline void debug_out() { cout << "\n"; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cout << H << " ";
    debug_out(T...);
}
#ifdef ONLINE_JUDGE
#define dbg(...)
#else
#define dbg(...) {out("dbg:"); debug_out(__VA_ARGS__);}
#endif
constexpr ll oj_local(ll oj, ll local) {
# ifdef ONLINE_JUDGE
    dbg(local);
    return oj;
# else
    return local;
# endif
}
inline void newLine() { out('\n'); }
inline void Yes() { outl("Yes"); }
inline void No() { outl("No"); }
inline void YesNo(bool a) { if (a)Yes(); else No(); }
constexpr ll INF32 = 1123456789; // 10^9
constexpr ll LINF = 9112233445566778899; // 9*10^18
constexpr ll SaidaiSize = 912345; // 9×10^5 配列サイズ
constexpr ll mod = 998244353;
//ctime numeric
const i8 dh[4] = { 1,0,-1,0 }, dw[4] = { 0,1,0,-1 }; // 下、右、上、左
//const i8 dh[8] = { 1,1,1,0,0,-1,-1,-1 }, dw[8] = { 1,0,-1,1,-1,1,0,-1 };
i32 main() {
    cin.tie(0)->sync_with_stdio(0);
    ll TT = oj_local(1, 20);
    while (TT--) {
        inll(a, b);
        YesNo(a * 2 >= b && b * 2 >= a);
        
    }// グローバル変数初期化
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX