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>
#include <cstdio>
#include <string>
#define oo 1000111
using namespace std;
const string res[]={"BIRD","NOT BIRD","UNKNOWN"};

int n,h[1010],w[1010],isBird[1010];

int between(int x,int l,int r)
{
  return x>=l && x<=r;
}

int check(int x,int y)
{
  int maxH=0,maxW=0,minH=oo,minW=oo;
  for (int i=1;i<=n;i++)
    if (isBird[i])
    {
      maxH=max(maxH,h[i]); minH=min(minH,h[i]);
      maxW=max(maxW,w[i]); minW=min(minW,w[i]);
    }
  if (between(x,minH,maxH) && between(y,minW,maxW)) return 0;
  maxH=max(maxH,x); minH=min(minH,x);
  maxW=max(maxW,y); minW=min(minW,y);
  for (int i=1;i<=n;i++)
    if (!isBird[i] && between(h[i],minH,maxH) && between(w[i],minW,maxW))
       return 1;
  return 2;
}

int main()
{
  int test,x,y,q;
  string s;
  cin >> test;
  for (int it=1;it<=test;it++)
  {
    cout << "Case #" << it << ":" << endl;
    cin >> n;
    for (int i=1;i<=n;i++) 
    {
      cin >> h[i] >> w[i] >> s; 
      isBird[i]=s=="BIRD";
      if (!isBird[i]) cin >> s;
    }
    cin >> q;
    while (q--) cin >> x >> y, cout << res[check(x,y)] << endl;
  } 
}

Code mẫu của RR

#include <iostream>
#include <algorithm>

#define FOR(i,a,b)  for(int i=a; i<=b; i++)
#define FORD(i,a,b) for(int i=a; i>=b; i--)
#define P pair<int,int>
#define A first
#define X first
#define B second
#define Y second
#define MAXN 1011
#define oo 1000111
using namespace std;

int debug=0;
pair< P,P > rec1,rec2;
int cbird, cnbird;
P bird[MAXN],nbird[MAXN];

void inp() {
    char s[20];
    cbird = cnbird = 0;
    int n; scanf("%d",&n);
    while (n--) {
        P u;
        scanf("%d %d",&u.X,&u.Y);
        gets(s);
        if (s[1]=='B') {
            cbird++;
            bird[cbird]=u;
        } else {
            cnbird++;
            nbird[cnbird]=u;
        }
    }
}

