fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. string a;
  31.  
  32. bool checkRbs(string s){
  33. int sum = 0;
  34. for(int i=0; i<s.size(); i++){
  35. if(s[i] == '(') sum++;
  36. else sum--;
  37. if(sum<0) return false;
  38. }
  39. return sum == 0;
  40. }
  41.  
  42. string consistency(int n){
  43.  
  44. int op = n/2;
  45. int cl = n/2;
  46.  
  47. vector<int> pos;
  48. for(int i=0; i<n; i++){
  49. if(a[i] == '?') pos.push_back(i);
  50. else if(a[i] == '(') op--;
  51. else cl--;
  52. }
  53.  
  54. int m = pos.size();
  55. for(int i=0, open=1; i<m; i++){
  56. if(open<=op){
  57. a[pos[i]] = '(';
  58. open++;
  59. }
  60. else{
  61. a[pos[i]] = ')';
  62. }
  63. }
  64.  
  65.  
  66. if(op<=0 || cl <= 0) return "YES";
  67.  
  68. swap(a[pos[op-1]], a[pos[op]]);
  69.  
  70. if(checkRbs(a)) return "NO";
  71. return "YES";
  72.  
  73. }
  74.  
  75.  
  76.  
  77.  
  78.  
  79.  
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86.  
  87.  
  88.  
  89. string practice(int n){
  90.  
  91.  
  92. return 0;
  93. }
  94.  
  95.  
  96.  
  97.  
  98.  
  99. void solve() {
  100.  
  101. int n;
  102. cin >> a;
  103. n = a.size();
  104.  
  105. cout << consistency(n) << endl;
  106.  
  107.  
  108. }
  109.  
  110.  
  111.  
  112.  
  113.  
  114. int32_t main() {
  115. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  116.  
  117. int t = 1;
  118. cin >> t;
  119. while (t--) {
  120. solve();
  121. }
  122.  
  123. return 0;
  124. }
Success #stdin #stdout 0.01s 5316KB
stdin
5
(?))
??????
()
??
?(?)()?)
stdout
YES
NO
YES
YES
NO