1400 - Employment.cpp

#include <bits/stdc++.h>
using namespace std;
int pref[220][110];
int n;
bool check (int w, int m, int m1)
{
    for(int i = 0; i < n; i++)
    {
        if(pref[w][i] == m1)
            return true;
        if(pref[w][i] == m)
            return false;
    }
}
void stable_marriage()
{
    int p[110];
    bool free[110];
    memset(p, -1, sizeof p);
    memset(free, false, sizeof free);
    int cnt  =n;
    while (cnt > 0)
    {

        int m;
        for (m = 0; m < n; m++)
            if (free[m] == false)
                break;
        for (int i = 0; i < n && free[m] == false; i++)
        {
            int w = pref[m][i];
            if (p[w-n] == -1)
            {
                p[w-n] = m;
                free[m] = true;
                cnt--;
            }

            else
            {
                int m1 = p[ w- n];
                if (check(w, m, m1) == false)
                {
                    p[w-n] = m;
                    free[m] = true;
                    free[m1] = false;
                }
            }
        }

    }

        for (int i = 0; i < n; i++)
            printf(" (%d %d)" , p[i] + 1, i + n + 1);

}
int main()
{
    int tes , c = 0;
    cin >> tes;
    while(tes--)
    {
        c++;
        cin >> n;

        for(int i = 0; i < n * 2; i++)
        {
            for(int j = 0; j < n; j++)
            {
                cin >> pref[i][j];
                pref[i][j]--;


            }
        }
         printf("Case %d:",c);
        stable_marriage();
        printf("\n");
    }



}