void solve() {
    int n; scanf("%d",&n);
    if (cbird) {
        rec1.A.X=oo;
        rec1.A.Y=oo;
        rec1.B.X=0;
        rec1.B.Y=0;
        FOR(i,1,cbird) {
            rec1.A.X <?= bird[i].X;
            rec1.A.Y <?= bird[i].Y;
            rec1.B.X >?= bird[i].X;
            rec1.B.Y >?= bird[i].Y;
        }
        if (debug) cout<<"Bird: "<<rec1.A.X<<" "<<rec1.A.Y<<" "<<rec1.B.X<<" "<<rec1.B.Y<<endl;

        rec2.A.X=0;
        rec2.A.Y=0;
        rec2.B.X=oo;
        rec2.B.Y=oo;
        FOR(i,1,cnbird) {
            if (rec1.A.X <= nbird[i].X && nbird[i].X <= rec1.B.X) {
                if (nbird[i].Y > rec1.B.Y) rec2.B.Y <?= nbird[i].Y;
                else rec2.A.Y >?= nbird[i].Y;
            }
            if (rec1.A.Y <= nbird[i].Y && nbird[i].Y <= rec1.B.Y) {
                if (nbird[i].X > rec1.B.X) rec2.B.X <?= nbird[i].X;
                else rec2.A.X >?= nbird[i].X;
            }            
        }
        if (debug) cout<<"Not bird: "<<rec2.A.X<<" "<<rec2.A.Y<<" "<<rec2.B.X<<" "<<rec2.B.Y<<endl;
    }

    while (n--) {
        P u;
        scanf("%d %d",&u.X,&u.Y);

        bool ok=false;
        FOR(i,1,cbird)
            if (bird[i].X==u.X && bird[i].Y==u.Y) {
                printf("BIRD\n");
                ok=true;
                break;
            }
        if (ok) continue;

        FOR(i,1,cnbird)
            if (nbird[i].X==u.X && nbird[i].Y==u.Y) {
                printf("NOT BIRD\n");
                ok=true;
                break;
            }
        if (ok) continue;

        if (!cbird) {
            printf("UNKNOWN\n");
            continue;
        }

        if (rec1.A.X<=u.X && u.X<=rec1.B.X && 
            rec1.A.Y<=u.Y && u.Y<=rec1.B.Y) {
                printf("BIRD\n");
                continue;
        }

        if (rec2.A.X<u.X && u.X<rec2.B.X && 
            rec2.A.Y<u.Y && u.Y<rec2.B.Y) {
        } else {
            printf("NOT BIRD\n");
            continue;
        }

        FOR(i,1,cnbird) {
            if (nbird[i].X < rec1.A.X && nbird[i].Y > rec1.B.Y)
                if (u.X <= nbird[i].X && u.Y >= nbird[i].Y) {
                    printf("NOT BIRD\n");
                    ok=true;
                    break;
                }

            if (nbird[i].X > rec1.B.X && nbird[i].Y > rec1.B.Y)
                if (u.X >= nbird[i].X && u.Y >= nbird[i].Y) {
                    printf("NOT BIRD\n");
                    ok=true;
                    break;
                }

            if (nbird[i].X < rec1.A.X && nbird[i].Y < rec1.A.Y)
                if (u.X <= nbird[i].X && u.Y <= nbird[i].Y) {
                    printf("NOT BIRD\n");
                    ok=true;
                    break;
                }

            if (nbird[i].X > rec1.B.X && nbird[i].Y < rec1.A.Y)
                if (u.X >= nbird[i].X && u.Y <= nbird[i].Y) {
                    printf("NOT BIRD\n");
                    ok=true;
                    break;
                }
        }

        if (!ok) printf("UNKNOWN\n");
    }
}

int main() {
    int test; scanf("%d",&test);
    FOR(i,1,test) {
        inp();
        printf("Case #%d:\n",i);
        solve();
    }
    return 0;
}

Code mẫu của hieult

#pragma comment(linker, "/STACK:16777216")

#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <iostream>
#include <algorithm>

#include <ctime>
#include <deque>
#include <bitset>
#include <cctype>
#include <utility>
#include <cassert>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned int ui;
typedef unsigned long long ull;

#define Rep(i,n) for(int i = 0; i < (n); ++i)
#define Repd(i,n) for(int i = (n)-1; i >= 0; --i)
#define For(i,a,b) for(int i = (a); i <= (b); ++i)
#define Ford(i,a,b) for(int i = (a); i >= (b); --i)
#define Fit(i,v) for(__typeof((v).begin()) i = (v).begin(); i != (v).end(); ++i)
#define Fitd(i,v) for(__typeof((v).rbegin()) i = (v).rbegin(); i != (v).rend(); ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define sz(a) ((int)(a).size())
#define all(a) (a).begin(), (a).end()
#define ms(a,x) memset(a, x, sizeof(a))

