Lưu ý: Các code mẫu dưới đây chỉ mang tính tham khảo và có thể không AC được bài tập này

Code mẫu của flashmt

#include<iostream>
#include<algorithm>
#define z 1000000007
#define fr(a,b,c) for (a=b;a<=c;a++)

using namespace std;
int n,a[111],b[111],d[16],c[4],s[4],p[111],e[4],f[4];
long long res;
int main()
{
    int i,x=11111,y=11111,xx=0,yy=0,j,u,uu,v,vv;
    cin >> n;
    fr(i,0,n-1)
    {
       cin >> a[i] >> b[i];
       x=min(x,a[i]); xx=max(xx,a[i]);
       y=min(y,b[i]); yy=max(yy,b[i]);
    }
    p[0]=1;
    fr(i,1,n+1) p[i]=(p[i-1]*2)%z;
    if (x==xx || y==yy)
    {
        if (n>2) cout << p[n-2]-1 << endl;
        else cout << 0 << endl;
        return 0;
    }
    fr(i,0,n-1)
    {
       u=0;
       if (a[i]==x) u++;
       if (a[i]==xx) u+=2;
       if (b[i]==y) u+=4;
       if (b[i]==yy) u+=8;
       d[u]++;
    }
    c[0]=d[5]; c[1]=d[6]; c[2]=d[9]; c[3]=d[10];
    s[0]=d[1]; s[1]=d[2]; s[2]=d[4]; s[3]=d[8];
    if (n<=15)
    {
       fr(i,1,(1<<n)-1)
       {
         u=11111; v=11111; uu=0; vv=0;
         fr(j,0,n-1)
           if (i>>j&1)
           {
              u=min(u,a[j]); uu=max(uu,a[j]);
              v=min(v,b[j]); vv=max(vv,b[j]);
           }
         if (u==x && v==y && uu==xx && vv==yy) res++; 
       }
       cout << --res << endl;
       return 0;
    }
    res=0;
    fr(i,0,15)
    {
       fr(j,0,3){ e[j]=0; f[j]=0; }
       int kt=0;
       fr(j,0,3)
         if (i>>j&1)
         {
            if (!c[j]) kt=1;
            e[j%2]=1; f[j/2]=1;
         }     
       if (kt) continue;
       if ((e[0]+s[0]) && (e[1]+s[1]) && (f[0]+s[2]) && (f[1]+s[3])) kt=0;
       else continue;
       long long t=1;
       fr(j,0,1)
       {
          t*=(p[s[j]]-1+e[j]);
          t%=z;
          if (t<0) t+=z;
       }    
       fr(j,2,3)
       {
          t*=(p[s[j]]-1+f[j-2]);
          t%=z;
          if (t<0) t+=z;
       }
       res+=t;
       res%=z;
    }
    res*=p[d[0]];
    res%=z;
    res--;
    if (res<0) res+=z;
    cout << res << endl;
    return 0;
}

Code mẫu của RR

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <string>
#include <deque>
#include <complex>

#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define ll long long
#define F first
#define S second
#define PB push_back
#define MP make_pair
using namespace std;

const double PI = acos(-1.0);
const int BASE = 1000000007;

pair<int,int> a[111];
ll f[111][20];

int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);
    int n; cin >> n;
    FOR(i,1,n) cin >> a[i].F >> a[i].S;
    int maxx, minx, maxy, miny;
    maxx = minx = a[1].F;
    maxy = miny = a[1].S;

    FOR(i,2,n) {
        maxx = max(maxx, a[i].F);
        minx = min(minx, a[i].F);

        maxy = max(maxy, a[i].S);
        miny = min(miny, a[i].S);
    }

    f[0][0] = 1;
    FOR(i,0,n-1)
    REP(now,16) {
        f[i+1][now] = (f[i+1][now] + f[i][now]) % BASE;
        int next = now;
        if (a[i+1].F == minx) next |= 1;
        if (a[i+1].F == maxx) next |= 2;
        if (a[i+1].S == miny) next |= 4;
        if (a[i+1].S == maxy) next |= 8;
        f[i+1][next] = (f[i+1][next] + f[i][now]) % BASE;
    }

    cout << f[n][15] - 1 << endl;

    return 0;
}

Code mẫu của hieult

#include <cstdio>
//#include <conio.h>
#define du 1000000007

