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 ladpro98

#include <cstring>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <climits>
#include <cstdlib>
#include <ctime>
#include <memory.h>
#include <cassert>
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define REP(i, a, b) for(int i = (a); i <=(b); i++)
#define FORD(i, a, b) for(int i = (a); i > (b); i--)
#define REPD(i, a, b) for(int i = (a); i >=(b); i--)
#define SZ(a) (int((a).size()))
#define ALL(a) (a).begin(), (a).end()
#define PB push_back
#define MP make_pair
#define LL long long
#define LD long double
#define II pair<int, int>
#define X first
#define Y second
#define VI vector<int>
#define neg(a) ((a) ^ 1)
const int N = 100005;

using namespace std;
int a[N], b[N], s[N], inDeg[N];
bool goOut[N];
int n, m, top;

int main() {
    ios :: sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    REP(i, 1, n) cin >> a[i];
    REP(i, 1, m) cin >> b[i];
    REP(i, 1, n) inDeg[a[i]]++;
    REP(i, 1, n) goOut[i] = 1;
    REP(i, 1, m)
    if (inDeg[i] == 0) s[top++] = i;
    while (top) {
        int v = s[--top];
        goOut[n + v] = 1;
        if (goOut[b[v]] && --inDeg[a[b[v]]] == 0) s[top++] = a[b[v]];
        goOut[b[v]] = 0;
    }
    REP(i, 1, n) cout << goOut[i] << ' '; cout << endl;
    REP(i, 1, m) cout << goOut[n + i] << ' ';
    return 0;
}

Code mẫu của RR

{$R+,Q+}
const
  FINP='';
  FOUT='';
  MAXN=100000;
var
  dd,vao,dich,h,hpos:array[1..MAXN] of longint;
  hsize,m,n:longint;
procedure inp;
var
  f:text;
  i,u:longint;
begin
  assign(f,FINP); reset(f);
  read(f,m,n);
  for i:=1 to m do
    begin
      read(f,u);
      dich[i]:=m+u;
    end;
  for i:=1 to n do read(f,dich[m+i]);
  close(f);
end;
procedure swap(var a,b:longint);
var
  temp:longint;
begin
  temp:=a; a:=b; b:=temp;
end;
procedure downHeap(i:longint);
var
  j:longint;
begin
  j:=i shl 1;
  while (j<=hsize) do
    begin
      if (j<hsize) and (vao[h[j+1]]<vao[h[j]]) then inc(j);
      if vao[h[j]]<vao[h[i]] then
        begin
          swap(hpos[h[i]],hpos[h[j]]);
          swap(h[i],h[j]);
        end;
      i:=j; j:=i shl 1;
    end;
end;
procedure upHeap(i:longint);
var
  j:longint;
begin
  j:=i shr 1;
  while (i>1) and (vao[h[i]]<vao[h[j]]) do
    begin
      swap(hpos[h[i]],hpos[h[j]]);
      swap(h[i],h[j]);
      i:=j; j:=i shr 1;
    end;
end;
procedure push(u:longint);
begin
  inc(hsize); h[hsize]:=u; hpos[u]:=hsize;
  upHeap(hsize);
end;
procedure pop(var u:longint);
begin
  u:=h[1]; hpos[u]:=0;
  swap(h[1],h[hsize]); dec(hsize);
  hpos[h[1]]:=1; downHeap(1);
end;
procedure ans;
var
  f:text;
  i:longint;
begin
  assign(f,FOUT); rewrite(f);
  for i:=1 to m do write(f,dd[i],' '); writeln(f);
  for i:=1 to n do write(f,dd[m+i],' '); writeln(f);
  close(f);
end;
procedure solve;
var
  i,u,v:longint;
begin
  for i:=1 to m+n do inc(vao[dich[i]]);
  for i:=1 to m+n do dd[i]:=-1;
  hsize:=0;
  for i:=1 to m+n do push(i);
  while hsize>0 do
    begin
      pop(u); dd[u]:=1;
      if dd[dich[u]]=-1 then
        begin
          dd[dich[u]]:=0;
          vao[dich[u]]:=-1;
          upHeap(hpos[dich[u]]);
          pop(v);
          if dd[dich[dich[u]]]=-1 then
            begin
              dec(vao[dich[dich[u]]]);
              upHeap(hpos[dich[dich[u]]]);
            end;
        end;
    end;
end;
begin
  inp;
  solve;
  ans;
end.

Code mẫu của hieult

#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>

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);
}

const int bfsz = 1 << 16;
char bf[bfsz + 5];
int rsz = 0;
int ptr = 0;
char gc() {
    if (rsz <= 0) {
        ptr = 0;
        rsz = (int) fread(bf, 1, bfsz, stdin);
        if (rsz <= 0)
            return EOF;
    }
    --rsz;
    return bf[ptr++];
}
void ga(char &c) {
    c = EOF;
    while (!isalpha(c))
        c = gc();
}
int gs(char s[]) {
    int l = 0;
    char c = gc();
    while (isspace(c))
        c = gc();
    while (c != EOF && !isspace(c)) {
        s[l++] = c;
        c = gc();
    }
    s[l] = '\0';
    return l;
}
template<class T> bool gi(T &v) {
    v = 0;
    char c = gc();
    while (c != EOF && c != '-' && !isdigit(c))
        c = gc();
    if (c == EOF)
        return false;
    bool neg = c == '-';
    if (neg)
        c = gc();
    while (isdigit(c)) {
        v = v * 10 + c - '0';
        c = gc();
    }
    if (neg)
        v = -v;
    return true;
}

typedef pair<int, int> II;
const ld PI = acos(-1.0);
const ld eps = 1e-12;
const int dr[] = { -1, 0, +1, 0};
const int dc[] = { 0, +1, 0, -1};
const int inf = (int) 1e9 + 5;
const ll linf = (ll) 1e18 + 5;
const int mod = (ll) (1e9 + eps);

using namespace std;
#define maxn 50005

int n, m, a[maxn], b[maxn], colora[maxn], colorb[maxn], f[maxn], que[maxn];

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

    scanf("%d %d", &n, &m);
    For(i, 1, n) scanf("%d", &a[i]);
    For(i, 1, m) scanf("%d", &b[i]);

    ms(f, 0);
    For(i, 1, n) {
        colora[i] = 1;
        colorb[a[i]] = 0;
        f[a[i]]++;
    }

    int size = 0, u;
    For(i, 1, m) if(!f[i]) que[size++] = i;
    Rep(i, size){
        u = que[i];
        colorb[u] = 1;
        if(colora[b[u]]){
            f[a[b[u]]]--;
            if(!f[a[b[u]]]){
                que[size++] = a[b[u]];
            }
            colora[b[u]] = 0;
        }
    }

    For(i, 1, n) printf("%d%c", colora[i], i == n ? '\n' : ' ');
    For(i, 1, m) printf("%d%c", colorb[i], i == m ? '\n' : ' ');

    return 0;
}