Submission #17172850

---

Source Code Expand

///Bismillahir Rahmanir Rahim
#include "bits/stdc++.h"

#define                           ll                          long long
#define                           int                         ll
#define                           fi                          first
#define                           si                          second
#define                           mp                          make_pair
#define                           pb                          push_back
#define                           pi                          pair<ll,ll>
#define                           node(a,b,c)                 mp(mp(a,b),c)
#define                           clr(x)                      memset(x,0,sizeof(x));
#define                           f(i,l,r)                    for(int i=l;i<=r;i++)
#define                           rf(i,r,l)                   for(int i=r;i>=l;i--)
#define                           done(i)                     cout<<"done = "<<i<<endl;
#define                           show(x,y)                   cout<<x<<" : ";for(auto z:y)cout<<z<<" ";cout<<endl;
#define                           fast                        ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

using namespace std;

const ll inf=1e18;
const int mod=1e9+7;
const int M=205;
const int N=105;
int n;
int a[N],b[N];
int dp[M][N];
int yo[M];
int n2;
int work(int lft,int rgt)
{
    int len=rgt-lft+1;
    int ret=0;
    int h=len/2;
    for(int i=1,j=lft;i<=h;i++,j++)
    {
        yo[j]=1;
    }
    for(int i=1,j=rgt;i<=h;i++,j--)
    {
        yo[j]=2;
    }
    f(i,1,n)
    {
        if(a[i]!=-1 && b[i]!=-1)
        {
            if(a[i]>=lft && a[i]<=rgt && b[i]>rgt)return -1;
            if(b[i]>=lft && b[i]<=rgt && a[i]<lft)return -1;
            if(a[i]>=lft && a[i]<=rgt && b[i]>=lft && b[i]<=rgt)
            {
                 int gap=b[i]-a[i];
                 if(gap!=h)return -1;
                 if(yo[a[i]]==1 && yo[b[i]]==2)
                 {
                     ret++;
                     yo[a[i]]=0;
                     yo[b[i]]=0;
                 }
                 else
                 {
                     return -1;
                 }
            }
        }
        else if(a[i]!=-1)
        {
             if(a[i]>=lft && a[i]<=rgt)
             {
                 if(yo[a[i]]!=1)return -1;
                 int nxt=a[i]+h;
                 if(nxt>rgt)return -1;
                 if(yo[nxt]!=2)return -1;
                 ret++;
                 yo[a[i]]=0;
                 yo[nxt]=0;
             }
        }
       else if(b[i]!=-1)
        {
             if(b[i]>=lft && b[i]<=rgt)
             {
                 if(yo[b[i]]!=2)return -1;
                 int nxt=b[i]-h;
                 if(nxt<lft)return -1;
                 if(yo[nxt]!=1)return -1;
                 ret++;
                 yo[b[i]]=0;
                 yo[nxt]=0;
             }
        }
    }
    f(i,lft,rgt)
    {
        if(yo[i]==1)ret++;
    }
    return ret;

}

int solve(int pos,int baki)
{
    if(pos>n2)
    {
        if(baki==0)return 1LL;
        else return 0LL;
    }
    int &ret=dp[pos][baki];
    if(ret!=(-1))return ret;
    ret=0;
    for(int j=pos;j<=n2;j++)
    {
         int len=j-pos+1;
         if(len%2)continue;
         int c=work(pos,j);
         if(c!=-1)
         {
             bool flag=solve(j+1,baki-c);
             if(flag==true)ret=true;
         }
    }
    return ret;
}
 main()

{
    fast
    memset(dp,-1,sizeof dp);
    set<int>s;
    int chk=0,flag=0;
    cin>>n;
    n2=2*n;
    f(i,1,n)
    {
        cin>>a[i]>>b[i];
        if(a[i]!=-1)s.insert(a[i]),chk++;
        if(b[i]!=-1)s.insert(b[i]),chk++;
        if(b[i]!=-1 && b[i]==1)flag=1;
        if(a[i]!=-1 && a[i]==n2)flag=1;
        if(a[i]!=-1 && b[i]!=-1)
        {
            if(a[i]>=b[i])flag=1;
        }

    }
    if(flag==1)
    {
        cout<<"No\n";return 0;
    }
    if(s.size()!=chk)
    {
        cout<<"No\n";return 0;
    }
    int ses=solve(1,n);
    if(ses)
    {
        cout<<"Yes\n";
    }
    else
    {
        cout<<"No\n";
    }
    return 0;

}

Submission Info

Compile Error

./Main.cpp:123:7: warning: ISO C++ forbids declaration of ‘main’ with no type [-Wreturn-type]
  123 |  main()
      |       ^
./Main.cpp: In function ‘int main()’:
./Main.cpp:149:16: warning: comparison of integer expressions of different signedness: ‘std::set<long long int>::size_type’ {aka ‘long unsigned int’} and ‘long long int’ [-Wsign-compare]
  149 |     if(s.size()!=chk)
      |        ~~~~~~~~^~~~~

Judge Result