-
Notifications
You must be signed in to change notification settings - Fork 0
/
1913C.cpp
69 lines (52 loc) · 1.71 KB
/
1913C.cpp
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
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define pll pair<long long, long long>
#define f(i,s,e) for(long long int i=s;i<e;i++)
template <class T>
void print_v(vector<T> &v) { cout << "{"; for (auto x : v) cout << x << ","; cout << "\b}"; }
#define MOD 1000000007
#define PI 3.1415926535897932384626433832795
ll min(ll a,int b) { if (a<b) return a; return b; }
ll min(int a,ll b) { if (a<b) return a; return b; }
ll max(ll a,int b) { if (a>b) return a; return b; }
ll max(int a,ll b) { if (a>b) return a; return b; }
ll gcd(ll a,ll b) { if (b==0) return a; return gcd(b, a%b); }
ll lcm(ll a,ll b) { return a/gcd(a,b)*b; }
string to_upper(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A'; return a; }
string to_lower(string a) { for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A'; return a; }
bool prime(ll a) { if (a==1) return 0; for (int i=2;i<=round(sqrt(a));++i) if (a%i==0) return 0; return 1; }
void yes() { cout<<"YES\n"; }
void no() { cout<<"NO\n"; }
vector<ll> p(30);
void compute() {
p[0] = 1ll;
for(int i=1; i<30; i++)p[i] = p[i-1]*(2ll);
}
void solve() {
int t,a,b;
cin >> t;
vector<int> m(30);
for(int i=0; i<t; i++) {
cin >> a >> b;
if(a==1) {
m[b]++;
}else{
for(int i=29; i>=0; i--){
if(b<=0) break;
if(m[i] && p[i]<=b){
int need = min(b/(p[i]),m[i]);
b -= need*p[i];
}
}
if(b == 0) cout << "YES" << endl;
else cout << "NO" << endl;
}
}
}
int main(){
compute();
solve();
return 0;
}