int main()
{
    //freopen("V11HH.in","r",stdin);
    int n,x[101],y[101],flag;
    long long mu2[101];
    mu2[0] = 1; for(int i = 1;i<=101;i++) mu2[i] = (mu2[i-1]*2)%du;
    scanf("%d",&n);
    int xmin = 1000000, xmax = 0, ymin = 1000000, ymax = 0;
    int r[5],t;

    for(int i = 1;i<=n;i++)
    {
        scanf("%d %d",&x[i],&y[i]);
        if(x[i]<xmin) xmin = x[i];
        if(x[i]>xmax) xmax = x[i];
        if(y[i]<ymin) ymin = y[i];
        if(y[i]>ymax) ymax = y[i];
    }
    long long kq = 0;
    for(int ii = 0;ii<=15;ii++)
    {
        t = ii;
        for(int i = 1;i<=4;i++)
        {
            r[i] = t%2;
            t = t/2;
        }
        if(r[1] == 1)
        {
             flag = 0;
             for(int i = 1;i<=n;i++)
                 if(x[i]==xmin && y[i] == ymax)
                      flag = 1;
             if(flag == 0) continue;
        }
        if(r[2] == 1)
        {
             flag = 0;
             for(int i = 1;i<=n;i++)
                 if(x[i]==xmax && y[i] == ymax)
                      flag = 1;
             if(flag == 0) continue;
        }
        if(r[3] == 1)
        {
             flag = 0;
             for(int i = 1;i<=n;i++)
                 if(x[i]==xmax && y[i] == ymin)
                      flag = 1;
             if(flag == 0) continue;
        }
        if(r[4] == 1)
        {
             flag = 0;
             for(int i = 1;i<=n;i++)
                 if(x[i]==xmin && y[i] == ymin)
                      flag = 1;
             if(flag == 0) continue;
        }
        //printf("%d\n",ii);
        long long KQ = 1,T;
        T = 0;
        for(int i = 1;i<=n;i++) 
           if(y[i] == ymax && x[i]>xmin && x[i]<xmax) T++;
        if(r[1] == 1 || r[2] == 1) KQ = (KQ*mu2[T])%du;
        else KQ = (KQ*(mu2[T]-1))%du;  
        T = 0;
        for(int i = 1;i<=n;i++) 
           if(y[i] == ymin && x[i]>xmin && x[i]<xmax) T++;
        if(r[3] == 1 || r[4] == 1) KQ = (KQ*mu2[T])%du;
        else KQ = (KQ*(mu2[T]-1))%du;
        T = 0;
        for(int i = 1;i<=n;i++) 
           if(x[i] == xmax && y[i]>ymin && y[i]<ymax) T++;
        if(r[3] == 1 || r[2] == 1) KQ = (KQ*mu2[T])%du;
        else KQ = (KQ*(mu2[T]-1))%du;
        T = 0;
        for(int i = 1;i<=n;i++) 
           if(x[i] == xmin && y[i]>ymin && y[i]<ymax) T++;
        if(r[1] == 1 || r[4] == 1) KQ = (KQ*mu2[T])%du;
        else KQ = (KQ*(mu2[T]-1))%du;
        T = 0;
        for(int i = 1;i<=n;i++) 
           if(x[i]> xmin && x[i]< xmax && y[i]>ymin && y[i]<ymax) T++;
        KQ = (KQ*mu2[T])%du; 
        kq = (kq+KQ)%du;                        
    }
    printf("%lld",kq-1);
    //getch();
}

Code mẫu của ll931110

#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define mod 1000000007
using namespace std;

int x[105],y[105],n;
long long f[105][16];
int xa,ya,xb,yb;

int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d %d", &x[i], &y[i]);
  xa = xb = x[1];  ya = yb = y[1];
  for (int i = 1; i <= n; i++) {
    xa = min(xa,x[i]);
    xb = max(xb,x[i]);
    ya = min(ya,y[i]);
    yb = max(yb,y[i]);
  }

  memset(f,0,sizeof(f));
  f[0][0] = 1;
  for (int i = 0; i < n; i++)
    for (int mask = 0; mask < (1 << 4); mask++) if (f[i][mask]) {
        f[i + 1][mask] = (f[i + 1][mask] + f[i][mask]) % mod;
        int _mask = mask;
    if (x[i + 1] == xa) _mask |= 1;
    if (x[i + 1] == xb) _mask |= 2;
    if (y[i + 1] == ya) _mask |= 4;
    if (y[i + 1] == yb) _mask |= 8;
    f[i + 1][_mask] = (f[i + 1][_mask] + f[i][mask]) % mod;
    }
    printf("%lld\n", (f[n][15] + mod - 1) % mod);
}