-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcontrollers1500.cpp
More file actions
54 lines (54 loc) · 1.32 KB
/
controllers1500.cpp
File metadata and controls
54 lines (54 loc) · 1.32 KB
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
#include<iostream>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<string>
using namespace std;
typedef long long ll;
bool ispossible(int a,int b,int plus,int minus){
if(plus == minus) return true;
int min_symbol = min(plus,minus);
int max_symbol = max(plus,minus);
int max_element = max(a,b);
int min_element = min(a,b);
int l = 0,r = min_symbol;
while(l <= r){
int mid = l + (r - l)/2;
int sign = (min_symbol == plus) ? 1 : -1;
int notsign = -1*sign;
ll val = ((ll)max_element*mid*sign) + ((ll)min_element*(min_symbol - mid)*sign) + ((ll)min_element*max_symbol*notsign);
if(val == 0){
return true;
}
if(val > 0){
if(min_symbol == plus) r = mid - 1;
else l = mid + 1;
}
if(val < 0){
if(min_symbol == plus) l = mid + 1;
else r = mid - 1;
}
}
return false;
}
int main(){
int n;
cin >> n;
string s;
cin >> s;
int plus = 0,minus = 0;
for(auto it : s){
if(it == '+') plus++;
else minus++;
}
int q;
cin >> q;
for(int i = 0; i < q; i++){
int a,b;
cin >> a >> b;
if(ispossible(a,b,plus,minus)) cout << "YES" << endl;
else cout << "NO" << endl;
}
return 0;
}