Submission #13096927

---

Source Code Expand

    #include<bits/stdc++.h>
using namespace std;
#define se second
#define fi first
#define ll long long
#define ld long double
#define pll pair<ll ,ll >
#define plll pair<ll,pll>
#define ppll pair<pll, pll>
#define pii pair<int, int> 
#define pb push_back
#define mod 1000000007

ll power(ll a,ll b){
    ll res=1ll;
    while(b>0){
        if(b%2!=0) res=(res*a)%mod;
        a=(a*a)%mod;
        b/=2;
    }
    return res%mod;
}
ll ncr(ll n,ll k){
    if(k>n-k) k=n-k;
    ll pro=1;
    for(ll i=0;i<k;i++){
        pro=(pro*(n-i))%mod;
        pro/=(i+1);
    }
    return (pro)%mod;
}

void swap(ll *a,ll *b) {
    ll temp=*a;
    *a=*b;
    *b=temp;
}
vector<ll> prime;
void seive(){
    vector<bool > isprime(1000001,true);
    for(int i=2;i*i<=1000000;i++){
        if(isprime[i]){
            for(int j=i*i;j<=1000000;j+=i){
                isprime[j]=false;
            }
        }
    }
    for(int i=2;i<=1000000;i++){
        if(isprime[i]) prime.push_back(i);
    }
}
vector<ll> parent;
ll find(ll p) {
    if(parent[p]==p) return parent[p];
    return parent[p]=find(parent[p]); 
}
void unun(ll a,ll b) {
    ll r1=find(a);
    ll r2=find(b);
    if(r1!=r2) parent[r2]=r1;
}
bool cmp(pair<string,pll> A,pair<string,pll> B) {
    return (A.se.fi-A.se.se)>(B.se.fi-B.se.se);
}
void solve() {
    ll n;
    cin>>n;
    string str;
    ll sum=0;
    vector<pair<string,pll> > arr;
    for(int i=0;i<n;i++) {
        cin>>str;
        ll val=0,op=0,cl=0,flag=0;
        for(int j=0;j<str.size();j++) {
            if(str[j]=='(') {
                val++;
                op++;
            }
            else {
                val--;
                if(val<0) flag=1;
                cl++;
            }
        }
        // cout<<val<<endl;
        if(flag==1) arr.pb({str,{op,cl}});
        else if(flag==0 && val!=0) arr.pb({str,{op,cl}});
        sum+=val;
    }
    if(sum!=0) {
        cout<<"No";
        return ;
    }
    else{
        sort(arr.begin(),arr.end(),cmp);
        int val=0;
        for(int i=0;i<arr.size();i++) {
            // cout<<arr[i].fi<<endl;
            for(int j=0;j<arr[i].fi.size();j++) {
                if(arr[i].fi[j]=='(') val++;
                else  val--;
                if(val<0) {
                    cout<<"No";
                    return ;
                }
            }
        }
        cout<<"Yes";
    }

}   


int main(void){
    ios_base::sync_with_stdio(false); 
    cin.tie(NULL);
    cout.tie(NULL);
    int t;
    t=1;
    // cin>>t;
    while(t--) {
        solve();
        cout<<endl;
    }
    return 0; 

}

Submission Info

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:74:22: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   74 |         for(int j=0;j<str.size();j++) {
      |                     ~^~~~~~~~~~~
./Main.cpp:97:22: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<std::pair<std::__cxx11::basic_string<char>, std::pair<long long int, long long int> > >::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   97 |         for(int i=0;i<arr.size();i++) {
      |                     ~^~~~~~~~~~~
./Main.cpp:99:26: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   99 |             for(int j=0;j<arr[i].fi.size();j++) {
      |                         ~^~~~~~~~~~~~~~~~~

Judge Result