Submission #48405945

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
using namespace std;
int n,m,ans = 0x3f3f3f3f;
int a[10][10],b[10][10];
int p[10],q[10];
int main()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
    {
        for(int j = 1;j <= m;j++)
        {
            cin >> a[i][j];
        }
    }
    for(int i = 1;i <= n;i++)
    {
        for(int j = 1;j <= m;j++)
        {
            cin >> b[i][j];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
using namespace std;
int n,m,ans = 0x3f3f3f3f;
int a[10][10],b[10][10];
int p[10],q[10];

int main()
{
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
    {
        for(int j = 1;j <= m;j++)
        {
            cin >> a[i][j];
        }
    }
    for(int i = 1;i <= n;i++)
    {
        for(int j = 1;j <= m;j++)
        {
            cin >> b[i][j];
        }
    }
    for(int i = 1;i <= n;i++)
    {
        p[i] = i;
    }
    for(int i = 1;i <= m;i++)
    {
        q[i] = i;
    }
    do
    {
        do
        {
            bool flag = 1;
            for(int i = 1;i <= n;i++)
            {
                for(int j = 1;j <= m;j++)
                {
                    if(a[p[i]][q[j]] != b[i][j])
                    {
                        flag = 0;
                    }
                }
            }
            if(!flag)
            {
                continue;
            }
            int mvp = 0,mvq = 0;
            for(int i = 1;i <= n;i++)
            {
                for(int j = 1;j <= n;j++)
                {
                    if(i < j && p[i] > p[j])
                    {
                        mvp++;
                    }
                }
            }
            for(int i = 1;i <= m;i++)
            {
                for(int j = 1;j <= m;j++)
                {
                    if(i < j && q[i] > q[j])
                    {
                        mvq++;
                    }
                }
            }
            ans = min(ans,mvp + mvq);
        }while(next_permutation(q + 1,q + m + 1));
    }while(next_permutation(p + 1,p + n + 1));
    if(ans == 0x3f3f3f3f)
    {
        cout << -1;
        return 0;
    }
    cout << ans;
    return 0;
}

Submission Info

Judge Result