template<class F, class T> T convert(F a, int p = -1) { stringstream ss; if (p >= 0) ss << fixed << setprecision(p); ss << a; T r; ss >> r; return r; }
template<class T> T gcd(T a, T b) { T r; while (b != 0) { r = a % b; a = b; b = r; } return a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T> T sqr(T x) { return x * x; }
template<class T> T cube(T x) { return x * x * x; }
template<class T> int getbit(T s, int i) { return (s >> i) & 1; }
template<class T> T onbit(T s, int i) { return s | (T(1) << i); }
template<class T> T offbit(T s, int i) { return s & (~(T(1) << i)); }
template<class T> int cntbit(T s) { return s == 0 ? 0 : cntbit(s >> 1) + (s & 1); }

typedef pair<int, int> II;

const double PI = acos(-1.0);
const double eps = 1e-9;

const int dr[] = {-1, 0, +1, 0};
const int dc[] = {0, +1, 0, -1};

const int inf = (int)1e9 + 5;
const ll linf = (ll)1e16 + 5;
const ll mod = (ll)1e9 + 7;

#define maxn 10005
char s[15];
int test, n, q, size, xl, xr, yl, yr;
II P[maxn];

bool thoaman(int x, int d, int x1, int x2){
    if(d >= x1 && d <= x2) return true;
    return (x - d) * 1ll * (d - x1) >= 0ll;
}

void solve(int x, int y){
    if(size == n){
        Rep(i, size) if(P[i].fi == x && P[i].se == y){
            cout << "NOT BIRD" << endl;
            return;
        }
        cout << "UNKNOWN" << endl;
    }
    else{
        if(x >= xl && x <= xr && y >= yl && y <= yr){
            cout << "BIRD" << endl;
            return;
        }

        Rep(i, size){
            if(thoaman(x, P[i].fi, xl, xr) && thoaman(y, P[i].se, yl, yr)){
                cout << "NOT BIRD" << endl;
                return;
            }
        }

        cout << "UNKNOWN" << endl;
    }
}

int main(){
//    freopen("in.txt", "r", stdin);

    cin >> test;
    For(itest, 1, test){
        cout << "Case #" << itest << ":" << endl;
        scanf("%d", &n);
        int u, v;
        size = 0;
        xl = inf; xr = -inf; yl = inf; yr = -inf;
        Rep(run, n){
            scanf("%d %d %s", &u, &v, s);
            if(s[0] == 'N'){
                scanf("%s", s);
                P[size++] = mp(u, v);
            }
            else{
                xl = min(xl, u); xr = max(xr, u);
                yl = min(yl, v); yr = max(yr, v);
            }
        }

        scanf("%d", &q);
        Rep(run, q){
            scanf("%d %d", &u, &v);
            solve(u, v);
        }
    }

    return 0;
}

Code mẫu của khuc_tuan

import java.util.Scanner;

public class Main {

    static class Data {
        int h, w;
        boolean isbird;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int ntest = sc.nextInt();
        for (int test = 1; test <= ntest; ++test) {
            int n = sc.nextInt();
            Data[] a = new Data[n];
            int minh = Integer.MAX_VALUE;
            int maxh = Integer.MIN_VALUE;
            int minw = Integer.MAX_VALUE;
            int maxw = Integer.MIN_VALUE;
            for (int i = 0; i < n; ++i) {
                a[i] = new Data();
                a[i].h = sc.nextInt();
                a[i].w = sc.nextInt();
                a[i].isbird = (sc.nextLine().equals(" BIRD"));

                if (a[i].isbird) {
                    minh = Math.min(minh, a[i].h);
                    maxh = Math.max(maxh, a[i].h);
                    minw = Math.min(minw, a[i].w);
                    maxw = Math.max(maxw, a[i].w);
                }

            }
            int m = sc.nextInt();
            System.out.println("Case #" + test + ":");
            for (int i = 0; i < m; ++i) {
                int h = sc.nextInt();
                int w = sc.nextInt();
                boolean notbird = false;
                if (h < minh || h > maxh || w < minw || w > maxw) {
                    notbird = true;
                }

                int minh2 = Math.min(minh, h);
                int maxh2 = Math.max(maxh, h);
                int minw2 = Math.min(minw, w);
                int maxw2 = Math.max(maxw, w);

                boolean bird = true;
                for (int j = 0; j < n; ++j)
                    if (!a[j].isbird) {
                        if (minh2 <= a[j].h && a[j].h <= maxh2 && minw2 <= a[j].w && a[j].w <= maxw2) {
                            bird = false;
                            break;
                        }
                    }

                if (bird && !notbird)
                    System.out.println("BIRD");
                else if (!bird && notbird)
                    System.out.println("NOT BIRD");
                else
                    System.out.println("UNKNOWN");
            }
        }
    }
}